pith. machine review for the scientific record. sign in

arxiv: 2605.13423 · v1 · submitted 2026-05-13 · 🧮 math.SP · math.PR

Recognition: unknown

Ultrametric Graphons and Hierarchical Community Networks: Spectral Theory and Applications

\'Angel Alfredo Mor\'an Ledezma

Authors on Pith no claims yet

Pith reviewed 2026-05-14 18:39 UTC · model grok-4.3

classification 🧮 math.SP math.PR
keywords ultrametric graphonshierarchical communitiesspectral approximationrandom Laplacianscommunity detectionepidemic stabilitygraph limitsnested partitions
0
0 comments X

The pith

Explicit formulas for deterministic ultrametric Laplacians approximate the spectra of random hierarchical networks with high probability as size grows.

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

The paper develops ultrametric graphons as limiting objects for random networks whose edges are governed by a nested hierarchical community structure. Connection probability between any two vertices is set by their ultrametric distance, which itself arises from a fixed family of nested partitions of the unit interval. For the deterministic graph sampled from such a graphon the Laplacian admits fully explicit eigenvalues and spectral projectors written directly in terms of the community sizes and the inter-community densities. These closed-form expressions remain valid for the corresponding random Laplacian in the large-size limit, where normalized eigenvalues and projectors converge in probability to the deterministic ones. The same limit supplies concrete closed-form results for community detection thresholds, hitting times, and stability of epidemic equilibria on hierarchical networks.

Core claim

An ultrametric graphon is a graphon W(x,y)=w(d(x,y)) where d is the ultrametric induced by a family of nested partitions on [0,1] and w is a positive kernel. The deterministic Laplacian L_d^k obtained by sampling this graphon is itself an ultrametric operator whose eigenvalues and spectral projectors possess completely explicit closed-form expressions in terms of community sizes and inter-community connection densities. The normalized eigenvalues and spectral projectors of the random Laplacian L_r^k are arbitrarily close to those of L_d^k with high probability as k tends to infinity, so the deterministic formulas furnish closed-form approximations for the spectrum of the random hierarchical

What carries the argument

The deterministic ultrametric Laplacian L_d^k, which carries explicit closed-form expressions for eigenvalues and spectral projectors expressed solely in terms of community sizes and inter-community densities.

If this is right

  • A sign structure theorem extends the classical Fiedler vector criterion to networks containing arbitrarily many hierarchical communities.
  • Spectral community detection possesses a sharp detectability threshold equal to the minimum expected intra-community degree.
  • The Moore-Penrose pseudo-inverse of the random Laplacian converges almost surely to the graphon pseudo-inverse, implying that hitting and commute times depend only on the expected degrees of the endpoints.
  • Explicit closed-form stability conditions for the SIS disease-free equilibrium reveal a tension between homogeneous and heterogeneous community structures.

Where Pith is reading between the lines

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

  • The same explicit spectral control could be used to design optimal community partitions that minimize epidemic risk or maximize detection reliability.
  • Because the construction relies only on nested partitions, analogous approximations may hold for ultrametric structures defined on other measure spaces or on trees.
  • Convergence of the pseudo-inverse suggests that effective resistances and other quadratic forms also collapse to deterministic expressions depending solely on the ultrametric distance.

Load-bearing premise

The random graph must be generated exactly according to the ultrametric graphon defined by a fixed family of nested partitions and a positive kernel; any deviation from this exact generative process makes the explicit formulas and convergence claims fail.

What would settle it

Repeated numerical generation of large random graphs from the ultrametric model followed by direct comparison of their normalized Laplacian eigenvalues against the predicted closed-form values; persistent deviation beyond the claimed high-probability error bound for large k would falsify the approximation result.

read the original abstract

