Internal DLA on cylinder graphs: fluctuations and mixing
From MaRDI portal
Publication:2201540
Abstract: We use coupling ideas introduced in cite{levine2018long} to show that an IDLA process on a cylinder graph forgets a typical initial profile in steps for large , where is the size of the base graph , and is the total variation mixing time of a simple random walk on . The main new ingredient is a maximal fluctuations bound for IDLA on which only relies on the mixing properties of the base graph and the Abelian property.
Recommendations
- Internal DLA on Sierpinski gasket graphs
- Critical random graphs: Diameter and mixing time
- Random graph asymptotics on high-dimensional tori. II: volume, diameter and mixing time
- Higher-order fluctuations in dense random graph models
- Lower bounds on fluctuations for internal DLA
- Sublogarithmic fluctuations for internal DLA
- Fluctuations for the partition function of Ising models on Erdös-Rényi random graphs
- The integrated density of states of the random graph Laplacian
- Approximating stationary distributions of fast mixing Glauber dynamics, with applications to exponential random graphs
Cites work
- scientific article; zbMATH DE number 218327 (Why is no real title available?)
- scientific article; zbMATH DE number 1563189 (Why is no real title available?)
- A maximal coupling for Markov chains
- Absorbing-state phase transition for driven-dissipative stochastic dynamics on \(\mathbb Z\)
- Counting Walks and Graph Homomorphisms via Markov Chains and Importance Sampling
- Efficient Markovian couplings: Examples and counterexamples
- From logarithmic to subdiffusive polynomial fluctuations for internal DLA and related growth models
- How long does it take for internal DLA to forget its initial profile?
- Internal DLA and the Gaussian free field
- Internal diffusion limited aggregation
- Logarithmic fluctuations for internal DLA
- On coupling of Markov chains
- Optimal Co-Adapted Coupling for the Symmetric Random Walk on the Hypercube
- Sublogarithmic fluctuations for internal DLA
Cited in
(6)- How long does it take for internal DLA to forget its initial profile?
- How far do activated random walkers spread from a single source?
- Internal DLA on mated-CRT maps
- Diffusion limited aggregation on a cylinder
- The bi-dimensional directed IDLA forest
- Continuous-time digital search tree and a border aggregation model
This page was built for publication: Internal DLA on cylinder graphs: fluctuations and mixing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2201540)