First-passage percolation on the random graph

DOI10.1017/S026996480115206XMaRDI QIDQ2731307zbMATH OpenOpenAlexFDO

Authors Remco van der Hofstad, Gerard Hooghiemstra, Piet Van Mieghem

Publication date 22 November 2001

Published in Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s026996480115206x

zbMATH Keywords

first-passage percolationlimiting distributionMarkov chainrandom graphrecursive treesshortest path

Mathematics Subject Classification ID

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

Recommendations

• First passage percolation on random graphs with finite mean degrees
• Universality for first passage percolation on sparse random graphs
• First passage percolation on random geometric graphs and an application to shortest-path trees
• First passage percolation on the Erdős-Rényi random graph
• The flooding time in random graphs

Cited in

(36)

• Length of optimal path in random networks with strong disorder
• The flooding time in random graphs
• Local neighbourhoods for first-passage percolation on the configuration model
• Isolating the most recent entry in a random recursive tree by random cuts
• First passage percolation on random graphs with finite mean degrees
• Maximal edge-traversal time in first-passage percolation
• Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs
• Universality for first passage percolation on sparse random graphs
• Paths in the simple random graph and the Waxman graph
• First passage percolation on the Newman-Watts small world model
• Joint distribution of distances in large random regular networks
• Monotonicity in first-passage percolation
• First-passage percolation on a ladder graph, and the path cost in a VCG auction
• On the Markov transition kernels for first passage percolation on the ladder
• Weight of a link in a shortest path tree and the Dedekind eta function
• Extreme value theory, Poisson-Dirichlet distributions, and first passage percolation on random networks
• First passage percolation on the Erdős-Rényi random graph
• Multiple phase transitions in long-range first-passage percolation on square lattices
• OPTIMAL PATH AND MINIMAL SPANNING TREES IN RANDOM WEIGHTED NETWORKS
• The Weight and Hopcount of the Shortest Path in the Complete Graph with Exponential Weights
• Short paths for first passage percolation on the complete graph
• First passage percolation on locally treelike networks. I. Dense random graphs
• scientific article; zbMATH DE number 3907536 (Why is no real title available?)
• scientific article; zbMATH DE number 2034359 (Why is no real title available?)
• On the covariance of the level sizes in random recursive trees
• First-passage properties of the Erdos–Renyi random graph
• Competing first passage percolation on random regular graphs
• First passage percolation on sparse random graphs with boundary weights
• Asymptotics of First-Passage Percolation on One-Dimensional Graphs
• First passage percolation on random geometric graphs and an application to shortest-path trees
• WEIGHT OF THE SHORTEST PATH TO THE FIRST ENCOUNTERED PEER IN A PEER GROUP OF SIZE m
• Long-range first-passage percolation on the torus
• Multinomial random combinatorial structures and r-versions of Stirling, Eulerian and Lah numbers
• First passage percolation on Erdös-Rényi graphs with general weights
• Random sprouts as internet models, and Pólya processes
• First passage percolation on nilpotent Cayley graphs and beyond

This page was built for publication: First-passage percolation on the random graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2731307)