We develop a theory of ultrametric graphons as limiting objects for random networks with nested hierarchical community structure. A graphon $W:[0,1]^2\to[0,1]$ is called ultrametric if $W(x,y)=w(d(x,y))$, where $d$ is an ultrametric on $[0,1]$ induced by a family of nested partitions and $w$ is a positive kernel. The resulting random graphs exhibit a nested hierarchical community structure in which the density of connections is governed by the ultrametric distance between vertices. The Laplacian $L_d^k$ of the deterministic graph sampled from an ultrametric graphon is itself an ultrametric Laplacian, whose eigenvalues and spectral projectors admit completely explicit closed-form expressions in terms of the community sizes and inter-community connection densities. We show that the normalized eigenvalues and spectral projectors of the random Laplacian $L_r^k$ are arbitrarily close to those of $L_d^k$ with high probability as $k\to\infty$, so that the explicit formulas for $L_d^k$ provide closed-form approximations for the spectrum and spectral projectors of $L_r^k$. As applications: a sign structure theorem generalizes the Fiedler vector criterion to hierarchical networks with arbitrarily many communities; a detectability threshold $p^*=\min_i\rho_i$ governs spectral community detection for one-level hierarchical graphons; the pseudo-inverse Laplacian $L_W^+$ is constructed and shown to be the almost sure limit of the pseudo-inverse of $L_r^k$, implying that hitting and commute times collapse to quantities depending only on the expected degrees of the endpoints; and explicit closed-form stability conditions for the SIS disease-free equilibrium reveal a fundamental tension between homogeneous and heterogeneous community structures, confirmed by numerical experiments.

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

3 major / 2 minor

Summary. The manuscript develops a theory of ultrametric graphons W(x,y)=w(d(x,y)) for random networks with nested hierarchical community structure, where d arises from a fixed family of nested partitions. The deterministic Laplacian L_d^k admits explicit closed-form expressions for its eigenvalues and spectral projectors in terms of community sizes and inter-community densities ρ_i. The central result asserts that the normalized eigenvalues and spectral projectors of the random Laplacian L_r^k converge to those of L_d^k with high probability as k→∞. Applications include a sign structure theorem generalizing the Fiedler vector, a detectability threshold p^*=min_i ρ_i, almost-sure convergence of the pseudo-inverse L_W^+, and explicit stability conditions for the SIS disease-free equilibrium.

Significance. If the high-probability convergence holds with explicit rates, the explicit formulas for L_d^k constitute a major strength, supplying closed-form spectral approximations that avoid fitting parameters from the same data. This framework could meaningfully advance analysis of hierarchical networks in community detection and epidemic dynamics, with the pseudo-inverse limit and SIS stability conditions offering concrete, testable predictions.

major comments (3)
  1. [Abstract] Abstract: the claim that normalized eigenvalues and projectors of L_r^k converge arbitrarily closely to those of L_d^k with high probability as k→∞ does not specify the norm (operator, Schatten, or entrywise) or the concentration tool. If the argument relies on per-block concentration plus union bound, the number of blocks grows with the refinement of the nested partitions; without super-exponential tails or matrix-Bernstein-type bounds that absorb this growth, the overall probability need not tend to 1.
  2. [Applications] Applications section: the detectability threshold p^*=min_i ρ_i is stated for one-level hierarchical graphons, but the manuscript must supply both the upper bound (success above threshold) and a matching lower bound (failure below threshold) to establish sharpness; the current statement appears to rest only on the explicit spectrum of L_d^k without the necessary information-theoretic or second-moment analysis.
  3. [Applications] The pseudo-inverse limit L_W^+ is asserted to be the almost-sure limit of the pseudo-inverse of L_r^k, implying hitting and commute times depend only on expected degrees. This requires uniform control on the smallest nonzero eigenvalue away from zero uniformly in k; the convergence statement in the abstract does not yet address the rate at which the spectral gap is preserved.
minor comments (2)
  1. Notation for the ultrametric d induced by the nested partitions and the kernel w should be introduced with a single diagram or table that lists the partition levels, block sizes, and corresponding ρ_i values.
  2. The numerical experiments confirming the SIS stability conditions should report the precise community-size scaling with k and the number of Monte-Carlo realizations used to estimate the high-probability event.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments, which will help strengthen the clarity and rigor of the manuscript. We address each major comment point by point below.

