12 citations · 39 across the 13 of their papers we have counts for
4 papers · 1 filter
Criticality and universality in network dismantling
Lorenzo Cirigliano, Claudio Castellano, Minsuk Kim +2
Identifying the smallest set of elements whose removal dismantle a complex network, known as the network dismantling problem, is a fundamental task with many practical applications…
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…
Strongly clustered random graphs via triadic closure: An exactly solvable model
Lorenzo Cirigliano, Claudio Castellano, Gareth Baxter +1
Triadic closure, the formation of a connection between two nodes in a network sharing a common neighbor, is considered a fundamental mechanism determining the clustered nature of m…