activity
20142026
most citedA large-deviations principle for all the cluster sizes of a sparse Erdős-Rényi graph

15 citations · 32 across the 11 of their papers we have counts for

collaborators

17 papers

math.CO2026

A note on generating polyhedra and quadrangulations

Luisa Andreis, Riccardo W. Maffucci, Federico Polito

A polyhedron is a planar, -connected graph. We iteratively construct all polyhedra (save for pyramids) from a unique starting graph, namely the square pyramid, via two graph tra…

math.CO2026

Asymptotics of the number of labelled connected sparse multitype graphs

Luisa Andreis, Mario Veshaj

We study the asymptotic enumeration of labelled connected multitype graphs in the sparse regime, where both the number of vertices and edges grow linearly and the excess is proport…

math.PR2025

LDP for the covariance process in fully connected neural networks

Luisa Andreis, Federico Bassetti, Christian Hirsch

In this work, we study large deviation properties of the covariance process in fully connected Gaussian deep neural networks. More precisely, we establish a large deviation princip…

math.PR2024

Convergence of cluster coagulation dynamics

Luisa Andreis, Tejas Iyer, Elena Magnanini

We study hydrodynamic limits of the cluster coagulation model; a coagulation model introduced by Norris [, 209(2):407-435 (2000)]. In this process, pair…

math.PR2024

Spatial particle processes with coagulation: Gibbs-measure approach, gelation and Smoluchowski equation

Luisa Andreis, Wolfgang König, Heide Langhammer +1

We study a spatial Markovian particle system with pairwise coagulation, a spatial version of the Marcus--Lushnikov process: according to a coagulation kernel , particle pairs me…

math.PR2023

An alternative approach to large deviations for the almost-critical Erdős-Rényi random graph

Luisa Andreis, Gianmarco Bet, Maxence Phalempin

We study the near-critical behavior of the sparse Erdős-Rényi random graph on vertices, where the connection probability satisfies $np = 1+θ(b_n^2/n)…