read point-by-point responses

  1. Referee: [Abstract] the claim that normalized eigenvalues and projectors of L_r^k converge arbitrarily closely to those of L_d^k with high probability as k→∞ does not specify the norm (operator, Schatten, or entrywise) or the concentration tool. If the argument relies on per-block concentration plus union bound, the number of blocks grows with the refinement of the nested partitions; without super-exponential tails or matrix-Bernstein-type bounds that absorb this growth, the overall probability need not tend to 1.

    Authors: We agree the norm and concentration tool must be stated explicitly. The proof establishes convergence in the operator norm via the matrix Bernstein inequality applied to the ultrametric block structure. The sub-exponential tails absorb the polynomial growth in the number of blocks with k, so the probability tends to 1. We will revise the abstract and Theorem 3.1 to specify the operator norm and cite the matrix Bernstein bound. revision: yes

  2. Referee: [Applications] the detectability threshold p^*=min_i ρ_i is stated for one-level hierarchical graphons, but the manuscript must supply both the upper bound (success above threshold) and a matching lower bound (failure below threshold) to establish sharpness; the current statement appears to rest only on the explicit spectrum of L_d^k without the necessary information-theoretic or second-moment analysis.

    Authors: The value p^* is the point at which the second eigenvalue of L_d^k becomes positive, yielding the upper bound for success of the spectral method via the sign structure of the Fiedler vector. We will add a second-moment calculation on the community-indicator quadratic forms to obtain the matching lower bound, showing that below p^* the variance prevents reliable detection. This establishes sharpness of the spectral threshold. revision: yes

  3. Referee: [Applications] The pseudo-inverse limit L_W^+ is asserted to be the almost-sure limit of the pseudo-inverse of L_r^k, implying hitting and commute times depend only on expected degrees. This requires uniform control on the smallest nonzero eigenvalue away from zero uniformly in k; the convergence statement in the abstract does not yet address the rate at which the spectral gap is preserved.

    Authors: We will insert a new lemma deriving a k-independent lower bound on the spectral gap of L_d^k directly from the closed-form eigenvalue expressions. Combined with the high-probability operator-norm convergence, this yields uniform gap control for L_r^k and allows application of resolvent perturbation to obtain almost-sure convergence of the pseudo-inverses. The revised version will include the lemma and explicit gap estimates. revision: yes

Circularity Check

0 steps flagged

No circularity: explicit formulas derive directly from model parameters; convergence is a stated limit theorem

full rationale

The abstract states that L_d^k admits explicit closed-form expressions in terms of community sizes and inter-community densities induced by the ultrametric graphon W. The claim that normalized eigenvalues and projectors of L_r^k converge to those of L_d^k with high probability as k→∞ is presented as a probabilistic limit result, not as an identity obtained by fitting parameters from the random graph itself or by self-referential definition. No load-bearing self-citation, ansatz smuggling, or renaming of known results is indicated. The derivation chain remains self-contained against the generative model assumptions.

Axiom & Free-Parameter Ledger

1 free parameters · 1 axioms · 0 invented entities

The central claims rest on the definition of ultrametric graphons via nested partitions and the assumption that random graphs are sampled i.i.d. from the resulting kernel; no additional free parameters beyond the kernel w and partition sizes are introduced.

free parameters (1)
  • inter-community connection densities rho_i
    These define the kernel w and govern edge probabilities between communities at each level.
axioms (1)
  • domain assumption d is an ultrametric on [0,1] induced by a family of nested partitions
    Invoked to ensure the hierarchical community structure and the form W(x,y)=w(d(x,y)).

pith-pipeline@v0.9.0 · 5622 in / 1322 out tokens · 59245 ms · 2026-05-14T18:39:44.780903+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

