Average hopcount of the shortest path in tree-like components with finite size
From MaRDI portal
Publication:2154398
DOI10.1016/J.PHYSA.2018.12.034OpenAlexW2907077004WikidataQ128643430 ScholiaQ128643430MaRDI QIDQ2154398FDOQ2154398
Authors: Dongchao Guo, Hao Yin, Cong Li, Xu Zhang 
Publication date: 19 July 2022
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physa.2018.12.034
Recommendations
- Betweenness centrality of an edge in tree-like components with finite size
- Size and Weight of Shortest Path Trees with Exponential Link Weights
- scientific article; zbMATH DE number 2006657
- THE AVERAGE WEIGHTED PATH LENGTH FOR A CLASS OF HIERARCHICAL NETWORKS
- A formula of average path length for unweighted networks
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Statistical mechanics, structure of matter (82-XX)
Cites Work
- Metric structure of random networks
- A critical point for random graphs with a given degree sequence
- The average distances in random graphs with given expected degrees
- Distances in random graphs with finite mean and infinite variance degrees
- Universality for the distance in finite variance random graphs
- Distances in random graphs with finite variance degrees
- Heat- and mass-transfer analysis for the condensing film flow along a vertical grooved tube
- Betweenness centrality of an edge in tree-like components with finite size
- The correlation of metrics in complex networks with applications in functional brain networks
Cited In (3)
This page was built for publication: Average hopcount of the shortest path in tree-like components with finite size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2154398)
