12 citations · 39 across the 13 of their papers we have counts for
13 papers
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…
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…
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…
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.…
General theory for extended-range percolation on simple and multiplex networks
Lorenzo Cirigliano, Claudio Castellano, Ginestra Bianconi
Extended-range percolation is a robust percolation process that has relevance for quantum communication problems. In extended-range percolation nodes can be trusted or untrusted. U…
Scaling and universality for percolation in random networks: A unified view
Lorenzo Cirigliano, Gábor Timár, Claudio Castellano
Percolation processes on random networks have been the subject of intense research activity over the last decades: the overall phenomenology of standard percolation on uncorrelated…
Optimal quantum key distribution networks: capacitance versus security
Lorenzo Cirigliano, Valentina Brosco, Claudio Castellano +2
The rate and security of quantum communications between users placed at arbitrary points of a quantum communication network depend on the structure of the network, on its extension…
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…
Extended-range percolation in complex networks
Lorenzo Cirigliano, Claudio Castellano, Gábor Timár
Classical percolation theory underlies many processes of information transfer along the links of a network. In these standard situations, the requirement for two nodes to be able t…
Cumulative Merging Percolation: A long-range percolation process in networks
Lorenzo Cirigliano, Giulio Cimini, Romualdo Pastor-Satorras +1
Percolation on networks is a common framework to model a wide range of processes, from cascading failures to epidemic spreading. Standard percolation assumes short-range interactio…