On the average path length of a cycle plus random edges

DOI10.1016/J.ENDM.2015.07.048zbMath1347.05103OpenAlexW2219699678MaRDI QIDQ324818

S. M. O. H. Taha, Dimbinaina Ralaivaosaona

Publication date: 17 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.048

zbMATH Keywords

martingalesrandom processrandom graphsmall-world networkaverage path length

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Distance in graphs (05C12) Connectivity (05C40)

Cites Work

• Discrete small world networks
• Weighted sums of certain dependent random variables
• The Diameter of a Cycle Plus a Random Matching
• The diameter of randomly perturbed digraphs and some applications
• Collective dynamics of ‘small-world’ networks

This page was built for publication: On the average path length of a cycle plus random edges