Paths in the simple random graph and the Waxman graph

MaRDI QIDQ2763301zbMATH OpenFDO

Authors Piet Van Mieghem

Publication date 30 June 2002

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

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)

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

Cited in

(4)

• 2-3 paths in a lattice graph: random walks
• scientific article; zbMATH DE number 7478535 (Why is no real title available?)
• Estimating the parameters of the Waxman random graph
• 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)