The mean and variance of the distribution of shortest path lengths of random regular graphs

DOI10.1088/1751-8121/ac6f9aOpenAlexW4221164920MaRDI QIDQ5052039

O. Biham, Ido Tishby, Reimer Kühn, Eytan Katzav

Publication date: 18 November 2022

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

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

zbMATH Keywords

momentsmeanvariancerandom regular graphrandom networkdistribution of shortest path lengths

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Distance in graphs (05C12) Random walks on graphs (05C81)

Related Items (1)

Analytical results for the distribution of first-passage times of random walks on random regular graphs

Uses Software

• DLMF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Universality for the distance in finite variance random graphs
• Phase transitions in social networks
• The diameter of random regular graphs
• Metric structure of random networks
• The cavity method at zero temperature
• The average distance and the diameter of dense random regular graphs
• Distances in random graphs with finite mean and infinite variance degrees
• An Elementary View of Euler's Summation Formula
• Generating Random Networks and Graphs
• Universality for distances in power-law random graphs
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• Networks
• Dynamical Processes on Complex Networks
• The Average Distance in a Random Graph with Given Expected Degrees
• A critical point for random graphs with a given degree sequence
• The Diameter of Sparse Random Graphs
• The idemetric property: when most distances are (almost) the same
• Distances in random graphs with finite variance degrees
• Collective dynamics of ‘small-world’ networks
• The diameter of sparse random graphs
• The average distances in random graphs with given expected degrees
• The diameter of sparse random graphs
• Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication

This page was built for publication: The mean and variance of the distribution of shortest path lengths of random regular graphs