pith. sign in

arxiv: 2506.18073 · v2 · submitted 2025-06-22 · 🧮 math.CO · math-ph· math.MP

Reducible Iterated Graph Systems: multiscale-freeness and multifractals

Nero Ziyu Li , Frank Xin Hu , Thomas Britz This is my paper

Pith reviewed 2026-05-19 08:08 UTC · model grok-4.3

classification 🧮 math.CO math-phmath.MP
keywords iterated graph systemsmultifractalitymultiscale-freenessfractal spectrumdegree spectrumreducible graphsfractal graphs
0
0 comments X

The pith

Reducible Iterated Graph Systems have finite discrete fractal and degree spectra under equivalent conditions for multifractality and multiscale-freeness

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

The paper extends Edge Iterated Graph Systems from the primitive case to the reducible setting. It formulates rigorous definitions of multifractality and multiscale-freeness for fractal graphs and proves conditions equivalent to these phenomena. It further shows that the associated fractal spectrum and degree spectrum are always finite and discrete. This completes the foundational theory of Edge IGS by covering reducible constructions. A sympathetic reader would care because it supplies a uniform way to classify scaling behaviors across a broader family of iterative graph constructions.

Core claim

In the reducible setting of Edge Iterated Graph Systems, multifractality and multiscale-freeness occur precisely when certain equivalent conditions on the iteration rules hold; under those conditions the fractal spectrum (the set of distinct scaling dimensions realized by the graph) and the degree spectrum are both finite discrete sets. These results extend the earlier analysis of the primitive case and close the remaining gap in the basic theory.

What carries the argument

Reducible Iterated Graph Systems as the extension of primitive Edge IGS that carries the definitions of multifractality (multiple distinct scaling dimensions) and multiscale-freeness (absence of a single characteristic scale) along with the equivalence conditions and spectra.

Load-bearing premise

Reducible Iterated Graph Systems admit well-posed extensions of the primitive-case definitions and analysis techniques without introducing inconsistencies or requiring additional unstated constraints on the graph constructions.

What would settle it

A concrete reducible Iterated Graph System whose fractal spectrum is infinite or continuous would disprove the claim that the spectra are always finite and discrete.

Figures

Figures reproduced from arXiv: 2506.18073 by Frank Xin Hu, Nero Ziyu Li, Thomas Britz.

