The idemetric property: when most distances are (almost) the same
From MaRDI portal
Publication:5160620
DOI10.1098/rspa.2018.0283zbMath1472.05045arXiv1804.11187OpenAlexW3104524600WikidataQ92254883 ScholiaQ92254883MaRDI QIDQ5160620
George Barmpalias, Yicheng Pan, Tim Roughgarden, Xuechen Li, Neng Huang, Ang Sheng Li, Andrew E. M. Lewis-Pye
Publication date: 29 October 2021
Published in: Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.11187
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Diameters in preferential attachment models
- The diameter of a scale-free random graph
- Distances in random graphs with finite mean and infinite variance degrees
- Random Graphs and Complex Networks
- Typical Distances in Ultrasmall Random Networks
- Emergence of Scaling in Random Networks
- Undirected single-source shortest paths with positive integer weights in linear time
- The small-world phenomenon
- Triangulation and embedding using small sets of beacons
- Expander graphs and their applications
- Approximate distance oracles
- Note on the heights of random recursive trees and random m‐ary search trees
- The Average Distance in a Random Graph with Given Expected Degrees
- Faster all-pairs shortest paths via circuit complexity
- Distances in random graphs with finite variance degrees
- Collective dynamics of ‘small-world’ networks
- Greedy Routing and the Algorithmic Small-World Phenomenon
- Quasi‐random graphs with given degree sequences
- The average distances in random graphs with given expected degrees
- On a conditionally Poissonian graph process
- A Theorem on Boolean Matrices
- Quasi-random graphs
- Space-efficiency for routing schemes of stretch factor three
This page was built for publication: The idemetric property: when most distances are (almost) the same
