Paths in the simple random graph and the Waxman graph

zbMATH Open0988.05084MaRDI QIDQ2763301FDOQ2763301

Authors: Piet Van Mieghem 

Publication date: 30 June 2002

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

Recommendations

• Maximal paths in random dynamic graphs
• First-passage percolation on the random graph
• The Forwarding Indices of Random Graphs
• scientific article; zbMATH DE number 2006657
• First passage percolation on locally treelike networks. I. Dense random graphs

zbMATH Keywords

communications networkslink densityaverage number of pathsWaxman graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Paths and cycles (05C38)

Cited In (4)

• 2-3 paths in a lattice graph: random walks
• Estimating the parameters of the Waxman random graph
• Title not available (Why is that?)
• Extremal paths in inhomogenous random graphs

This page was built for publication: Paths in the simple random graph and the Waxman graph

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