activity
20072026
most citedOn combinatorial testing problems

106 citations · 431 across the 57 of their papers we have counts for

collaborators

70 papers

math.PR2026

Symmetric Cooperative Motion in Higher Dimensions

Louigi Addario-Berry, Gavin Barill, Hannah Cairns +1

We prove a distributional convergence result for a multidimensional version of symmetric cooperative motion which was introduced and studied in one dimension in \cite{HRW, SCM1}. O…

math.CO2026

Diameters and mixing times for giant components of random graphs with given degrees

Louigi Addario-Berry, Bruce Reed, Corrine Yap

A sequence is a feasible degree sequence if there is a graph on such that has degree . For such a sequence, is a graph chosen uni…

math.PR2026

What is The Probability That A Random Graph With A Given Degree Sequence is Connected?

Louigi Addario-Berry, Bruce Reed, Dao Chen Yuan

An -tuple is a \emph{feasible degree sequence} if there is a graph on such that has degree . Any such graph will have $m=\sum_{i=…

math.ST2026

The statistical threshold for planted matchings and spanning trees

Louigi Addario-Berry, Omer Angel, Gábor Lugosi +2

In this paper, we study the problem of detecting the presence of a planted perfect matching or spanning tree in an Erdős--Rényi random graph. More precisely, we study the hypothesi…

math.PR2025

On exponentially height-penalized random trees

Louigi Addario-Berry, Benoît Corsini, Neeladri Maitra +1

Given and , a $\textit{$μn$}$ is a random plane tree with vertices with law given by $…

math.CO2025

Infinite Schnyder Woods

Louigi Addario-Berry, Emma Hogan, Lukas Michel +1

It is well-known that any finite triangulation possesses a unique maximal Schnyder wood. We introduce Schnyder woods of infinite triangulations, and prove there exists a unique max…