55 extracted references · 39 canonical work pages · 1 internal anchor

  1. [1]

    Oxford University Press, ??? (2018)

    Newman, M.: Networks. Oxford University Press, ??? (2018). https://doi.org/10.1093/oso/ 9780198805090.001.0001 .https://doi.org/10.1093/oso/9780198805090.001.0001

    work page doi:10.1093/oso/ 2018

  2. [3]

    Physical Review E69(2), 026113 (2004) https://doi.org/10.1103/PhysRevE.69.026113

    Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Physical Review E69(2), 026113 (2004) https://doi.org/10.1103/PhysRevE.69.026113

    work page doi:10.1103/physreve.69.026113 2004

  3. [4]

    Physics Reports486(3–5), 75–174 (2010) https: //doi.org/10.1016/j.physrep.2009.11.002

    Fortunato, S.: Community detection in graphs. Physics Reports486(3–5), 75–174 (2010) https: //doi.org/10.1016/j.physrep.2009.11.002

    work page doi:10.1016/j.physrep.2009.11.002 2010

  4. [5]

    Science297(5586), 1551–1555 (2002) https://doi.org/10

    Ravasz, E., Somera, A.L., Mongru, D.A., Oltvai, Z.N., Barab´ asi, A.-L.: Hierarchical organization of modularity in metabolic networks. Science297(5586), 1551–1555 (2002) https://doi.org/10. 1126/science.1073374

    2002

  5. [6]

    Proceedings of the National Academy of Sciences104(39), 15224–15229 (2007) https://doi.org/10.1073/pnas.0703740104

    Sales-Pardo, M., Guimer` a, R., Moreira, A.A., Amaral, L.A.N.: Extracting the hierarchical organi- zation of complex systems. Proceedings of the National Academy of Sciences104(39), 15224–15229 (2007) https://doi.org/10.1073/pnas.0703740104

    work page doi:10.1073/pnas.0703740104 2007

  6. [7]

    Nature453(7191), 98–101 (2008) https://doi.org/10.1038/nature06830

    Clauset, A., Moore, C., Newman, M.E.J.: Hierarchical structure and the prediction of missing links in networks. Nature453(7191), 98–101 (2008) https://doi.org/10.1038/nature06830

    work page doi:10.1038/nature06830 2008

  7. [8]

    Physical Review E 107(5), 054305 (2023) https://doi.org/10.1103/PhysRevE.107.054305 41

    Schaub, M.T., Li, J., Peel, L.: Hierarchical community structure in networks. Physical Review E 107(5), 054305 (2023) https://doi.org/10.1103/PhysRevE.107.054305 41

    work page doi:10.1103/physreve.107.054305 2023

  8. [9]

    Dreveton, M., Kuroda, D., Grossglauser, M., Thiran, P.: When does bottom-up beat top-down in hierarchical community detection? Journal of the American Statistical Association00, 1–12 (2025) https://doi.org/10.1080/01621459.2025.2569711

    work page doi:10.1080/01621459.2025.2569711 2025

  9. [10]

    AUT Journal of Mathematics and Computing3(2), 173–184 (2022) https://doi.org/10

    Rezvani, M., Kazemian, F.S.: A survey on hierarchical community detection in large-scale complex networks. AUT Journal of Mathematics and Computing3(2), 173–184 (2022) https://doi.org/10. 22060/AJMC.2022.21715.1103

    work page arXiv 2022

  10. [11]

    Frontiers in Neuroinformatics3, 37 (2009) https://doi.org/ 10.3389/neuro.11.037.2009

    Meunier, D., Lambiotte, R., Fornito, A., Ersche, K.D., Bullmore, E.T.: Hierarchical modularity in human brain functional networks. Frontiers in Neuroinformatics3, 37 (2009) https://doi.org/ 10.3389/neuro.11.037.2009

    work page doi:10.3389/neuro.11.037.2009 2009

  11. [12]

    Frontiers in Neuroscience4, 200 (2010) https://doi.org/10.3389/fnins.2010.00200

    Meunier, D., Lambiotte, R., Bullmore, E.T.: Modular and hierarchically modular organization of brain networks. Frontiers in Neuroscience4, 200 (2010) https://doi.org/10.3389/fnins.2010.00200

    work page doi:10.3389/fnins.2010.00200 2010

  12. [13]

    Scientific Reports13, 1–12 (2023) https://doi.org/10.1038/ s41598-023-35040-2

    Wierzbinski, M., Falc´ o-Roget, J., Crimi, A.: Community detection in brain connectomes with hybrid quantum computing. Scientific Reports13, 1–12 (2023) https://doi.org/10.1038/ s41598-023-35040-2

    2023

  13. [14]

    Proceedings of the American Philosophical Society 106(6), 467–482 (1962)

    Simon, H.A.: The architecture of complexity. Proceedings of the American Philosophical Society 106(6), 467–482 (1962)

    1962

  14. [15]

    Journal of Animal Ecology (2023) https://doi.org/10.1111/1365-2656.13900

    Borzone Mas, D., Scarabotti, P.A., Vaschetto, P.A., Alvarenga, P., Vazquez, M., Arim, M.: On traits matching and the modular organization of food web and occurrence networks. Journal of Animal Ecology (2023) https://doi.org/10.1111/1365-2656.13900

    work page doi:10.1111/1365-2656.13900 2023

  15. [16]

    Notices of the American Mathematical Society56(11), 1082–1097 (2009)

    Porter, M.A., Onnela, J.-P., Mucha, P.J.: Communities in networks. Notices of the American Mathematical Society56(11), 1082–1097 (2009)

    2009

  16. [17]

    IEEE Transactions on Signal Processing63(16), 4339–4352 (2015) https://doi.org/10.1109/TSP.2015.2442958

    Chen, P.-Y., Hero, A.O.: Phase transitions in spectral community detection. IEEE Transactions on Signal Processing63(16), 4339–4352 (2015) https://doi.org/10.1109/TSP.2015.2442958

    work page doi:10.1109/tsp.2015.2442958 2015

  17. [18]

    In: Proceedings of the Seventh International World Wide Web Conference, pp

    Brin, S., Page, L.: Anatomy of a large-scale hypertextual web search engine. In: Proceedings of the Seventh International World Wide Web Conference, pp. 107–117 (1998)

    1998

  18. [19]

    Internet Mathematics1(3), 335–380 (2004) https://doi.org/10.1080/15427951.2004.10129091

    Langville, A.N., Meyer, C.D.: Deeper inside PageRank. Internet Mathematics1(3), 335–380 (2004) https://doi.org/10.1080/15427951.2004.10129091

    work page doi:10.1080/15427951.2004.10129091 2004

  19. [20]

    Physical Review E85(5), 056107 (2012) https://doi.org/10.1103/PhysRevE.85.056107

    Lambiotte, R., Rosvall, M.: Ranking and clustering of nodes in networks with smart teleportation. Physical Review E85(5), 056107 (2012) https://doi.org/10.1103/PhysRevE.85.056107

    work page doi:10.1103/physreve.85.056107 2012

  20. [21]

    Physics Reports716–717, 1–58 (2017) https://doi.org/10.1016/j.physrep.2017.07.007

    Masuda, N., Porter, M.A., Lambiotte, R.: Random walks and diffusion on networks. Physics Reports716–717, 1–58 (2017) https://doi.org/10.1016/j.physrep.2017.07.007

    work page doi:10.1016/j.physrep.2017.07.007 2017

  21. [22]

    IEEE Transactions on Network Science and Engineering1(2), 76–90 (2015) https://doi.org/10.1109/TNSE.2015.2391998

    Lambiotte, R., Delvenne, J.-C., Barahona, M.: Random walks, Markov processes and the mul- tiscale modular organization of complex networks. IEEE Transactions on Network Science and Engineering1(2), 76–90 (2015) https://doi.org/10.1109/TNSE.2015.2391998

    work page doi:10.1109/tnse.2015.2391998 2015

  22. [23]

    PLoS ONE7(2), 32210 (2012) https://doi.org/10.1371/journal.pone.0032210

    Schaub, M.T., Delvenne, J.-C., Yaliraki, S.N., Barahona, M.: Markov dynamics as a zooming lens for multiscale community detection: non clique-like communities and the field-of-view limit. PLoS ONE7(2), 32210 (2012) https://doi.org/10.1371/journal.pone.0032210

    work page doi:10.1371/journal.pone.0032210 2012

  23. [24]

    Physical Review E101(5), 052301 (2020) https://doi.org/10.1103/PhysRevE.101.052301

    Patelli, A., Gabrielli, A., Cimini, G.: Generalized Markov stability of network communities. Physical Review E101(5), 052301 (2020) https://doi.org/10.1103/PhysRevE.101.052301

    work page doi:10.1103/physreve.101.052301 2020

  24. [25]

    Europhysics Letters103(5), 58002 (2013) https://doi.org/10.1209/0295-5075/103/58002

    Li, H.-J., Zhang, X.-S.: Analysis of stability of community structure across multiple hierarchical 42 levels. Europhysics Letters103(5), 58002 (2013) https://doi.org/10.1209/0295-5075/103/58002

    work page doi:10.1209/0295-5075/103/58002 2013

  25. [26]

    Physical Review E90(1), 012810 (2014) https: //doi.org/10.1103/PhysRevE.90.012810

    Bonaccorsi, S., Ottaviano, S., De Pellegrini, F., Socievole, A., Van Mieghem, P.: Epidemic outbreaks in two-scale community networks. Physical Review E90(1), 012810 (2014) https: //doi.org/10.1103/PhysRevE.90.012810

    work page doi:10.1103/physreve.90.012810 2014

  26. [27]

    Europhysics Letters72(2), 315–321 (2005) https://doi.org/10.1209/epl/i2004-10550-5

    Liu, Z., Hu, B.: Epidemic spreading in community networks. Europhysics Letters72(2), 315–321 (2005) https://doi.org/10.1209/epl/i2004-10550-5

    work page doi:10.1209/epl/i2004-10550-5 2005

  27. [28]

    Scientific Reports8, 2908 (2018) https://doi.org/10.1038/ s41598-018-20908-x

    Nadini, M., Sun, K., Ubaldi, E., Starnini, M., Rizzo, A., Perra, N.: Epidemic spreading in modular time-varying networks. Scientific Reports8, 2908 (2018) https://doi.org/10.1038/ s41598-018-20908-x

    2018

  28. [29]

    Physical Review E103(6), 062112 (2021) https://doi.org/10.1103/ PhysRevE.103.062112

    ´Odor, G.: Nonuniversal power-law dynamics of susceptible infected recovered models on hier- archical modular networks. Physical Review E103(6), 062112 (2021) https://doi.org/10.1103/ PhysRevE.103.062112

    2021

  29. [30]

    Civier, O., Smith, R.E., Yeh, C.-H., Connelly, A., Calamante, F.: Is removal of weak connections necessary for graph-theoretical analysis of dense weighted structural connectomes from diffusion MRI? NeuroImage194, 68–81 (2019) https://doi.org/10.1016/j.neuroimage.2019.02.039

    work page doi:10.1016/j.neuroimage.2019.02.039 2019

  30. [31]

    Spectral Geometry and Heat Kernels on Phylogenetic Trees

    Mor´ an Ledezma, A.A.: Spectral Geometry and Heat Kernels on Phylogenetic Trees. arXiv preprint. arXiv:2603.20922 (2026). https://doi.org/10.48550/arXiv.2603.20922

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.48550/arxiv.2603.20922 2026

  31. [33]

    Advances in Mathematics219(6), 1801–1851 (2008) https://doi.org/10.1016/j.aim.2008.07.008

    Borgs, C., Chayes, J.T., Lov´ asz, L., S´ os, V.T., Vesztergombi, K.: Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing. Advances in Mathematics219(6), 1801–1851 (2008) https://doi.org/10.1016/j.aim.2008.07.008

    work page doi:10.1016/j.aim.2008.07.008 2008

  32. [34]

    Annals of Mathematics176(1), 151–219 (2012) https://doi.org/10.4007/annals.2012.176.1.2

    Borgs, C., Chayes, J.T., Lov´ asz, L., S´ os, V.T., Vesztergombi, K.: Convergent sequences of dense graphs II: Multiway cuts and statistical physics. Annals of Mathematics176(1), 151–219 (2012) https://doi.org/10.4007/annals.2012.176.1.2

    work page doi:10.4007/annals.2012.176.1.2 2012

  33. [35]

    American Mathematical Society Colloquium Publications, vol

    Lov´ asz, L.: Large Networks and Graph Limits. American Mathematical Society Colloquium Publications, vol. 60. American Mathematical Society, Providence, RI (2012)

    2012

  34. [36]

    Annals of Statistics43(6), 2624– 2652 (2015) https://doi.org/10.1214/15-AOS1354

    Gao, C., Lu, Y., Zhou, H.H.: Rate-optimal graphon estimation. Annals of Statistics43(6), 2624– 2652 (2015) https://doi.org/10.1214/15-AOS1354

    work page doi:10.1214/15-aos1354 2015

  35. [37]

    Annals of Statistics45(1), 316–354 (2017) https://doi.org/10.1214/ 16-AOS1454

    Klopp, O., Tsybakov, A.B., Verzelen, N.: Oracle inequalities for network models and sparse graphon estimation. Annals of Statistics45(1), 316–354 (2017) https://doi.org/10.1214/ 16-AOS1454

    2017

  36. [38]

    SIAM Journal on Applied Mathematics81(6), 2323–2345 (2021) https://doi.org/10.1137/20M1339246

    Petit, J., Lambiotte, R., Carletti, T.: Random walks on dense graphs and graphons. SIAM Journal on Applied Mathematics81(6), 2323–2345 (2021) https://doi.org/10.1137/20M1339246

    work page doi:10.1137/20m1339246 2021

  37. [39]

    SIAM Journal on Mathematical Analysis55(3), 2150–2185 (2023) https://doi.org/10.1137/21M1455875

    Bramburger, J., Holzer, M.: Pattern formation in random networks using graphons. SIAM Journal on Mathematical Analysis55(3), 2150–2185 (2023) https://doi.org/10.1137/21M1455875

    work page doi:10.1137/21m1455875 2023

  38. [40]

    IEEE Transactions on Network Science and Engineering8(2), 1711–1721 (2021) https://doi.org/ 10.1109/TNSE.2021.3069675

    Vizuete, R., Garin, F., Frasca, P.: The Laplacian spectrum of large graphs sampled from graphons. IEEE Transactions on Network Science and Engineering8(2), 1711–1721 (2021) https://doi.org/ 10.1109/TNSE.2021.3069675

    work page doi:10.1109/tnse.2021.3069675 2021

  39. [41]

    SIAM Journal on 43 Applied Mathematics82(6) (2022) https://doi.org/10.1137/22M1492003

    Klimm, F., Jones, N.S., Schaub, M.T.: Modularity maximization for graphons. SIAM Journal on 43 Applied Mathematics82(6) (2022) https://doi.org/10.1137/22M1492003

    work page doi:10.1137/22m1492003 2022

  40. [42]

    Reviews of Modern Physics58(3), 765–788 (1986)

    Rammal, R., Toulouse, G., Virasoro, M.A.: Ultrametricity for physicists. Reviews of Modern Physics58(3), 765–788 (1986)

    1986

  41. [43]

    Journal of Statistical Mechanics: Theory and Experiment2025, 113501 (2025) https://doi.org/10.1088/1742-5468/ae120f

    Mor´ an Ledezma, A.: Time-varying energy landscapes and temperature paths: dynamic transi- tion rates in locally ultrametric complex systems. Journal of Statistical Mechanics: Theory and Experiment2025, 113501 (2025) https://doi.org/10.1088/1742-5468/ae120f . Open Access

    work page doi:10.1088/1742-5468/ae120f 2025

  42. [44]

    Journal of Mathematical Physics64(11), 113502 (2023) https://doi.org/10.1063/5.0152374

    Bradley, P.E., Ledezma, A.M.: Hearing shapes via p-adic laplacians. Journal of Mathematical Physics64(11), 113502 (2023) https://doi.org/10.1063/5.0152374

    work page doi:10.1063/5.0152374 2023

  43. [45]

    Entropy25, 949 (2023)

    Z´ u˜ niga-Galindo, W.A., Zambrano-Luna, B.A.: Hierarchical Wilson–Cowan models and connection matrices. Entropy25, 949 (2023)

    2023

  44. [46]

    Journal of Machine Learning Research15, 1751–1798 (2014)

    Luxburg, U., Radl, A., Hein, M.: Hitting and commute times in large random neighborhood graphs. Journal of Machine Learning Research15, 1751–1798 (2014)

    2014

  45. [47]

    Glasscock, D.: What is a graphon? Notices of the American Mathematical Society62(1), 46–48 (2015)

    2015

  46. [48]

    Journal of Combinatorial Theory, Series B96(6), 933–957 (2006) https://doi.org/10.1016/j.jctb.2006.05.002

    Lov´ asz, L., Szegedy, B.: Limits of dense graph sequences. Journal of Combinatorial Theory, Series B96(6), 933–957 (2006) https://doi.org/10.1016/j.jctb.2006.05.002

    work page doi:10.1016/j.jctb.2006.05.002 2006

  47. [49]

    Proceedings of the National Academy of Sciences120(33) (2023) https://doi.org/10.1073/pnas

    Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proceedings of the National Academy of Sciences99(12), 7821–7826 (2002) https://doi.org/10.1073/pnas. 122653799 https://www.pnas.org/doi/pdf/10.1073/pnas.122653799

    work page doi:10.1073/pnas 2002

  48. [50]

    Physica A: Statistical Mechanics and its Applications597, 127221 (2022)

    Z´ u˜ niga-Galindo, W.A.: Ultrametric diffusion, rugged energy landscapes and transition networks. Physica A: Statistical Mechanics and its Applications597, 127221 (2022)

    2022

  49. [51]

    Journal of Mathematical Analysis and Applications491(1), 124239 (2020)

    Z´ u˜ niga-Galindo, W.: Reaction-diffusion equations on complex networks and Turing patterns, via p-adic analysis. Journal of Mathematical Analysis and Applications491(1), 124239 (2020)

    2020

  50. [52]

    Biometrika102(2), 315–323 (2014) https://doi.org/10.1093/biomet/asv008 https://academic.oup.com/biomet/article-pdf/102/2/315/9642505/asv008.pdf

    Yu, Y., Wang, T., Samworth, R.J.: A useful variant of the davis–kahan theorem for statisticians. Biometrika102(2), 315–323 (2014) https://doi.org/10.1093/biomet/asv008 https://academic.oup.com/biomet/article-pdf/102/2/315/9642505/asv008.pdf

    work page doi:10.1093/biomet/asv008 2014

  51. [53]

    Neurocomputing 600, 128169 (2024) https://doi.org/10.1016/j.neucom.2024.128169

    Li, J., Lai, S., Shuai, Z., Tan, Y., Jia, Y., Yu, M., Song, Z., Peng, X., Xu, Z., Ni, Y., Qiu, H., Yang, J., Liu, Y., Lu, Y.: A comprehensive review of community detection in graphs. Neurocomputing 600, 128169 (2024) https://doi.org/10.1016/j.neucom.2024.128169

    work page doi:10.1016/j.neucom.2024.128169 2024

  52. [54]

    Czechoslovak Mathematical Journal23(2), 298–305 (1973)

    Fiedler, M.: Algebraic connectivity of graphs. Czechoslovak Mathematical Journal23(2), 298–305 (1973)

    1973

  53. [55]

    North-Holland Per- sonal Library

    Kampen, N.G.: Stochastic Processes in Physics and Chemistry, 3rd edn. North-Holland Per- sonal Library. North-Holland, Amsterdam (2007). https://doi.org/10.1016/B978-0-444-52965-7. X5000-4

    work page doi:10.1016/b978-0-444-52965-7 2007

  54. [56]

    IEEE Control Systems Letters4(3), 542–547 (2020) https://doi.org/10.1109/LCSYS.2020.2971021

    Vizuete, R., Frasca, P., Garin, F.: Graphon-based sensitivity analysis of SIS epidemics. IEEE Control Systems Letters4(3), 542–547 (2020) https://doi.org/10.1109/LCSYS.2020.2971021

    work page doi:10.1109/lcsys.2020.2971021 2020

  55. [57]

    IEEE Control Systems Magazine36(1), 26–46 (2016) https://doi.org/10.1109/MCS.2015.2495000 44

    Nowzari, C., Preciado, V.M., Pappas, G.J.: Analysis and control of epidemics: A survey of spreading processes on complex networks. IEEE Control Systems Magazine36(1), 26–46 (2016) https://doi.org/10.1109/MCS.2015.2495000 44

    work page doi:10.1109/mcs.2015.2495000 2016