collaborators

2 papers

math.PR2025

The Erdős-Rényi Random Graph Conditioned on Every Component Being a Clique

Martijn Gösgens, Lukas Lüchtrath, Elena Magnanini +2

Motivated by an application in community detection, we consider an \ER random graph conditioned on the rare event that all connected components are fully connected. Such graphs can…

math.CO2024

Asymptotic expansion of regular and connected regular graphs

Élie de Panafieu

We derive the asymptotic expansion (asymptotics with an arbitrary number of error terms) of k-regular graphs by applying the Laplace method on a recent exact formula from Caizergue…