Range of cube-indexed random walk

DOI10.1007/BF02772616zbMath1017.60055OpenAlexW1972912467MaRDI QIDQ5951488

Jeffry Kahn

Publication date: 11 August 2003

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02772616

zbMATH Keywords

random graphsHamming cuberandom graph homomorphisms

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Sums of independent random variables; random walks (60G50) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Related Items

The diameter of a random subgraph of the hypercube ⋮ Rigidity of 3-colorings of the discrete torus ⋮ Random mappings of scaled graphs. ⋮ The number of 4-colorings of the Hamming cube ⋮ \(H\)-colouring bipartite graphs ⋮ Homomorphisms from the torus ⋮ Rigidity of proper colorings of \(\mathbb{Z}^d \) ⋮ A note on random homomorphism from arbitrary graphs to \(\mathbb{Z}\) ⋮ On homomorphisms from the Hamming cube to \(\mathbb{Z}\) ⋮ Delocalization of uniform graph homomorphisms from \({\mathbb{Z}}^2\) to \({\mathbb{Z}} \) ⋮ \(H\)-coloring tori ⋮ On the distribution of range for tree-indexed random walks ⋮ Lipschitz Functions on Expanders are Typically Flat ⋮ Logarithmic variance for the height function of square-ice

Cites Work

• Unnamed Item
• Unnamed Item
• Some intersection theorems for ordered sets and graphs
• Generalized rank functions and an entropy argument
• On random graph homomorphisms into \({\mathbb{Z}}\)
• An Entropy Approach to the Hard-Core Model on Bipartite Graphs

This page was built for publication: Range of cube-indexed random walk