10 papers
Strongly clustered random graphs via triadic closure: Degree correlations and clustering spectrum
Lorenzo Cirigliano, Gareth J. Baxter, Gábor Timár
Real-world networks often exhibit strong transitivity with nontrivial local clustering spectra and degree correlations. Such features are not easily modeled in tractable network mo…
Shortest-path percolation on scale-free networks
Minsuk Kim, Lorenzo Cirigliano, Claudio Castellano +4
The shortest-path percolation (SPP) model aims at describing the consumption and eventual exhaustion of a network's resources. Starting from a network containing a macroscopic conn…
Dynamical entanglement percolation with spatially correlated disorder
Lorenzo Cirigliano, Valentina Brosco, Claudio Castellano +3
The distribution of entanglement between the nodes of a quantum network plays a fundamental role in quantum information applications. In this work, we investigate the dynamics of a…
Graphicality of power-law and double power-law degree sequences
Pietro Valigi, M. Ãngeles Serrano, Claudio Castellano +1
The graphicality problem -- whether or not a sequence of integers can be used to create a simple graph -- is a key question in network theory and combinatorics, with many important…
How universal is the mean-field universality class for percolation in complex networks?
Lorenzo Cirigliano
Clustering and degree correlations are ubiquitous in real-world complex networks. Yet, understanding their role in critical phenomena remains a challenge for theoretical studies. H…
Neighbor-induced damage percolation
Lorenzo Cirigliano, Claudio Castellano
We consider neighbor-induced damage percolation, a model describing systems where the inactivation of some elements may damage their neighboring active ones, making them unusable.…