Talk abstract:

Codings of Markov Chains and Weighted Graphs

Selim Tuncel
Department of Mathematics
University of Washington
tuncel@math.washington.edu

When the edge weights of a weighted graph lie in a free Abelian group, for instance when they are real numbers, they may be naturally represented by monomials in one or more variables. I will pass to this representation to discuss (i) some of the objects associated with weighted graphs, such as the weight-per-symbol polytope and subgraphs arising from its faces, (ii) some related positivity issues, and (iii) the significance of these objects and issues for coding problems.

Material used during the talk

Back to Codes, Systems and Graphical Models