Name
Abstract | ||
|---|---|---|
The method of types is one of the most popular technique in information theory and combinatorics. However, it was never thoroughly studied for Markov fields. Markov fields can be viewed as models for systems involving a large number of variables with local dependencies and interactions. These local dependencies can be captured by a shape of interactions (locations that contribute the next probability transition). Shapes marked by symbols from a finite alphabet are called tiles. Two assignments in a Markov filed have the same type if they have the same empirical distribution or they can be tiled by the same number of tile types. Our goal is to study the growth of the number of Markov field types or the number of tile types. This intricate and important problem was left open for too long. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/ISIT.2014.6875312 | Information Theory |
Keywords | Field | DocType |
Markov processes,Markov fields,combinatorics,finite alphabet,information theory,probability transition,tilings | Discrete mathematics,Combinatorics,Markov process,Markov property,Markov model,Markov chain,Pure mathematics,Variable-order Markov model,Markov kernel,Mathematics,Examples of Markov chains,Markov renewal process | Conference |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuliy Baryshnikov | 1 | 135 | 22.05 |
| Jaroslaw Duda | 2 | 6 | 2.44 |
| Wojciech Szpankowski | 3 | 1557 | 192.33 |