pith. sign in

arxiv: 2412.12988 · v1 · submitted 2024-12-17 · ❄️ cond-mat.stat-mech · cond-mat.dis-nn· math-ph· math.MP· math.PR· physics.data-an

Network Renormalization

Pith reviewed 2026-05-23 06:54 UTC · model grok-4.3

classification ❄️ cond-mat.stat-mech cond-mat.dis-nnmath-phmath.MPmath.PRphysics.data-an
keywords network renormalizationrenormalization groupcomplex networksheterogeneitycoarse grainingscale invariancecritical phenomenaphase transitions
0
0 comments X

The pith

Strong heterogeneity in real-world networks complicates consistent renormalization procedures.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The renormalization group is a framework for transforming descriptions of many-degree-of-freedom systems across scales and identifying critical points of phase transitions. Traditional uses depend on homogeneity, symmetry, geometry, and locality. This paper reviews efforts to extend these ideas to complex networks that lack such features. It covers the main attempts, important advances, and remaining open challenges caused by network heterogeneity.

Core claim

The authors argue that the strong heterogeneity of real-world networks significantly complicates the definition of consistent renormalization procedures, as these networks do not have explicit geometric coordinates or lattice-like symmetries, and they survey the approaches developed to address this.

What carries the argument

The renormalization group framework for scale transformations and coarse-graining, when applied to heterogeneous networks without geometric embedding.

If this is right

  • Approaches to network renormalization must address the absence of explicit geometric coordinates.
  • Procedures need to handle very different properties of nodes and subgraphs.
  • Open challenges persist despite various attempts to define consistent schemes.
  • Traditional reliance on homogeneity and symmetry does not hold for complex networks.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Successful network renormalization might reveal universal scaling behaviors in empirical data from social or biological systems.
  • Connections could be drawn to other scaling concepts like fractals in networks.
  • New parameter-free methods might emerge from addressing these challenges.

Load-bearing premise

That renormalization group concepts based on homogeneity and geometry can be extended to networks that lack these properties.

What would settle it

A general renormalization scheme that produces consistent scale transformations for highly heterogeneous networks without additional structure assumptions would falsify the claim of significant complication.

Figures

Figures reproduced from arXiv: 2412.12988 by Andrea Gabrielli, Diego Garlaschelli, M. \'Angeles Serrano, Subodh P. Patil.

Figure 1
Figure 1. Figure 1: Geometric network renormalization: direct and inverse meth￾ods and results in real networks. a) Sketch of the GR transformation. In layer ℓ = 0, non-overlapping blocks of r = 2 consecutive nodes shaded in gray are defined along the similarity circle. This induces a partition Ω0 of the original N0 nodes into N1 = N0/r blocks. The blocks are coarse-grained and represented as supernodes in layer ℓ = 1. Each s… view at source ↗
Figure 2
Figure 2. Figure 2: Real-space construction in the Laplacian network renor￾malization approach. a) The lower layer (ℓ = 0) represents the original network A(0), here a Barab´asi-Albert network (N0 = 24, m = 1), and the upper layer illustrates the partition Ω0 obtained for τ ∗ = 1.96: different colors identify the N1 Kadanoff supernodes. b) Following Ω0, each block is lumped into a single supernode i1 (with i1 = 1, . . . , N1)… view at source ↗
Figure 1
Figure 1. Figure 1: Therefore the coarse-grained graph is described by the N1 ⇥ N1 adjacency matrix A(1) with entries a(1) i1,j1 = 1 ￾ Q i02i1 Q j02j1 (1 ￾ a(0) i0,j0 ), where i0 2 i1 denotes that the chosen partition ⌦0 maps the original node i0 onto the block-node i1, i.e. i1 = ⌦0(i0). Note that we have not required i1 6= j1, as we keep allowing for self-loops. In general i0 is not the only node mapped to i1,i.e. ⌦0 is surj… view at source ↗
Figure 4
Figure 4. Figure 4: Information-theoretic parameter flow. Left: an instance of the handwritten numeral 7. Right: eigenvalues of the Fisher information matrix of 30 trained neural networks that succesfully classified the left figure from the MNIST data set. An exponential eigenvalue hierarchy is clearly evident, implying that only a handful of collective weights are relevant for the accuracy of the trained network. any collect… view at source ↗
read the original abstract

