# prob

## Description

Creates a table of weighted numeric transitions. A

message causes the weighting, and a potential transition, to be calculated.## Examples

## Discussion

prob accepts lists of three numbers in its inlet. The third number represents the weight of the probability of going from states represented by the first two numbers. For example, would mean that there is a weight of 4 in going from state 1 to state 2. When prob receives a , it makes a random jump from its current state to another state based on its current weighting of transitions. If a transition can be made, the new state is sent out the left outlet. If not, a is sent out the right outlet. For any particular state, the weights of all possible transition states are summed. Thus if a state could jump to three states that had weights of 3 4 and 1, the first one (3) would occur 37.5% of the time, the second 50% of the time, and the third 12.5%. Note that any state can make a transition to itself with a list of the form (state state weight).

## Arguments

None.

## Attributes

### Common Box Attributes

## Messages

### bang

### int

#### Arguments

### list

#### Arguments

### clear

### dump

### embed

#### Arguments

### reset

#### Arguments

## Output

### bang

Out right outlet: If the current number (the last number chosen) has no possible transitions listed in the transition probability matrix,

is sent out (and nothing is sent out the left outlet) in response to a in the inlet.### int

Out left outlet: When prob sends out a number, which it chooses based on its knowledge of the last number chosen and the relative likelihood assigned to each possible subsequent number.

is received in the inlet,## See Also

Name | Description |
---|---|

anal | |

histo | |

mean | |

Max Data Tutorial 5: List Processing | Max Data Tutorial 5: List Processing |