Self-avoiding walk on nonunimodular transitive graphs
From MaRDI portal
Publication:2280539
DOI10.1214/18-AOP1322zbMath1448.60187arXiv1709.10515MaRDI QIDQ2280539
Publication date: 18 December 2019
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.10515
Sums of independent random variables; random walks (60G50) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Enumeration in graph theory (05C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)
Related Items (6)
Self‐avoiding walk on the hypercube ⋮ Slightly supercritical percolation on nonamenable graphs. II: Growth and isoperimetry of infinite clusters ⋮ Weakly self-avoiding walk on a high-dimensional torus ⋮ Nonuniqueness and mean-field criticality for percolation on nonunimodular transitive graphs ⋮ Hyperbolic self avoiding walk ⋮ Locality of the critical probability for transitive graphs of exponential growth
Cites Work
- Unnamed Item
- On the probability that self-avoiding walk ends at a given point
- Critical percolation on any quasi-transitive graph of exponential growth has no infinite clusters
- Self-avoiding walk is sub-ballistic
- Ergodic theory on stationary random graphs
- Self-avoiding walks and the Fisher transformation
- The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\)
- Bounds on connective constants of regular graphs
- The self-avoiding walk.
- Counting self-avoiding walks on free products of graphs
- Non-amenable Cayley graphs of high girth have \(p_c < p_u\) and mean-field exponents
- Percolation on nonunimodular transitive graphs
- Amenability, unimodularity, and the spectral radius of random walks on infinite graphs
- Self-avoiding walk in five or more dimensions. I: The critical behaviour
- Self-avoiding walks and amenability
- The Hammersley-Welsh bound for self-avoiding walk revisited
- Locality of connective constants
- Cubic graphs and the golden mean
- Logarithmic correction for the susceptibility of the 4-dimensional weakly self-avoiding walk: a renormalisation group analysis
- Extendable self-avoiding walks
- Decay of correlations in nearest-neighbor self-avoiding walk, percolation, lattice trees and animals
- Strict Inequalities for Connective Constants of Transitive Graphs
- Self-Avoiding Walks and Connective Constants
- THE LACE EXPANSION FOR SELF-AVOIDING WALK IN FIVE OR MORE DIMENSIONS
- On non-uniqueness of percolation on nonamenable Cayley graphs
- Nonuniqueness and mean-field criticality for percolation on nonunimodular transitive graphs
- Connective constants and height functions for Cayley graphs
- Lectures on Self-Avoiding Walks
- On the Number of Self-Avoiding Walks. II
- Self-Avoiding Walks on Hyperbolic Graphs
- FURTHER RESULTS ON THE RATE OF CONVERGENCE TO THE CONNECTIVE CONSTANT OF THE HYPERCUBICAL LATTICE
- A conjecture concerning a limit of non-Cayley graphs
This page was built for publication: Self-avoiding walk on nonunimodular transitive graphs
