2 papers
math.PR2017
The Robot Crawler Model on Complete k-Partite and Erdős-Rényi Random Graphs
Angus Davidson, Ayalvadi Ganesh
Web crawlers are used by internet search engines to gather information about the web graph. In this paper we investigate a simple process which models such software by walking arou…
math.PR2015
Maximal Steiner Trees in the Stochastic Mean-Field Model of Distance
A. Davidson, A. Ganesh
Consider the complete graph on vertices, with edge weights drawn independently from the exponential distribution with unit mean. Janson showed that the typical distance between…