First passage percolation on sparse random graphs with boundary weights

DOI10.1017/jpr.2019.30zbMath1415.60117arXiv1806.09568OpenAlexW3105123140MaRDI QIDQ5226251

No author found.

Publication date: 31 July 2019

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.09568

zbMATH Keywords

percolationbroadcastingconfiguration modelrumor spreadingincubation timefloodingsparse random graphSI epidemic model

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Cites Work

• Unnamed Item
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Stochastic epidemic models and their statistical analysis
• Stochastic order characterization of uniform integrability and tightness
• First passage percolation on random graphs with finite mean degrees
• The diameter of weighted random graphs
• Random Graphs and Complex Networks
• Information Spreading in a Large Population of Active Transmitters and Passive Receivers
• 50 Years of First-Passage Percolation
• The Impact of Degree Variability on Connectivity Properties of Large Networks
• A new approach to the giant component problem
• On Spreading a Rumor
• Nonuniversality of weighted random graphs with infinite variance degree
• One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights
• Diameters in Supercritical Random Graphs Via First Passage Percolation
• Performance Analysis of Complex Networks and Systems
• Flooding in Weighted Sparse Random Graphs
• Inequalities: theory of majorization and its applications
• Networks