Markov.Extra

Documentation

fromLists :: Eq b => [[a]] -> [b] -> b -> [(a, c -> b)]

Create a transition function from a transition matrix. Inputs should obey:

all (== length matrix) (map length matrix)
length matrix == length states

randomPath :: (Markov ((,) a) b, Real a, RandomGen g) => (a, b) -> g -> [(a, b)]

Returns a single realization of a Markov chain.

type (:*) a b = (a, b)

Easier way to write nested 2-tuples.

(>*<) :: a -> b -> a :* b infixl 5

Easier way to write nested 2-tuples. Left associative, binds weaker than + but stronger than ==.