Given a countable graph $\mathcal{G}$ and a finite graph $H$, we consider $Hom(\mathcal{G}, H)$ the set of graph homomorphisms from $\mathcal{G}$ to $H$ and we study Gibbs measures supported on $Hom(\mathcal{G}, H)$. We develop some sufficient and other necessary conditions for the existence of Gibbs specifications on $Hom(\mathcal{G}, H)$ satisfying strong spatial mixing (with exponential decay rate). We relate this with previous work of Brightwell and Winkler, who showed that a graph $H$ has a combinatorial property called dismantlability iff for every $\mathcal{G}$ of bounded degree, there exists a Gibbs specification with unique Gibbs measure. We strengthen their result by showing that such Gibbs specification can be chosen to have weak...
Hom shifts form a class of multidimensional shifts of finite type (SFT) and consist of colorings of ...
We give a complete characterization of the two-state anti-ferromagnetic spin systems which exhibit s...
We study the problem of approximately counting matchings in hypergraphs of bounded maximum degree an...
Given a countable graph $\mathcal{G}$ and a finite graph $H$, we consider $Hom(\mathcal{G}, H)$ the ...
AbstractWe model physical systems with “hard constraints” by the space Hom(G, H) of homomorphisms fr...
Over the last few decades, there has been a growing interest in a measure-theoretical property of Gi...
We model physical systems with “hard constraints” by the space Hom(G, H) of homomorphisms from a loc...
Recursively-constructed couplings have been used in the past for mixing on trees. We show for the fi...
Recursively-constructed couplings have been used in the past for mixing on trees. We show how to ext...
We study the uniqueness of Gibbs measures constructed on infinite graphs, in which the vertexes admi...
Statistical physics models with hard constraints, such as the discrete hard-core gas model (random i...
Given two graphs G and H, the mapping of f:V(G)→V(H) is called a graph homomorphism from G to H if i...
The property of spatial mixing and strong spatial mixing in spin systems has been of interest becaus...
In this thesis we consider the anti-ferromagnetic Potts model on lattice graphs. A spin system under...
We generalize subgraph densities, arising in dense graph limit theory, to Markov spaces (symmetric m...
Hom shifts form a class of multidimensional shifts of finite type (SFT) and consist of colorings of ...
We give a complete characterization of the two-state anti-ferromagnetic spin systems which exhibit s...
We study the problem of approximately counting matchings in hypergraphs of bounded maximum degree an...
Given a countable graph $\mathcal{G}$ and a finite graph $H$, we consider $Hom(\mathcal{G}, H)$ the ...
AbstractWe model physical systems with “hard constraints” by the space Hom(G, H) of homomorphisms fr...
Over the last few decades, there has been a growing interest in a measure-theoretical property of Gi...
We model physical systems with “hard constraints” by the space Hom(G, H) of homomorphisms from a loc...
Recursively-constructed couplings have been used in the past for mixing on trees. We show for the fi...
Recursively-constructed couplings have been used in the past for mixing on trees. We show how to ext...
We study the uniqueness of Gibbs measures constructed on infinite graphs, in which the vertexes admi...
Statistical physics models with hard constraints, such as the discrete hard-core gas model (random i...
Given two graphs G and H, the mapping of f:V(G)→V(H) is called a graph homomorphism from G to H if i...
The property of spatial mixing and strong spatial mixing in spin systems has been of interest becaus...
In this thesis we consider the anti-ferromagnetic Potts model on lattice graphs. A spin system under...
We generalize subgraph densities, arising in dense graph limit theory, to Markov spaces (symmetric m...
Hom shifts form a class of multidimensional shifts of finite type (SFT) and consist of colorings of ...
We give a complete characterization of the two-state anti-ferromagnetic spin systems which exhibit s...
We study the problem of approximately counting matchings in hypergraphs of bounded maximum degree an...