Umberto De Ambroggio

From MaRDI portal
(Redirected from Umberto De Ambroggio)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Limit Laws for Critical Dispersion on Complete Graphs
(available as arXiv preprint)
N/APaper
Limit laws for critical dispersion on complete graphs2026-01-30Paper
On the phase transition for the number of collisions on comb graphs
(available as arXiv preprint)
2026-01-01Paper
Limit laws for critical dispersion on complete graphs
The Annals of Applied Probability
2026-01-01Paper
Triple collisions on a comb graph
Electronic Journal of Probability
2025-10-07Paper
Dispersion on the complete graph (extended abstract)2025-04-08Paper
Dispersion on the complete graph
Random Structures & Algorithms
2025-02-14Paper
Quenched scaling limit for biased random walks on random, heavy tailed conductances: low dimensions
(available as arXiv preprint)
2025-01-01Paper
Collisions of random walks on comb graphs with a planar base
(available as arXiv preprint)
2025-01-01Paper
Repeat times and a two-weight UST model
(available as arXiv preprint)
2025-01-01Paper
Degree evolution in a general growing network
Statistics & Probability Letters
2024-07-29Paper
Upper bounds for the largest component in critical inhomogeneous random graphs
(available as arXiv preprint)
2024-02-05Paper
Upper bounds for the largest component in critical inhomogeneous random graphs2024-02-05Paper
Small maximal clusters are very unlikely in critical random graphs
(available as arXiv preprint)
2024-01-01Paper
Triple collisions on a comb graph
(available as arXiv preprint)
2024-01-01Paper
Balanced Bidirectional Breadth-First Search on Scale-Free Networks
(available as arXiv preprint)
2024-01-01Paper
The probability of unusually large components for critical percolation on random d-regular graphs
Electronic Journal of Probability
2023-08-02Paper
Dispersion on the Complete Graph2023-06-04Paper
Unusually large components in near-critical Erdős–Rényi graphs via ballot theorems
Combinatorics, Probability and Computing
2023-03-31Paper
An elementary approach to component sizes in critical random graphs
Journal of Applied Probability
2022-11-14Paper
On dynamic random graphs with degree homogenization via anti-preferential attachment probabilities
Physica D
2022-03-16Paper
A simple path to component sizes in critical random graphs2022-01-04Paper
Unusually large components in near-critical Erd\H{o}s-R\'{e}nyi graphs via ballot theorems
(available as arXiv preprint)
2021-01-13Paper
On dynamic random graphs with degree homogenization via anti-preferential attachment probabilities
(available as arXiv preprint)
2019-09-09Paper


Research outcomes over time


This page was built for person: Umberto De Ambroggio