Mixing Time of Random Walk on Poisson Geometry Small World
From MaRDI portal
Publication:3389690
DOI10.1080/15427951.2015.1012608zbMath1491.05174arXiv1703.08257OpenAlexW1979930608MaRDI QIDQ3389690
Publication date: 23 March 2022
Published in: Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.08257
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Processes in random environments (60K37) Random walks on graphs (05C81)
Cites Work
- Unnamed Item
- Unnamed Item
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Renormalization group analysis of the small-world network model
- Lower bounds for the eigenvalues of Laplacian matrices
- The diameter of a scale-free random graph
- On a continuum percolation model
- Shuffling Cards and Stopping Times
- The Diameter of a Cycle Plus a Random Matching
- The Structure and Function of Complex Networks
- The Average Distance in a Random Graph with Given Expected Degrees
- Large deviations for discrete and continuous percolation
- Continuum Percolation
- Collective dynamics of ‘small-world’ networks
This page was built for publication: Mixing Time of Random Walk on Poisson Geometry Small World