Umberto De Ambroggio

activity

20202026

most citedDispersion on the Complete Graph

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

collaborators

Showing 2021 · math.PRShow all

2 papers · 2 filters

math.PR2021

The probability of unusually large components for critical percolation on random $d$ -regular graphs

Umberto De Ambroggio, Matthew I. Roberts

Let $d \geq 3$ be a fixed integer, $p \in (0, 1)$ , and let $n \geq 1$ be a positive integer such that $d n$ is even. Let $G (n, d, p)$ be a (random) graph on $n$ vertices obtaine…

math.PR2021

An elementary approach to component sizes in critical random graphs

Umberto De Ambroggio

In this article we introduce a simple tool to derive polynomial upper bounds for the probability of observing unusually large maximal components in some models of random graphs whe…

The probability of unusually large components for critical percolation on random d-regular graphs

An elementary approach to component sizes in critical random graphs

The probability of unusually large components for critical percolation on random $d$ -regular graphs