First passage percolation on the Newman-Watts small world model
arXiv:1506.07693 · doi:10.1007/s10955-015-1442-3
Abstract
The Newman-Watts model is given by taking a cycle graph of n vertices and then adding each possible edge with probability for some constant. In this paper we add i.i.d. exponential edge weights to this graph, and investigate typical distances in the corresponding random metric space given by the least weight paths between vertices. We show that typical distances grow as for a and determine the distribution of smaller order terms in terms of limits of branching process random variables. We prove that the number of edges along the shortest weight path follows a Central Limit Theorem, and show that in a corresponding epidemic spread model the fraction of infected vertices follows a deterministic curve with a random shift.
arXiv comment29 pages, 4 figures
References in corpus (10)
- Renormalization group analysis of the small-world network model
- Scaling and percolation in the small-world network model
- Epidemics and percolation in small-world networks
- The phase transition in inhomogeneous random graphs
- Mean-field solution of the small-world network model
- First passage percolation on random graphs with finite mean degrees
- First Passage Percolation on Inhomogeneous Random Graphs
- Fixed speed competition on the configuration model with infinite variance degrees: unequal speeds
- The front of the epidemic spread and first passage percolation
- Competing first passage percolation on random regular graphs