Figure 1
Figure 1. Figure 1: An example of reducible EIGS: the binary tree [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: A reducible EIGS: the Splendor diamond hierarchical lattice Example 1.2 [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: A reducible iterated graph system We now begin to analyse the growth rate of path lengths in an EIGS. When discussing metrics, we transform all directed graphs into their underlying undi￾rected graphs. Throughout this paper, distances are always defined with respect to these undirected graphs. That is, when considering distances, we will always ignore the direction of edges. Definition 2.5. In this paper, … view at source ↗
Figure 4
Figure 4. Figure 4: An illustration of block maps Write i ⇝X j if there exists N ∈ N such that (Xn)ij > 0. For a color ι ∈ [K], set rX(ι) := {i ∈ [K] : ι ⇝X i} . For blocks Bk, Bℓ we write Bk ⇝B Bℓ if some i ∈ Bk and j ∈ Bℓ satisfy i ⇝X j. Finally, for any color i ∈ [K] define the set of reachable blocks RX(i) :=  k ∈ [hX] : b(i) ⇝B k [PITH_FULL_IMAGE:figures/full_fig_p009_4.png] view at source ↗
Figure 3
Figure 3. Figure 3: The transition matrix M corresponding to this system is written into block form, with blocks B1 = {1}, B2 = {2, 3}, B3 = {4, 5, 6}. In this paper, we utilize a significant extension of the Perron-Frobenius The￾orem that is applicable to reducible non-negative matrices. We summarise the theorem, which appears relatively straightforward but has a non-trivial proof. We will present this result using the notat… view at source ↗
Figure 5
Figure 5. Figure 5: Numerics of the scale-freeness of Ξ7 1 , Ξ11 1 , and Ξ13 1 . disappears – a tendency already visible across the three panels—leaving only the red branch. The slopes of this surviving red branch are −1.85, −1.75, and −1.72, respectively, steadily approaching the theoretical value −1.5850. Definition 4.7. Let (G, degˆ G) be a degree-scaling limit and define the degree spectrum D(G) := ω- lim ℓ→0 log Pℓ(G) − … view at source ↗
Figure 6
Figure 6. Figure 6: The broken diamond hierarchical lattice is scale-free [PITH_FULL_IMAGE:figures/full_fig_p029_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Numerics of the multiscale-freeness of Ξ [PITH_FULL_IMAGE:figures/full_fig_p030_7.png] view at source ↗
read the original abstract

Iterated Graph Systems (IGS) transplant ideas from fractal geometry into graph theory. Building on this framework, we extend Edge IGS from the primitive to the reducible setting. Within this broader context, we formulate rigorous definitions of multifractality and multiscale-freeness for fractal graphs, and we establish conditions that are equivalent to the occurrence of these two phenomena. We further determine the corresponding fractal and degree spectra, proving that both are finite and discrete. These results complete the foundational theory of Edge IGS by filling the gap left by the primitive case studied in [1, 2].

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

2 major / 3 minor

Summary. The paper extends Edge Iterated Graph Systems (IGS) from the primitive case treated in prior works [1,2] to the reducible setting. It introduces rigorous definitions of multifractality and multiscale-freeness for fractal graphs, states conditions equivalent to the occurrence of these phenomena, and proves that the associated fractal and degree spectra are both finite and discrete. The results are presented as completing the foundational theory of Edge IGS.

Significance. If the derivations hold, the work supplies a complete framework for multifractal analysis of a wider class of graph constructions, including explicit spectra that are finite and discrete. This extends the primitive-case theory in a manner that preserves the same analytic techniques, potentially enabling systematic study of multiscale properties in reducible fractal graphs and related discrete models.

major comments (2)
  1. [§3, Theorem 3.4] §3, Theorem 3.4: the claimed equivalence between the reducible IGS satisfying the stated contraction conditions and the occurrence of multiscale-freeness relies on an extension of the primitive-case spectral radius argument; the manuscript should explicitly verify that the reduction map does not alter the eigenvalue bounds used in the primitive case (cf. [2, Lemma 4.2]).
  2. [§4.2, Definition 4.5 and Proposition 4.7] §4.2, Definition 4.5 and Proposition 4.7: the proof that the degree spectrum is discrete and finite appears to invoke a uniform bound on the number of distinct contraction ratios across reducible components; this bound is not stated as an explicit hypothesis on the IGS and should be added or derived from the reducibility assumption.
minor comments (3)
  1. [§2] Notation for the reduction operator R is introduced in §2 but used without re-statement in later sections; a brief reminder of its definition would improve readability.
  2. [Abstract and §4] The abstract refers to 'fractal and degree spectra' while the body distinguishes 'fractal spectrum' and 'degree spectrum'; consistent terminology across abstract and main text is recommended.
  3. [Figure 2] Figure 2 caption does not indicate whether the plotted spectra correspond to a primitive or reducible example; adding this clarification would help readers compare with the primitive-case figures in [1].

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading of the manuscript and the constructive comments. We address each major comment below.

read point-by-point responses

  1. Referee: [§3, Theorem 3.4] §3, Theorem 3.4: the claimed equivalence between the reducible IGS satisfying the stated contraction conditions and the occurrence of multiscale-freeness relies on an extension of the primitive-case spectral radius argument; the manuscript should explicitly verify that the reduction map does not alter the eigenvalue bounds used in the primitive case (cf. [2, Lemma 4.2]).

    Authors: We thank the referee for highlighting this point. The proof of Theorem 3.4 extends the spectral radius argument by decomposing the reducible system into its irreducible blocks via the reduction map; each block inherits the eigenvalue bounds from the primitive case because the reduction is defined to preserve the contraction structure and the associated adjacency matrices without introducing extraneous eigenvalues. To make the argument fully explicit, we will add a short verification paragraph (or auxiliary lemma) immediately before Theorem 3.4 that directly confirms the bounds are unchanged under the reduction map, following the technique of [2, Lemma 4.2]. revision: yes

  2. Referee: [§4.2, Definition 4.5 and Proposition 4.7] §4.2, Definition 4.5 and Proposition 4.7: the proof that the degree spectrum is discrete and finite appears to invoke a uniform bound on the number of distinct contraction ratios across reducible components; this bound is not stated as an explicit hypothesis on the IGS and should be added or derived from the reducibility assumption.

    Authors: The referee is right that the discreteness and finiteness of the degree spectrum in Proposition 4.7 rest on the existence of only finitely many distinct contraction ratios. Because any IGS is defined by a finite collection of vertices, edges, and contraction mappings, the set of contraction ratios is finite by construction. We will add an explicit sentence to Definition 4.5 recording this finiteness and, in the proof of Proposition 4.7, derive the uniform bound across reducible components by observing that the reduction map partitions the system into components that all draw their contraction ratios from the same finite global set. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained with independent extensions

full rationale

The paper extends Edge IGS from the primitive case in prior references [1,2] to the reducible setting by introducing new rigorous definitions of multifractality and multiscale-freeness for fractal graphs, establishing equivalent conditions for these phenomena, and proving that the corresponding fractal and degree spectra are finite and discrete. These steps constitute original derivations and proofs that do not reduce by construction to the inputs or rely on self-citation as the sole justification for the central claims. The work explicitly states that the reducible case admits well-posed extensions of the primitive-case techniques without inconsistencies or additional unstated constraints, rendering the derivation chain self-contained against external benchmarks rather than circular.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Review based on abstract only; no explicit free parameters, invented entities, or ad-hoc axioms are stated in the provided text. The framework relies on standard domain assumptions from fractal geometry and graph theory as transplanted in the IGS approach.

axioms (1)
  • domain assumption Standard mathematical assumptions of graph theory and fractal geometry suffice to define and extend Iterated Graph Systems to the reducible case.
    The abstract states that the work transplants ideas from fractal geometry into graph theory and extends the primitive framework.

pith-pipeline@v0.9.0 · 5632 in / 1279 out tokens · 37352 ms · 2026-05-19T08:08:55.136458+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

  • IndisputableMonolith/Foundation/AlexanderDuality.lean alexander_duality_circle_linking unclear
    ?
    unclear

    Relation between the paper passage and the cited Recognition theorem.

    We formulate rigorous definitions of multifractality and multiscale-freeness for fractal graphs, and we establish conditions that are equivalent to the occurrence of these two phenomena. We further determine the corresponding fractal and degree spectra, proving that both are finite and discrete.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

41 extracted references · 41 canonical work pages · 1 internal anchor

  1. [1]

    On the scale-freeness of random colored substitution networks,

    N. Z. Li and T. Britz, “On the scale-freeness of random colored substitution networks,” Proceedings of the American Mathematical Society , vol. 152, no. 04, pp. 1377–1389, 2024

    work page 2024

  2. [2]

    Fractal dimensions for iterated graph systems,

    Z. Neroli, “Fractal dimensions for iterated graph systems,” Proceedings of the Royal Society A , vol. 480, no. 2300, p. 20240406, 2024

    work page 2024

  3. [3]

    Recursion equations in gauge field theories,

    A. A. Migdal, “Recursion equations in gauge field theories,” in 30 Years Of The Landau Institute—Selected Papers , pp. 114–119, World Scientific, 1996

    work page 1996

  4. [4]

    Notes on migdal’s recursion formulas,

    L. P. Kadanoff, “Notes on migdal’s recursion formulas,” Annals of Physics, vol. 100, no. 1-2, pp. 359–394, 1976

    work page 1976

  5. [5]

    Cluster shapes at the percolation threshold: and effective cluster dimensionality and its connection with critical-point exponents,

    H. E. Stanley, “Cluster shapes at the percolation threshold: and effective cluster dimensionality and its connection with critical-point exponents,” Journal of Physics A: Mathematical and General , vol. 10, no. 11, p. L211, 1977

    work page 1977

  6. [6]

    Renormalisation-group calculations of finite systems: order parameter and specific heat for epitaxial ordering,

    A. N. Berker and S. Ostlund, “Renormalisation-group calculations of finite systems: order parameter and specific heat for epitaxial ordering,” Journal of Physics C: Solid State Physics , vol. 12, no. 22, p. 4961, 1979

    work page 1979

  7. [7]

    Exactly soluble ising models on hierar- chical lattices,

    M. Kaufman and R. B. Griffiths, “Exactly soluble ising models on hierar- chical lattices,” Physical Review B, vol. 24, no. 1, p. 496, 1981

    work page 1981

  8. [8]

    Density of states on fractals: fractons,

    S. Alexander and R. Orbach, “Density of states on fractals: fractons,” Journal de Physique Lettres , vol. 43, no. 17, pp. 625–631, 1982

    work page 1982

  9. [9]

    Phase transitions on fractals. ii. sierpinski gaskets,

    Y. Gefen, A. Aharony, Y. Shapir, and B. B. Mandelbrot, “Phase transitions on fractals. ii. sierpinski gaskets,” Journal of Physics A: Mathematical and General, vol. 17, no. 2, p. 435, 1984. 31

    work page 1984

  10. [10]

    Particle-antiparticle annihilation in diffusive motion,

    D. Toussaint and F. Wilczek, “Particle-antiparticle annihilation in diffusive motion,” The Journal of Chemical Physics , vol. 78, no. 5, pp. 2642–2647, 1983

    work page 1983

  11. [11]

    Flow in porous media: The

    H. E. Stanley and A. Coniglio, “Flow in porous media: The” backbone” fractal at the percolation threshold,” Physical Review B , vol. 29, no. 1, p. 522, 1984

    work page 1984

  12. [12]

    Fractal structure of zeros in hierarchical models,

    B. Derrida, L. De Seze, and C. Itzykson, “Fractal structure of zeros in hierarchical models,” Journal of Statistical Physics , vol. 33, pp. 559–569, 1983

    work page 1983

  13. [13]

    Self-similarity of complex networks,

    C. Song, S. Havlin, and H. A. Makse, “Self-similarity of complex networks,” Nature, vol. 433, no. 7024, pp. 392–395, 2005

    work page 2005

  14. [14]

    Collective dynamics of ‘small- world’networks,

    D. J. Watts and S. H. Strogatz, “Collective dynamics of ‘small- world’networks,” nature, vol. 393, no. 6684, pp. 440–442, 1998

    work page 1998

  15. [15]

    Emergence of scaling in random networks,

    A.-L. Barab´ asi and R. Albert, “Emergence of scaling in random networks,” science, vol. 286, no. 5439, pp. 509–512, 1999

    work page 1999

  16. [16]

    Hierarchical organization in complex net- works,

    E. Ravasz and A.-L. Barab´ asi, “Hierarchical organization in complex net- works,” Physical review E, vol. 67, no. 2, p. 026112, 2003

    work page 2003

  17. [17]

    Epidemic spreading in scale-free networks,

    R. Pastor-Satorras and A. Vespignani, “Epidemic spreading in scale-free networks,” Physical review letters, vol. 86, no. 14, p. 3200, 2001

    work page 2001

  18. [18]

    Brownian motion on the sierpinski gas- ket,

    M. T. Barlow and E. A. Perkins, “Brownian motion on the sierpinski gas- ket,” Probability theory and related fields, vol. 79, no. 4, pp. 543–623, 1988

    work page 1988

  19. [19]

    Transition density estimates for brow- nian motion on scale irregular sierpinski gaskets,

    M. T. Barlow and B. M. Hambly, “Transition density estimates for brow- nian motion on scale irregular sierpinski gaskets,” in Annales de l’Institut Henri Poincare (B) Probability and Statistics , vol. 33, pp. 531–557, Else- vier, 1997

    work page 1997

  20. [20]

    Brownian motion and harmonic analysis on sierpinski carpets,

    M. T. Barlow and R. F. Bass, “Brownian motion and harmonic analysis on sierpinski carpets,” Canadian Journal of Mathematics , vol. 51, no. 4, pp. 673–744, 1999

    work page 1999

  21. [21]

    A harmonic calculus on the sierpinski spaces,

    J. Kigami, “A harmonic calculus on the sierpinski spaces,” Japan Journal of applied mathematics , vol. 6, pp. 259–290, 1989

    work page 1989

  22. [22]

    Harmonic calculus on pcf self-similar sets,

    J. Kigami, “Harmonic calculus on pcf self-similar sets,” Transactions of the American Mathematical Society, vol. 335, no. 2, pp. 721–755, 1993

    work page 1993

  23. [23]

    Kigami, Analysis on Fractals

    J. Kigami, Analysis on Fractals. Cambridge University Press, 2001

    work page 2001

  24. [24]

    Diffusion on the scaling limit of the critical percolation cluster in the diamond hierarchical lattice,

    B. M. Hambly and T. Kumagai, “Diffusion on the scaling limit of the critical percolation cluster in the diamond hierarchical lattice,” Communications in Mathematical Physics , vol. 295, pp. 29–69, 2010. 32

    work page 2010

  25. [25]

    Asymptotics for functions associated with heat flow on the sierpinski carpet,

    B. M. Hambly, “Asymptotics for functions associated with heat flow on the sierpinski carpet,” Canadian Journal of Mathematics , vol. 63, no. 1, pp. 153–180, 2011

    work page 2011

  26. [26]

    On the dichotomy in the heat kernel two sided estimates,

    A. Grigor’yan and T. Kumagai, “On the dichotomy in the heat kernel two sided estimates,” in Analysis on Graphs and its Applications (P. Exner et al.(eds.)), Proc. of Symposia in Pure Math , vol. 77, pp. 199–210, 2008

    work page 2008

  27. [27]

    Heat kernels on metric measure spaces and an application to semilinear elliptic equations,

    A. Grigor’yan, J. Hu, and K.-S. Lau, “Heat kernels on metric measure spaces and an application to semilinear elliptic equations,” Transactions of the American Mathematical Society, vol. 355, no. 5, pp. 2065–2095, 2003

    work page 2065

  28. [28]

    Self-similar k-graph c*-algebras,

    H. Li and D. Yang, “Self-similar k-graph c*-algebras,” International Math- ematics Research Notices, vol. 2021, no. 15, pp. 11270–11305, 2021

    work page 2021

  29. [29]

    Gradient estimate for the heat kernel on some fractal-like cable systems and quasi-riesz transforms,

    B. Devyver, E. Russ, and M. Yang, “Gradient estimate for the heat kernel on some fractal-like cable systems and quasi-riesz transforms,” Interna- tional Mathematics Research Notices , vol. 2023, no. 18, pp. 15537–15583, 2023

    work page 2023

  30. [30]

    Fractality and scale-free effect of a class of self-similar networks,

    L. Xi, L. Wang, S. Wang, Z. Yu, and Q. Wang, “Fractality and scale-free effect of a class of self-similar networks,” Physica A: Statistical Mechanics and its Applications , vol. 478, pp. 31–40, 2017

    work page 2017

  31. [31]

    Average distance of substitution networks,

    Q. Ye and L. Xi, “Average distance of substitution networks,” Fractals, vol. 27, no. 06, p. 1950097, 2019

    work page 2019

  32. [32]

    Scale-free effect of substitution networks,

    Z. Li, Z. Yu, and L. Xi, “Scale-free effect of substitution networks,” Physica A: Statistical Mechanics and its Applications, vol. 492, pp. 1449–1455, 2018

    work page 2018

  33. [33]

    On constructions of fractal spaces us- ing replacement and the combinatorial loewner property,

    R. Anttila and S. Eriksson-Bique, “On constructions of fractal spaces us- ing replacement and the combinatorial loewner property,” arXiv preprint arXiv:2406.08062, 2024

    work page arXiv 2024

  34. [34]

    Iterated graph systems and the combi- natorial loewner property,

    R. Anttila and S. Eriksson-Bique, “Iterated graph systems and the combi- natorial loewner property,” arXiv preprint arXiv:2408.15692 , 2024

    work page arXiv 2024

  35. [35]

    Fractal Graph Contrastive Learning

    N. Z. Li, X. Zhai, Z. Shi, B. Shi, and X. Jiang, “Fractal graph contrastive learning,” arXiv preprint arXiv:2505.11356 , 2025

    work page internal anchor Pith review Pith/arXiv arXiv 2025

  36. [36]

    Renormalization group approach to percolation in hierarchical lattices,

    A. Levitan, “Renormalization group approach to percolation in hierarchical lattices,” arXiv preprint arXiv:2202.09436 , 2022

    work page arXiv 2022

  37. [37]

    Percolation on fractal networks: A survey,

    M.- ´A. M. Cruz, J. P. Ortiz, M. P. Ortiz, and A. Balankin, “Percolation on fractal networks: A survey,” Fractal and Fractional, vol. 7, no. 3, p. 231, 2023

    work page 2023

  38. [38]

    Perron-frobenius theory and frequency con- vergence for reducible substitutions,

    M. Lustig and C. Uyanik, “Perron-frobenius theory and frequency con- vergence for reducible substitutions,” Discrete and Continuous Dynamical Systems, vol. 37, no. 1, pp. 355–385, 2016. 33

    work page 2016

  39. [39]

    Unzerlegbare, nicht negative matrizen,

    H. Wielandt, “Unzerlegbare, nicht negative matrizen,” Mathematische Zeitschrift, vol. 52, no. 1, pp. 642–648, 1950

    work page 1950

  40. [40]

    J. M. Fraser, Assouad Dimension and Fractal Geometry , vol. 222. Cam- bridge University Press, 2020

    work page 2020

  41. [41]

    Falconer, Fractal Geometry: Mathematical Foundations and Applica- tions

    K. Falconer, Fractal Geometry: Mathematical Foundations and Applica- tions. John Wiley & Sons, 2013. 34

    work page 2013