Lorenzo Cirigliano
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Lorenzo Cirigliano has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Claudio Castellano
Istituto dei Sistemi Complessi (ISC-CNR)
8 shared publications - Gabor Timar
School of Mathematics, University of Leeds, Leeds LS2 9JT, UK
4 shared publications Claudio Castellano
Istituto dei Sistemi Complessi (ISC-CNR) Via dei Taurini 19 I-00185 Rome Italy
2 shared publicationsLaura Pilozzi
Istituto dei Sistemi Complessi (ISC-CNR) Via dei Taurini 19 I-00185 Rome Italy
2 shared publications- Anna Poggialini
Dipartimento di Fisica Università “Sapienza,
1 shared publication Bernard van Heck
Dipartimento di Fisica Università La Sapienza I-00185 Rome Italy
1 shared publication
Latest Publications
- Open Access
- 2 October 2026
- Published by American Physical Society (APS) in Physical Review E
- Vol. 114 (4) , 044305
Graphicality of power-law and double-power-law degree sequences
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 practical applications. In this work, we study the graphicality of degree sequences distributed as a power law with a size-dependent cutoff and as a double power law with a size-dependent crossover. We combine the application of exact sufficient conditions for graphicality with heuristic conditions for nongraphicality which allow us to elucidate the physical reasons why some sequences are not graphical. For single power laws we recover the known phase diagram, we highlight the subtle interplay of distinct mechanisms violating graphicality and we explain why the infinite-size limit behavior is in some cases very far from being observed for finite sequences. For double power laws we derive the graphicality of infinite sequences for all possible values of the degree exponents γ 1 and γ 2 , uncovering a rich phase diagram and pointing out the existence of six qualitatively distinct ways graphicality can be violated. The validity of theoretical arguments is supported by extensive numerical analysis.
- 2 October 2026
- Published by American Physical Society (APS) in Physical Review E
- Vol. 114 (4) , 044305
Open AccessGraphicality of power-law and double-power-law degree sequences
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 practical applications. In this work, we study the graphicality of degree sequences distributed as a power law with a size-dependent cutoff and as a double power law with a size-dependent crossover. We combine the application of exact sufficient conditions for graphicality with heuristic conditions for nongraphicality which allow us to elucidate the physical reasons why some sequences are not graphical. For single power laws we recover the known phase diagram, we highlight the subtle interplay of distinct mechanisms violating graphicality and we explain why the infinite-size limit behavior is in some cases very far from being observed for finite sequences. For double power laws we derive the graphicality of infinite sequences for all possible values of the degree exponents γ 1 and γ 2 , uncovering a rich phase diagram and pointing out the existence of six qualitatively distinct ways graphicality can be violated. The validity of theoretical arguments is supported by extensive numerical analysis.
- Open Access
- 22 May 2026
- Published by MDPI AG in Complexities
- Vol. 2 (2) , 13
Strongly Clustered Random Graphs via Triadic Closure: Degree Correlations and Clustering Spectrum
Real-world networks often exhibit strong transitivity with nontrivial local clustering spectra and degree correlations. Such features are not easily modeled in tractable network models, creating an obstacle to the theoretical understanding of such complex network structures. Here, we address this problem using a model for strongly clustered random graphs in which each triad of a random network backbone is closed with a certain probability. Despite the intricate loopy local structure of the graphs obtained, we provide exact expressions for the local clustering spectrum and the degree correlations, filling the gap in the theoretical description of this model for random graphs. In particular, we find positive degree assortativity accompanying high transitivity, and nontrivial structure in the clustering spectrum. Exact asymptotic analytical results, obtained for uncorrelated locally tree-like backbones, are complemented with extensive numerical characterization of finite-size effects.
- 22 May 2026
- Published by MDPI AG in Complexities
- Vol. 2 (2) , 13
Open AccessStrongly Clustered Random Graphs via Triadic Closure: Degree Correlations and Clustering Spectrum
Real-world networks often exhibit strong transitivity with nontrivial local clustering spectra and degree correlations. Such features are not easily modeled in tractable network models, creating an obstacle to the theoretical understanding of such complex network structures. Here, we address this problem using a model for strongly clustered random graphs in which each triad of a random network backbone is closed with a certain probability. Despite the intricate loopy local structure of the graphs obtained, we provide exact expressions for the local clustering spectrum and the degree correlations, filling the gap in the theoretical description of this model for random graphs. In particular, we find positive degree assortativity accompanying high transitivity, and nontrivial structure in the clustering spectrum. Exact asymptotic analytical results, obtained for uncorrelated locally tree-like backbones, are complemented with extensive numerical characterization of finite-size effects.
- 21 January 2026
- Published by American Physical Society (APS) in Physical Review E
- Vol. 113 (1) , 014314
Shortest-path percolation on scale-free networks
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 connected component, random pairs of nodes are sequentially selected, and if the length of the shortest path connecting the node pairs is smaller than a tunable budget parameter, then all edges along such a path are removed from the network. As edges are progressively removed, the network eventually breaks into multiple microscopic components, undergoing a percolation-like transition. It is known that the SPP transition on Erdős-Rényi networks (ERNs) belongs to the same universality class as the ordinary bond percolation if the budget parameter is finite; for an unbounded budget, instead, the SPP transition becomes more abrupt than the ordinary percolation transition. By means of large-scale numerical simulations and finite-size scaling analysis, here we study the SPP transition on random scale-free networks (SFNs) characterized by power-law degree distributions. We find, in contrast with ordinary percolation, that the transition is identical to the one observed on ERNs, denoting independence from the degree exponent. Still, we distinguish finite- and infinite-budget SPP universality classes. Our findings follow from the fact that the SPP process drastically homogenizes the heterogeneous structure of SFNs before the SPP transition takes place.
- 21 January 2026
- Published by American Physical Society (APS) in Physical Review E
- Vol. 113 (1) , 014314
Shortest-path percolation on scale-free networks
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 connected component, random pairs of nodes are sequentially selected, and if the length of the shortest path connecting the node pairs is smaller than a tunable budget parameter, then all edges along such a path are removed from the network. As edges are progressively removed, the network eventually breaks into multiple microscopic components, undergoing a percolation-like transition. It is known that the SPP transition on Erdős-Rényi networks (ERNs) belongs to the same universality class as the ordinary bond percolation if the budget parameter is finite; for an unbounded budget, instead, the SPP transition becomes more abrupt than the ordinary percolation transition. By means of large-scale numerical simulations and finite-size scaling analysis, here we study the SPP transition on random scale-free networks (SFNs) characterized by power-law degree distributions. We find, in contrast with ordinary percolation, that the transition is identical to the one observed on ERNs, denoting independence from the degree exponent. Still, we distinguish finite- and infinite-budget SPP universality classes. Our findings follow from the fact that the SPP process drastically homogenizes the heterogeneous structure of SFNs before the SPP transition takes place.
- Open Access
Dynamical entanglement percolation with spatially correlated disorder
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 network of qubits where each edge corresponds to an independent two-qubit interaction. By applying tools from percolation theory, we study how entanglement dynamically spreads across the network. We show that the interplay between unitary evolution and spatially correlated disorder leads to a non-standard percolation phenomenology, significantly richer than uniform bond percolation and featuring hysteresis. A two-colour correlated bond percolation model, whose phase diagram is determined via numerical simulations and a mean-field theory, fully elucidates the physics behind this phenomenon.
Open AccessDynamical entanglement percolation with spatially correlated disorder
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 network of qubits where each edge corresponds to an independent two-qubit interaction. By applying tools from percolation theory, we study how entanglement dynamically spreads across the network. We show that the interplay between unitary evolution and spatially correlated disorder leads to a non-standard percolation phenomenology, significantly richer than uniform bond percolation and featuring hysteresis. A two-colour correlated bond percolation model, whose phase diagram is determined via numerical simulations and a mean-field theory, fully elucidates the physics behind this phenomenon.
- Open Access
- 1 November 2025
- Published by IOP Publishing in Europhysics Letters
- Vol. 152 (3) , 31002
How universal is the mean-field universality class for percolation in complex networks?
Clustering and degree correlations are ubiquitous in real-world complex networks. Yet, understanding their role in critical phenomena remains a challenge for theoretical studies. Here, we provide the exact solution of site percolation in a model for strongly clustered random graphs, with many overlapping loops and heterogeneous degree distribution. We systematically compare the exact solution with heterogeneous mean-field predictions obtained from a treelike random rewiring of the network, which preserves only the degree sequence. Our results demonstrate a non-trivial interplay between degree heterogeneity, correlations and network topology, which can significantly alter both the percolation threshold and the critical exponents predicted by the heterogeneous mean field. These findings reveal limitations of heterogeneous mean-field theory, demonstrating that the degree distribution alone is insufficient to determine universality classes in complex networks with realistic structural features.
- 1 November 2025
- Published by IOP Publishing in Europhysics Letters
- Vol. 152 (3) , 31002
Open AccessHow universal is the mean-field universality class for percolation in complex networks?
Clustering and degree correlations are ubiquitous in real-world complex networks. Yet, understanding their role in critical phenomena remains a challenge for theoretical studies. Here, we provide the exact solution of site percolation in a model for strongly clustered random graphs, with many overlapping loops and heterogeneous degree distribution. We systematically compare the exact solution with heterogeneous mean-field predictions obtained from a treelike random rewiring of the network, which preserves only the degree sequence. Our results demonstrate a non-trivial interplay between degree heterogeneity, correlations and network topology, which can significantly alter both the percolation threshold and the critical exponents predicted by the heterogeneous mean field. These findings reveal limitations of heterogeneous mean-field theory, demonstrating that the degree distribution alone is insufficient to determine universality classes in complex networks with realistic structural features.
- 19 May 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 111 (5) , 054312
Neighbor-induced damage percolation
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. We present an exact solution for the size of the giant usable component (GUC) and the giant damaged component (GDC) in uncorrelated random graphs. We show that even for strongly heterogeneous distributions, the GUC always appears at a finite threshold and its formation is characterized by homogeneous mean-field percolation critical exponents. The threshold is a nonmonotonic function of connectivity: robustness is maximized by networks with finite optimal average degree. We also show that if the average degree is large enough, a damaged phase appears, characterized by the existence of a GDC, bounded by two distinct percolation transitions. The birth and the dismantling of the GDC are characterized by standard percolation critical exponents in networks, except for the dismantling in scale-free networks where new critical exponents are found. Numerical simulations on regular lattices in D=2 show that the existence of a GDC depends not only on the spatial dimension but also on the lattice coordination number.
- 19 May 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 111 (5) , 054312
Neighbor-induced damage percolation
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. We present an exact solution for the size of the giant usable component (GUC) and the giant damaged component (GDC) in uncorrelated random graphs. We show that even for strongly heterogeneous distributions, the GUC always appears at a finite threshold and its formation is characterized by homogeneous mean-field percolation critical exponents. The threshold is a nonmonotonic function of connectivity: robustness is maximized by networks with finite optimal average degree. We also show that if the average degree is large enough, a damaged phase appears, characterized by the existence of a GDC, bounded by two distinct percolation transitions. The birth and the dismantling of the GDC are characterized by standard percolation critical exponents in networks, except for the dismantling in scale-free networks where new critical exponents are found. Numerical simulations on regular lattices in D=2 show that the existence of a GDC depends not only on the spatial dimension but also on the lattice coordination number.
- 3 December 2024
- Published by American Physical Society (APS) in Physical Review E
- Vol. 110 (6) , 064303
Scaling and universality for percolation in random networks: A unified view
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 and unclustered topologies is well known. Still some critical properties of the transition, in particular for heterogeneous substrates, have not been fully elucidated and contradictory results appear in the literature. In this paper we present, by means of a generating functions approach, a thorough and complete investigation of percolation critical properties in uncorrelated locally treelike random networks. We determine all critical exponents, the associated critical amplitude ratios, and the form of the cluster size distribution for networks of any level of heterogeneity. We uncover, in particular for highly heterogeneous networks, subtle crossover phenomena, nontrivial scaling forms, and violations of hyperscaling. In this way we clarify the origin of inconsistencies in the previous literature.
- 3 December 2024
- Published by American Physical Society (APS) in Physical Review E
- Vol. 110 (6) , 064303
Scaling and universality for percolation in random networks: A unified view
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 and unclustered topologies is well known. Still some critical properties of the transition, in particular for heterogeneous substrates, have not been fully elucidated and contradictory results appear in the literature. In this paper we present, by means of a generating functions approach, a thorough and complete investigation of percolation critical properties in uncorrelated locally treelike random networks. We determine all critical exponents, the associated critical amplitude ratios, and the form of the cluster size distribution for networks of any level of heterogeneity. We uncover, in particular for highly heterogeneous networks, subtle crossover phenomena, nontrivial scaling forms, and violations of hyperscaling. In this way we clarify the origin of inconsistencies in the previous literature.
- Open Access
- 3 September 2024
- Published by American Physical Society (APS) in Physical Review E
- Vol. 110 (3) , 034302
General theory for extended-range percolation on simple and multiplex networks
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. Untrusted facilitator nodes are untrusted nodes that can still allow communication between trusted nodes if they lie on a path of distance at most between two trusted nodes. In extended-range percolation the extended-range giant component (ERGC) includes trusted nodes connected by paths of trusted and untrusted facilitator nodes. Here, based on a message-passing algorithm, we develop a general theory of extended-range percolation, valid for arbitrary values of as long as the networks are locally treelike. This general framework allows us to investigate the properties of extended-range percolation on interdependent multiplex networks. While the extended-range nature makes multiplex networks more robust, interdependency makes them more fragile. From the interplay between these two effects a rich phase diagram emerges including discontinuous phase transitions and reentrant phases. The theoretical predictions are in excellent agreement with extensive Monte Carlo simulations. The proposed exactly solvable model constitutes a fundamental reference for the study of models defined through properties of extended-range paths.- 3 September 2024
- Published by American Physical Society (APS) in Physical Review E
- Vol. 110 (3) , 034302
Open AccessGeneral theory for extended-range percolation on simple and multiplex networks
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. Untrusted facilitator nodes are untrusted nodes that can still allow communication between trusted nodes if they lie on a path of distance at most between two trusted nodes. In extended-range percolation the extended-range giant component (ERGC) includes trusted nodes connected by paths of trusted and untrusted facilitator nodes. Here, based on a message-passing algorithm, we develop a general theory of extended-range percolation, valid for arbitrary values of as long as the networks are locally treelike. This general framework allows us to investigate the properties of extended-range percolation on interdependent multiplex networks. While the extended-range nature makes multiplex networks more robust, interdependency makes them more fragile. From the interplay between these two effects a rich phase diagram emerges including discontinuous phase transitions and reentrant phases. The theoretical predictions are in excellent agreement with extensive Monte Carlo simulations. The proposed exactly solvable model constitutes a fundamental reference for the study of models defined through properties of extended-range paths. - Open Access
- 29 April 2024
- Published by Springer Nature in npj Quantum Information
- Vol. 10 (1) , 1-9
Optimal quantum key distribution networks: capacitance versus security
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 and on the nature of the communication channels. In this work we propose a strategy for the optimization of trusted-relays based networks that intertwines classical network approaches and quantum information theory. Specifically, by suitably defining a quantum communication efficiency functional, we identify the optimal quantum communication connections through the network by balancing security and the quantum communication rate. The optimized network is then constructed as the network of the maximal quantum communication efficiency connections and its performance is evaluated by studying the scaling of average properties as functions of the number of nodes and of the network spatial extension.
- 29 April 2024
- Published by Springer Nature in npj Quantum Information
- Vol. 10 (1) , 1-9
Open AccessOptimal quantum key distribution networks: capacitance versus security
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 and on the nature of the communication channels. In this work we propose a strategy for the optimization of trusted-relays based networks that intertwines classical network approaches and quantum information theory. Specifically, by suitably defining a quantum communication efficiency functional, we identify the optimal quantum communication connections through the network by balancing security and the quantum communication rate. The optimized network is then constructed as the network of the maximal quantum communication efficiency connections and its performance is evaluated by studying the scaling of average properties as functions of the number of nodes and of the network spatial extension.
- 13 February 2024
- Published by American Physical Society (APS) in Physical Review E
- Vol. 109 (2) , 024306
Strongly clustered random graphs via triadic closure: An exactly solvable model
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 many real-world topologies. In this work we define a static triadic closure (STC) model for clustered networks, whereby starting from an arbitrary fixed backbone network, each triad is closed independently with a given probability. Assuming a locally treelike backbone we derive exact expressions for the expected number of various small, loopy motifs (triangles, 4-loops, diamonds, and 4-cliques) as a function of moments of the backbone degree distribution. In this way we determine how transitivity and its suitably defined generalizations for higher-order motifs depend on the heterogeneity of the original network, revealing the existence of transitions due to the interplay between topologically inequivalent triads in the network. Furthermore, under reasonable assumptions for the moments of the backbone network, we establish approximate relationships between motif densities, which we test in a large dataset of real-world networks. We find a good agreement, indicating that STC is a realistic mechanism for the generation of clustered networks, while remaining simple enough to be amenable to analytical treatment.
- 13 February 2024
- Published by American Physical Society (APS) in Physical Review E
- Vol. 109 (2) , 024306
Strongly clustered random graphs via triadic closure: An exactly solvable model
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 many real-world topologies. In this work we define a static triadic closure (STC) model for clustered networks, whereby starting from an arbitrary fixed backbone network, each triad is closed independently with a given probability. Assuming a locally treelike backbone we derive exact expressions for the expected number of various small, loopy motifs (triangles, 4-loops, diamonds, and 4-cliques) as a function of moments of the backbone degree distribution. In this way we determine how transitivity and its suitably defined generalizations for higher-order motifs depend on the heterogeneity of the original network, revealing the existence of transitions due to the interplay between topologically inequivalent triads in the network. Furthermore, under reasonable assumptions for the moments of the backbone network, we establish approximate relationships between motif densities, which we test in a large dataset of real-world networks. We find a good agreement, indicating that STC is a realistic mechanism for the generation of clustered networks, while remaining simple enough to be amenable to analytical treatment.