45 citations · 121 across the 13 of their papers we have counts for
4 papers · 1 filter
Deterministic construction of typical networks in network models
Narayan G. Sabhahit, Moritz Laber, Harrison Hartle +4
In network science, one often wants to say that a given real-world network appears to come from a particular network model. In statistical physics, the corresponding problem is abo…
Statistics of leaves in growing random trees
Harrison Hartle, P. L. Krapivsky
Leaves, i.e., vertices of degree one, can play a significant role in graph structure, especially in sparsely connected settings in which leaves often constitute the largest fractio…
Growing unlabeled networks
Harrison Hartle, Brennan Klein, Dmitri Krioukov +1
Models of growing networks are a central topic in network science. In these models, vertices are usually labeled by their arrival time, distinguishing even those node pairs whose s…
The Metric Dimension of Sparse Random Graphs
Josep Díaz, Harrison Hartle, Cristopher Moore
In 2013, Bollobás, Mitsche, and Pralat at gave upper and lower bounds for the likely metric dimension of random Erdős-Rényi graphs for a large range of expected degrees $d…