Umberto De Ambroggio

activity

20192025

most citedOn dynamic random graphs with degree homogenization via anti-preferential attachment probabilities

5 citations · 6 across the 5 of their papers we have counts for

collaborators

Showing math.PRShow all

4 papers · 1 filter

math.PR2025

Repeat times and a two-weight UST model

Umberto De Ambroggio, Luca Makowiec

We study a model of random weighted uniform spanning trees on the complete graph with $n$ vertices, where each edge is assigned a weight of $n^{1 + γ}$ with probability $1/ n$ and $1$ …

math.PR2025

Quenched scaling limit for biased random walks on random, heavy tailed conductances: low dimensions

Umberto De Ambroggio, Carlo Scali

We consider a random walk amongst positive random conductances on $Z^{d}, d \geq 2$ , with directional bias. When the conductances have a stable distribution with parameter $γ…

math.PR2021

Unusually large components in near-critical Erdős-Rényi graphs via ballot theorems

Umberto De Ambroggio, Matthew I. Roberts

We consider the near-critical Erdős-Rényi random graph $G (n, p)$ and provide a new probabilistic proof of the fact that, when $p$ is of the form $p = p (n) = 1/ n + λ / n^{4/3}$ and $A$ is la…

math.PR2019★ 5 cited

On dynamic random graphs with degree homogenization via anti-preferential attachment probabilities

Umberto De Ambroggio, Federico Polito, Laura Sacerdote

We analyze a dynamic random undirected graph in which newly added vertices are connected to those already present in the graph either using, with probability $p$ , an anti-preferent…