activity
20202026
most citedDispersion on the Complete Graph

2 citations · 2 across the 8 of their papers we have counts for

collaborators
Showing 2024Show all

2 papers · 1 filter

math.PR2024

Small maximal clusters are very unlikely in critical random graphs

Umberto De Ambroggio

We describe a probabilistic methodology, based on random walk estimates, to obtain exponential upper bounds for the probability of observing unusually small maximal components in t…

math.PR2024

Limit Laws for Critical Dispersion on Complete Graphs

Umberto De Ambroggio, Tamás Makai, Konstantinos Panagiotou +1

We consider a synchronous process of particles moving on the vertices of a graph , introduced by Cooper, McDowell, Radzik, Rivera and Shiraga (2018). Initially, particles ar…