Strongly clustered random graphs via triadic closure: Degree correlations and clustering spectrum

Documenti analoghi

• Strongly clustered random graphs via triadic closure: An exactly solvable model
  di: Cirigliano, Lorenzo, et al.
  Pubblicazione: (2023)
• Effects of clustering heterogeneity on the spectral density of sparse networks
  di: Pham, Tuan Minh, et al.
  Pubblicazione: (2024)
• How universal is the mean-field universality class for percolation in complex networks?
  di: Cirigliano, Lorenzo
  Pubblicazione: (2025)
• Higher-order triadic percolation on random hypergraphs
  di: Sun, Hanlin, et al.
  Pubblicazione: (2024)
• Dynamical entanglement percolation with spatially correlated disorder
  di: Cirigliano, Lorenzo, et al.
  Pubblicazione: (2026)