The renormalization group (RG) is a powerful theoretical framework developed to consistently transform the description of configurations of systems with many degrees of freedom, along with the associated model parameters and coupling constants, across different levels of resolution. It also provides a way to identify critical points of phase transitions and study the system's behaviour around them by distinguishing between relevant and irrelevant details, the latter being unnecessary to describe the emergent macroscopic properties. In traditional physical applications, the RG largely builds on the notions of homogeneity, symmetry, geometry and locality to define metric distances, scale transformations and self-similar coarse-graining schemes. More recently, various approaches have tried to extend RG concepts to the ubiquitous realm of complex networks where explicit geometric coordinates do not necessarily exist, nodes and subgraphs can have very different properties, and homogeneous lattice-like symmetries are absent. The strong heterogeneity of real-world networks significantly complicates the definition of consistent renormalization procedures. In this review, we discuss the main attempts, the most important advances, and the remaining open challenges on the road to network renormalization.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The manuscript is a review that surveys attempts to extend renormalization group (RG) concepts—originally developed for homogeneous, symmetric, and geometrically local systems—to complex networks. It identifies strong heterogeneity as the central obstacle to consistent definitions of scale transformations, coarse-graining, and relevant/irrelevant operators, discusses main advances in the literature, and outlines remaining open challenges without advancing new derivations or formal constructions.

Significance. If the coverage of existing attempts is accurate and reasonably complete, the review would provide a useful organizational synthesis for a growing subfield at the intersection of statistical mechanics and network science. Its value lies in clearly framing the extension problem as an open challenge rather than claiming resolution, thereby helping to structure future work on scale invariance in heterogeneous systems.

minor comments (3)
  1. [Abstract] Abstract, final sentence: the phrasing 'on the road to network renormalization' is slightly informal for a review; a more precise statement of the review's scope and organization would improve clarity.
  2. [Introduction] The manuscript would benefit from an explicit statement (perhaps in the introduction) of the criteria used to select which attempts are discussed, to allow readers to assess completeness of the survey.
  3. Ensure consistent use of terminology (e.g., 'coarse-graining' vs. 'renormalization procedure') across sections when contrasting traditional RG with network applications.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the careful reading and positive assessment of our review. The report correctly identifies the manuscript as a survey of existing attempts to extend renormalization-group ideas to heterogeneous networks, without new derivations, and for framing the open challenges. No specific major comments were raised in the report, so we have no point-by-point revisions to propose at this stage.

Circularity Check

0 steps flagged

No significant circularity; review paper with no derivations

full rationale

This is a review article whose abstract and structure explicitly frame it as a synthesis of prior work on extending RG concepts to networks, without new derivations, equations, predictions, or formal constructions. The central claim is descriptive (heterogeneity complicates consistent RG procedures) and surveys existing attempts plus open challenges. No load-bearing steps reduce by construction to inputs, self-citations, or fitted parameters; the paper treats the extension problem as unresolved rather than solved via any internal logic that could be circular.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

As a review paper the work does not introduce new free parameters, axioms, or invented entities; it discusses existing approaches from the cited literature.

pith-pipeline@v0.9.0 · 5730 in / 1008 out tokens · 27466 ms · 2026-05-23T06:54:28.588534+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

