5 citations · 6 across the 5 of their papers we have counts for
5 papers
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 vertices, where each edge is assigned a weight of with probability and …
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 , with directional bias. When the conductances have a stable distribution with parameter $γ…
Balanced Bidirectional Breadth-First Search on Scale-Free Networks
Sacha Cerf, Benjamin Dayan, Umberto De Ambroggio +3
To find a shortest path between two nodes and in a given graph, a classical approach is to start a Breadth-First Search (BFS) from and run it until the search dis…
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 and provide a new probabilistic proof of the fact that, when is of the form and is la…
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 , an anti-preferent…