Lorenzo Federico

activity

20152023

most citedExpansion of percolation critical points for Hamming graphs

7 citations · 9 across the 7 of their papers we have counts for

collaborators

8 papers

math.PR2023

Failure behavior in a connected configuration model under a critical loading mechanism

Fiona Sloothaak, Lorenzo Federico

We study a cascading edge failure mechanism on a connected random graph with a prescribed degree sequence, sampled using the configuration model. This mechanism prescribes that eve…

math.CO2023

Minimal H-factors and covers

Lorenzo Federico, Joel Larsson Danielsson

Given a fixed small graph H and a larger graph G, an H-factor is a collection of vertex-disjoint subgraphs $H^{'} \subset G$ , each isomorphic to H, that cover the vertices of G. If G i…

math.PR2020

Connectivity of Poissonian Inhomogeneous random Multigraphs

Lorenzo Federico

We introduce a new way to sample inhomogeneous random graphs designed to have a lot of flexibility in the assignment of the degree sequence and the individual edge probabilities wh…

math.PR2020

Almost-2-regular random graphs

Lorenzo Federico

We study a special case of the configuration model, in which almost all the vertices of the graph have degree $2$ . We show that the graph has a very peculiar and interesting behavi…

math.PR2019★ 2 cited

Critical scaling limits of the random intersection graph

Lorenzo Federico

We analyse the scaling limit of the sizes of the largest components of the Random Intersection Graph $G (n, m, p)$ close to the critical point $p = \frac{1}{nm}$ , when the number…

math.PR2017★ 7 cited

Expansion of percolation critical points for Hamming graphs

Lorenzo Federico, Remco van der Hofstad, Frank den Hollander +1

The Hamming graph $H (d, n)$ is the Cartesian product of $d$ complete graphs on $n$ vertices. Let $m = d (n - 1)$ be the degree and $V = n^{d}$ be the number of vertices of $H (d, n)$ . Let $p…

math.PR2016

Critical window for connectivity in the Configuration Model

Lorenzo Federico, Remco van der Hofstad

We identify the asymptotic probability of a configuration model $CM_{n} (d)$ to produce a connected graph within its critical window for connectivity that is ide…

math.PR2015

Connectivity Threshold for random subgraphs of the Hamming graph

Lorenzo Federico, Remco van der Hofstad, Tim Hulshof

We study the connectivity of random subgraphs of the $d$ -dimensional Hamming graph $H (d, n)$ , which is the Cartesian product of $d$ complete graphs on $n$ vertices. We sample the r…