On random graph homomorphisms into \({\mathbb{Z}}\)

DOI10.1006/jctb.1999.1931zbMath1023.05123MaRDI QIDQ1569064

Itai Benjamini, Elchanan Mossel, Olle Häggström

Publication date: 25 June 2000

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1999.1931

zbMATH Keywords

random walk; uniform probability measure

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

60C05: Combinatorial probability

82B20: Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics

Related Items

Unnamed Item, Annihilation and coalescence on binary trees, Range of cube-indexed random walk, \(H\)-coloring tori, A note on random homomorphism from arbitrary graphs to \(\mathbb{Z}\), On homomorphisms from the Hamming cube to \(\mathbb{Z}\), Uniqueness of uniform random colorings of regular trees, Random mappings of scaled graphs., Lipschitz Functions on Expanders are Typically Flat

Cites Work

• Gibbs measures and phase transitions
• Correlation inequalities on some partially ordered sets
• Tree-indexed random walks on groups and first passage percolation
• On the relation between finite range potentials and subshifts of finite type
• Concentration of measure and isoperimetric inequalities in product spaces
• The stochastic random-cluster process and the uniqueness of random-cluster measures
• Gaussian Hilbert Spaces
• A subshift of finite type that is equivalent to the Ising model
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item