Expected distance based on random walks

DOI10.1007/S10910-017-0808-YzbMath1386.94122OpenAlexW2755111265MaRDI QIDQ1708510

Gilles Caporossi, Marcia E. V. Segatto, Eglantine Camby, M. H. M. Paiva

Publication date: 23 March 2018

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01944246/file/RWIndex_JMC_revised.pdf

zbMATH Keywords

graphrandom walksdistancetopological index

Mathematics Subject Classification ID

Paths and cycles (05C38) Combinatorial probability (60C05) Applications of design theory to circuits and networks (94C30) Distance in graphs (05C12) Random walks on graphs (05C81) Flows in graphs (05C21)

Related Items (1)

Entropic Optimal Transport on Random Graphs

Uses Software

• AutoGraphiX

Cites Work

• Unnamed Item
• Unnamed Item
• Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
• Probability on Trees and Networks
• Sharp upper bounds for the number of spanning trees of a graph
• Distance in graphs
• Community structure in social and biological networks
• Generalized inverse of the Laplacian matrix and some applications

This page was built for publication: Expected distance based on random walks