5 papers
Subcritical percolation and network archaeology on random recursive tree substrate networks
Shankar Bhamidi, Akshay Sakanaveeti
We study a network-archaeology problem for a dynamic graph whose latent substrate is a random recursive tree and whose observed topology is enriched by an independent homogeneous E…
Network evolution with mesoscopic delay
Sayan Banerjee, Shankar Bhamidi, Partha Dey +1
Owing to the influence of real-world networks both in science and society, numerous mathematical models have been developed to understand the structure and evolution of these syste…
Evolution of recursive trees with limited memory
Omer Angel, Shankar Bhamidi, Serte Donderwinkel +2
Motivated by questions in social networks, distributed computing and probabilistic combinatorics, the last few years have seen increasing interest in network evolution models where…
Functional Central limit theorems for microscopic and macroscopic functionals of inhomogeneous random graphs
Shankar Bhamidi, Amarjit Budhiraja, Akshay Sakanaveeti
We study inhomogeneous random graphs with a finite type space. For a natural generalization of the model as a dynamic network-valued process, the paper establishes the following re…
Network evolution with Macroscopic Delays: asymptotics and condensation
Sayan Banerjee, Shankar Bhamidi, Partha Dey +1
Preferential attachment models typically assume that each arriving vertex observes the current network before choosing its connection. Motivated by distributed systems and social n…