40 citations · 80 across the 10 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
math.PR2013★ 1 cited
Degrees and distances in random and evolving Apollonian networks
István Kolossváry, Júlia Komjáthy, Lajos Vágó
This paper studies Random and Evolving Apollonian networks (RANs and EANs), in d dimension for any d>=2, i.e. dynamically evolving random d dimensional simplices looked as graphs i…
math.PR2013★ 3 cited
Degree distribution of shortest path trees and bias of network sampling algorithms
Shankar Bhamidi, Jesse Goodman, Remco van der Hofstad +1
In this article, we explicitly derive the limiting degree distribution of the shortest path tree from a single source on various random network models with edge weights. We determi…