On the mixing time of geographical threshold graphs
From MaRDI portal
Publication:409397
DOI10.1016/j.disc.2011.08.003zbMath1238.05242arXiv1109.4311OpenAlexW2107341492MaRDI QIDQ409397
Andrew Beveridge, Milan Bradonjić
Publication date: 13 April 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.4311
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80)
Cites Work
- Mixing time of exponential random graphs
- A note on an inequality involving the normal distribution
- On the cover time and mixing time of random geometric graphs
- The degree sequence of a scale-free random graph process
- The Structure of Geographical Threshold Graphs
- Emergence of Scaling in Random Networks
- A random graph model for massive graphs
- A Dynamic Model for On-Line Social Networks
- The Markov chain Monte Carlo revolution
- Random Geometric Graphs
- A Geometric Preferential Attachment Model of Networks II
- A Spatial Web Graph Model with Local Influence Regions
- Giant Component and Connectivity in Geographical Threshold Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item