201 extracted references · 201 canonical work pages · 3 internal anchors

  1. [1]

    Kadanoff, L. P. Scaling laws for ising models near Tc. Physics Physique Fizika 2, 263–272 (1966)

  2. [2]

    Kadanoff, L. P. Notes on migdal’s recursion formulas. Annals of Physics 100, 359–394 (1976)

  3. [3]

    & van Leeuwen, J

    Niemeijer, T. & van Leeuwen, J. M. J. Wilson theory for spin systems on a triangular lattice. Phys. Rev. Lett. 31, 1411–1414 (1973). URL https://link.aps.org/doi/10.1103/PhysRevLett.31.1411

  4. [4]

    Kadanoff, L. P. Variational principles and approximate renormaliza- tion group calculations. Phys. Rev. Lett. 34, 1005–1008 (1975). URL https://link.aps.org/doi/10.1103/PhysRevLett.34.1005

  5. [5]

    Southern, B. W. Kadanoff’s variational renormalisation group method: the ising model on the square and triangular lattices. Jour- nal of Physics A: Mathematical and General 11, L1 (1978). URL https://dx.doi.org/10.1088/0305-4470/11/1/001

  6. [7]

    & Knops, H

    den Nijs, M. & Knops, H. Variational renormalization method and the potts model. Physica A: Statistical Mechanics and its Applications 93, 441–456 (1978). URL https://www.sciencedirect.com/science/ article/pii/0378437178901656

  7. [8]

    Wilson, K. G. & Kogut, J. The renormalization group and the ϵ expansion. Phys. Rep. 12, 75–199 (1974)

  8. [9]

    & Jona-Lasinio, G

    Di Castro, C. & Jona-Lasinio, G. On the microscopic foundation of scaling laws. Physics Letters A 29, 322–323 (1969)

  9. [10]

    & Low, F

    Gell-Mann, M. & Low, F. E. Quantum electrodynamics at small dis- tances. Physical Review 95, 1300 (1954). 40

  10. [11]

    Quantum field theory and critical phenomena , vol

    Zinn-Justin, J. Quantum field theory and critical phenomena , vol. 171 (Oxford university press, 2021)

  11. [12]

    T¨ auber, U. C. Renormalization group: applications in statistical physics. Nuclear Physics B-Proceedings Supplements228, 7–34 (2012)

  12. [13]

    & Vicari, E

    Pelissetto, A. & Vicari, E. Critical phenomena and renormalization- group theory. Physics Reports 368, 549–727 (2002). URL https://www.sciencedirect.com/science/article/pii/ S0370157302002193

  13. [14]

    & Kadanoff, L

    Efrati, E., Wang, Z., Kolan, A. & Kadanoff, L. P. Real-space renormal- ization in statistical mechanics. Rev. Mod. Phys. 86, 647–667 (2014). URL https://link.aps.org/doi/10.1103/RevModPhys.86.647

  14. [15]

    & Sannino, F

    Della Morte, M. & Sannino, F. Renormalization group approach to pandemics as a time-dependent sir model. Frontiers in Physics 8 (2021). URL https://www.frontiersin.org/journals/physics/ articles/10.3389/fphy.2020.591876

  15. [16]

    Cavagna, A. et al. Dynamic scaling in natural swarms. Nature Physics 13, 914–918 (2017). URL http://dx.doi.org/10.1038/nphys4153

  16. [17]

    Cavagna, A. et al. Dynamical renormalization group approach to the collective behavior of swarms. Physical Review Letters 123 (2019). URL http://dx.doi.org/10.1103/PhysRevLett.123.268001

  17. [18]

    Cavagna, A. et al. Natural swarms in 3.99 dimensions. Nature Physics 19, 1043–1049 (2023). URL http://dx.doi.org/10.1038/ s41567-023-02028-0

  18. [19]

    Mutual Information, Neural Networks and the Renormalization Group

    Koch-Janusz, M. & Ringel, Z. Mutual information, neural networks and the renormalization group. Nature Phys. 14, 578–582 (2018). 1704.06279

  19. [20]

    & Wang, L

    Li, S.-H. & Wang, L. Neural network renormalization group. Physi- cal Review Letters 121 (2018). URL http://dx.doi.org/10.1103/ PhysRevLett.121.260601

  20. [21]

    & You, Y.-Z

    Hu, H.-Y., Li, S.-H., Wang, L. & You, Y.-Z. Machine learning holo- graphic mapping by neural network renormalization group. Phys. Rev. Res. 2, 023369 (2020). URL https://link.aps.org/doi/10.1103/ PhysRevResearch.2.023369. 41

  21. [22]

    & Silvestri, F

    Caso, F., Trappolini, G., Bacciu, A., Li` o, P. & Silvestri, F. Renormal- ized graph neural networks (2023). URL https://arxiv.org/abs/ 2306.00707. 2306.00707

  22. [23]

    Young, A. P. & Stinchcombe, R. B. A renormalization group theory for percolation problems. Journal of Physics C: Solid State Physics 8, L535 (1975). URL https://dx.doi.org/10.1088/0022-3719/8/ 23/001

  23. [24]

    J., Stanley, H

    Reynolds, P. J., Stanley, H. E. & Klein, W. A real-space renormaliza- tion group for site and bond percolation. Journal of Physics C: Solid State Physics 10, L167 (1977). URL https://dx.doi.org/10.1088/ 0022-3719/10/8/002

  24. [25]

    Real space renormalization group and totalitarian para- dox of majority rule voting

    Galam, S. Real space renormalization group and totalitarian para- dox of majority rule voting. Physica A: Statistical Mechanics and its Applications 285, 66–76 (2000). URL https://www.sciencedirect. com/science/article/pii/S0378437100002727

  25. [26]

    Non-equilibrium critical phenomena and phase transi- tions into absorbing states

    Hinrichsen, H. Non-equilibrium critical phenomena and phase transi- tions into absorbing states. Advances in Physics 49, 815–958 (2000)

  26. [27]

    & Mu˜ noz, M

    Dornic, I., Chat´ e, H. & Mu˜ noz, M. A. Integration of Langevin equa- tions with multiplicative noise and the viability of field theories for absorbing phase transitions. Phys. Rev. Lett. 94, 100601 (2005)

  27. [28]

    L., Cross, M

    Kogan, O., Rogers, J. L., Cross, M. C. & Refael, G. Renormalization group approach to oscillator synchronization. Phys. Rev. E 80, 036206 (2009). URL https://link.aps.org/doi/10.1103/PhysRevE.80. 036206

  28. [29]

    Renormalization of oscillator lattices with disorder

    ¨Ostborn, P. Renormalization of oscillator lattices with disorder. Phys. Rev. E 79, 051114 (2009). URL https://link.aps.org/doi/10. 1103/PhysRevE.79.051114

  29. [30]

    & Zeegers, B

    Garlaschelli, D., den Hollander, F., Meylahn, J. & Zeegers, B. Syn- chronization of phase oscillators on the hierarchical lattice. Journal of Statistical Physics 174, 188–218 (2019)

  30. [32]

    & Vidal, G

    Evenbly, G. & Vidal, G. Tensor network renormalization. Physi- cal Review Letters 115 (2015). URL http://dx.doi.org/10.1103/ PhysRevLett.115.180405

  31. [33]

    & Verstraete, F

    Bal, M., Mari¨ en, M., Haegeman, J. & Verstraete, F. Renormal- ization group flows of hamiltonians using tensor networks. Physi- cal Review Letters 118 (2017). URL http://dx.doi.org/10.1103/ PhysRevLett.118.250602

  32. [34]

    M., G¨ okmen, D

    Lenggenhager, P. M., G¨ okmen, D. E., Ringel, Z., Huber, S. D. & Koch-Janusz, M. Optimal renormalization group transformation from information theory. Phys. Rev. X 10, 011037 (2020). URL https: //link.aps.org/doi/10.1103/PhysRevX.10.011037

  33. [35]

    E., Ringel, Z., Huber, S

    G¨ okmen, D. E., Ringel, Z., Huber, S. D. & Koch-Janusz, M. Statisti- cal physics through the lens of real-space mutual information. Phys. Rev. Lett. 127, 240603 (2021). URL https://link.aps.org/doi/ 10.1103/PhysRevLett.127.240603

  34. [36]

    & Ringel, Z

    Gordon, A., Banerjee, A., Koch-Janusz, M. & Ringel, Z. Relevance in the renormalization group and in information theory. Phys. Rev. Lett. 126, 240601 (2021). URL https://link.aps.org/doi/10.1103/ PhysRevLett.126.240601

  35. [38]

    E., Ringel, Z., Huber, S

    G¨ okmen, D. E., Ringel, Z., Huber, S. D. & Koch-Janusz, M. Sym- metries and phase diagrams with real-space mutual information neu- ral estimation. Phys. Rev. E 104, 064106 (2021). URL https: //link.aps.org/doi/10.1103/PhysRevE.104.064106

  36. [39]

    & Wschebor, N

    Canet, L., Delamotte, B., Deloubri` ere, O. & Wschebor, N. Nonper- turbative renormalization-group study of reaction-diffusion processes. Phys. Rev. Lett. 92, 195703 (2004). URL https://link.aps.org/ doi/10.1103/PhysRevLett.92.195703

  37. [40]

    Physical Review Letters 85(10), 2200–2203 (2000)

    Canet, L., Chat´ e, H. & Delamotte, B. Quantitative phase diagrams of branching and annihilating random walks. Phys. Rev. Lett. 92, 255703 (2004). URL https://link.aps.org/doi/10.1103/PhysRevLett. 92.255703. 43

  38. [41]

    & Mu˜ noz, M

    Canet, L., Chat´ e, H., Delamotte, B., Dornic, I. & Mu˜ noz, M. A. Non- perturbative fixed point in a nonequilibrium phase transition. Phys. Rev. Lett. 95, 100601 (2005). URL https://link.aps.org/doi/10. 1103/PhysRevLett.95.100601

  39. [42]

    & Delamotte, B

    Canet, L., Chat´ e, H. & Delamotte, B. General framework of the non-perturbative renormalization group for non-equilibrium steady states. Journal of Physics A: Mathematical and Theoretical 44, 495001 (2011). URL https://dx.doi.org/10.1088/1751-8113/44/ 49/495001

  40. [43]

    & Wschebor, N

    Tarpin, M., Benitez, F., Canet, L. & Wschebor, N. Nonperturbative renormalization group for the diffusive epidemic process. Phys. Rev. E 96, 022137 (2017). URL https://link.aps.org/doi/10.1103/ PhysRevE.96.022137

  41. [44]

    & Barab´ asi, A.-L.Network science (Cambridge University Press, 2016)

    P´ osfai, M. & Barab´ asi, A.-L.Network science (Cambridge University Press, 2016)

  42. [45]

    & Garlaschelli, D

    Squartini, T. & Garlaschelli, D. Maximum-entropy networks: Pattern detection, network reconstruction and graph combinatorics (Springer, 2017)

  43. [46]

    Networks (Oxford university press, 2018)

    Newman, M. Networks (Oxford university press, 2018)

  44. [47]

    Cimini, G. et al. The statistical physics of real-world networks. Nature Reviews Physics 1, 58–71 (2019)

  45. [48]

    & Fortunato, S

    Radicchi, F., Ramasco, J., Barrat, A. & Fortunato, S. Complex Net- works Renormalization: Flows and Fixed Points. Phys Rev Lett 101, 3–6 (2008)

  46. [49]

    & Ramasco, J

    Radicchi, F., Barrat, A., Fortunato, S. & Ramasco, J. J. Renormal- ization flows in complex networks. Phys. Rev. E 79, 026104 (2009). URL https://link.aps.org/doi/10.1103/PhysRevE.79.026104

  47. [50]

    & Chen, G

    Chen, D., Su, H., Wang, X., Pan, G.-J. & Chen, G. Finite-size scaling of geometric renormalization flows in complex networks. Phys. Rev. E 104, 034304 (2021). URL https://link.aps.org/doi/10.1103/ PhysRevE.104.034304

  48. [51]

    Chen, D., Cai, D. & Su, H. Scaling properties of scale-free networks in degree-thresholding renormalization flows. IEEE Transactions on Network Science and Engineering 10, 3519–3528 (2023). 44

  49. [52]

    Serafino, M. et al. True scale-free networks hidden by finite size effects. Proceedings of the National Academy of Sciences 118, e2013825118 (2021). URL https://www.pnas.org/doi/abs/ 10.1073/pnas.2013825118. https://www.pnas.org/doi/pdf/10. 1073/pnas.2013825118

  50. [53]

    & Drouffe, J

    Itzykson, C. & Drouffe, J. M. STATISTICAL FIELD THEORY. VOL. 1: FROM BROWNIAN MOTION TO RENORMALIZATION AND LATTICE GAUGE THEORY . Cambridge Monographs on Mathe- matical Physics (CUP, 1989)

  51. [54]

    Burgess, C. P. Introduction to Effective Field Theory (Cambridge University Press, 2020)

  52. [55]

    Bardoscia, M. et al. The physics of financial networks. Nature Reviews Physics 3, 490–507 (2021)

  53. [56]

    Soriano-Pa˜ nos, D. et al. Modeling communicable diseases, human mobility, and epidemics: A review. Annalen der Physik 534, 2100482 (2022)

  54. [57]

    & Makse, H

    Song, C., Havlin, S. & Makse, H. A. Self-similarity of complex net- works. Nature 433, 392–395 (2005)

  55. [58]

    & Young, A

    Binder, K. & Young, A. P. Spin glasses: Experimental facts, theoreti- cal concepts, and open questions. Reviews of Modern physics 58, 801 (1986)

  56. [59]

    Renormalization of Sparse Disorder in the Ising Model

    Bar-Yam, Y. & Patil, S. P. Renormalization of sparse disorder in the ising model. arXiv preprint arXiv:1805.12556 (2018)

  57. [60]

    Mandelbrot, B. B. The fractal geometry of nature, vol. 2 (WH freeman New York, 1982)

  58. [61]

    & Fronczak, P

    Samsel, M., Makulski, K., Lepek, M., Fronczak, A. & Fronczak, P. Towards fractal origins of the community structure in complex net- works: a model-based approach (2023). URL https://arxiv.org/ abs/2309.11126. 2309.11126

  59. [62]

    & Kim, D

    Goh, K.-I., Salvi, G., Kahng, B. & Kim, D. Skeleton and fractal scaling in complex networks. Phys. Rev. Lett. 96, 018701 (2006). URL https://link.aps.org/doi/10.1103/PhysRevLett.96.018701. 45

  60. [63]

    S., Goh, K.-I., Kahng, B

    Kim, J. S., Goh, K.-I., Kahng, B. & Kim, D. Fractality and self- similarity in scale-free networks.New Journal of Physics 9, 177 (2007). URL https://dx.doi.org/10.1088/1367-2630/9/6/177

  61. [64]

    Fronczak, A. et al. Scaling theory of fractal complex networks. Scientific Reports 14 (2024). URL http://dx.doi.org/10.1038/ s41598-024-59765-2

  62. [65]

    & Makse, H

    Song, C., Havlin, S. & Makse, H. A. Origins of fractality in the growth of complex networks. Nature Physics 2, 275–281 (2006)

  63. [66]

    D., Song, C

    Rozenfeld, H. D., Song, C. & Makse, H. A. Small-World to Frac- tal Transition in Complex Networks: A Renormalization Group Ap- proach. Phys Rev Lett 104, 1–4 (2010)

  64. [67]

    & Watts, D

    Newman, M. & Watts, D. Renormalization group analysis of the small-world network model. Physics Letters A 263, 341–346 (1999). URL https://www.sciencedirect.com/science/article/ pii/S0375960199007574

  65. [68]

    Kim, B. J. Geographical coarse graining of complex networks. Phys. Rev. Lett. 93, 168701 (2004). URL https://link.aps.org/doi/10. 1103/PhysRevLett.93.168701

  66. [69]

    & De Los Rios, P

    Gfeller, D. & De Los Rios, P. Spectral coarse graining of complex networks. Phys. Rev. Lett. 99, 038701 (2007). URL http://link. aps.org/doi/10.1103/PhysRevLett.99.038701

  67. [70]

    & Fan, Y

    Wang, Y., Zeng, A., Di, Z. & Fan, Y. Spectral coarse graining for ran- dom walks in bipartite networks. Chaos: An Interdisciplinary Journal of Nonlinear Science 23, 013104 (2013). URL https://doi.org/10. 1063/1.4773823. https://pubs.aip.org/aip/cha/article-pdf/ doi/10.1063/1.4773823/13553888/013104_1_online.pdf

  68. [71]

    & De Los Rios, P

    Gfeller, D. & De Los Rios, P. Spectral coarse graining and synchroniza- tion in oscillator networks. Phys. Rev. Lett. 100, 174104 (2008). URL https://link.aps.org/doi/10.1103/PhysRevLett.100.174104

  69. [72]

    & Chen, G

    Chen, J., an Lu, J., Lu, X., Wu, X. & Chen, G. Spec- tral coarse graining of complex clustered networks. Communica- tions in Nonlinear Science and Numerical Simulation 18, 3036–3045 (2013). URL https://www.sciencedirect.com/science/article/ pii/S1007570413001664. 46

  70. [73]

    & Wang, P

    Jia, Z., Zeng, L., Wang, Y.-Y. & Wang, P. Optimization al- gorithms for spectral coarse-graining of complex networks. Phys- ica A: Statistical Mechanics and its Applications 514, 925–935 (2019). URL https://www.sciencedirect.com/science/article/ pii/S0378437118312834

  71. [74]

    & L¨ u, L

    Zeng, A. & L¨ u, L. Coarse graining for synchronization in directed networks. Phys. Rev. E 83, 056123 (2011). URL https://link.aps. org/doi/10.1103/PhysRevE.83.056123

  72. [75]

    Wang, P. & Xu, S. Spectral coarse grained controllability of complex networks. Physica A: Statistical Mechanics and its Applications 478, 168–176 (2017). URL https://www.sciencedirect.com/science/ article/pii/S0378437117302030

  73. [76]

    & Erzan, A

    Ayg¨ un, E. & Erzan, A. Spectral renormalization group theory on networks. Journal of Physics: Conference Series 319, 012007 (2011). URL https://dx.doi.org/10.1088/1742-6596/319/1/012007

  74. [77]

    & Erzan, A

    Tuncer, A. & Erzan, A. Spectral renormalization group for the gaussian model and ψ4 theory on nonspatial networks. Phys. Rev. E 92, 022106 (2015). URL https://link.aps.org/doi/10.1103/ PhysRevE.92.022106

  75. [78]

    & Gabrielli, A

    Villegas, P., Gili, T., Caldarelli, G. & Gabrielli, A. Laplacian renor- malization group for heterogeneous networks. Nature Physics 19, 445– 450 (2023)

  76. [79]

    & Yan, Y

    Chen, H., Hou, Z., Xin, H. & Yan, Y. Statistically consistent coarse- grained simulations for critical phenomena in complex networks.Phys. Rev. E 82, 011107 (2010). URL https://link.aps.org/doi/10. 1103/PhysRevE.82.011107

  77. [80]

    & Wang, Y.-Y

    Long, Y.-S., Jia, Z. & Wang, Y.-Y. Coarse graining method based on generalized degree in complex network. Physica A: Statistical Me- chanics and its Applications 505, 655–665 (2018). URL https://www. sciencedirect.com/science/article/pii/S0378437118303996

  78. [81]

    Wang, Y., Jia, Z., Zeng, L. et al. Coarse graining method based on node similarity in complex network. Communications and Network 10, 51 (2018)

  79. [82]

    & White, H

    Lorrain, F. & White, H. C. Structural equivalence of individuals in so- cial networks. The Journal of mathematical sociology 1, 49–80 (1971). 47

  80. [83]

    Dunne, J. A. Food webs. Encyclopedia of complexity and systems science 1, 3661–3682 (2009)

Showing first 80 references.