Pith. sign in

REVIEW 3 major objections 4 minor 1 cited by

Evolution of Conditional Entropy for Diffusion Dynamics on Graphs

T0 review · 3 major / 4 minor · reviewed 2026-08-04 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Heat diffusion on any connected graph makes conditional entropy grow monotonically over time.

desk verdict Theorem 3.4 is correct but is really just the data-processing inequality in disguise; the new material is the explicit finite-time formulas and the mean-field approximation, while the claimed path/complete bounds are unproven and the thermodynamic rhetoric overreaches. read the letter →

arxiv 2510.19441 v2 pith:6NCL64NY submitted 2025-10-22 math.DS cs.ITmath.ITmath.PRphysics.data-an

Samuel Koovely , Alexandre Bovet This is my paper · ORCID
classification math.DScs.ITmath.ITmath.PRphysics.data-an MSC 05C8260J2794A17
keywords conditionalentropyheatdiffusiongraphLaplaciancontinuous-timeMarkovchainsecondlawofthermodynamicsmixingtimerandomgraphsspectraltheory
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

This paper introduces conditional entropy as a measure of heat diffusion on graphs and proves that, for any connected undirected graph and any starting distribution, this quantity never decreases over time. That monotonicity mirrors the second law of thermodynamics, giving a physical intuition for how information spreads on networks. The authors derive exact entropy formulas for complete, path, and circulant graphs, an asymptotic limit of log(N) for all connected non-bipartite graphs, and a mean-field approximation for Erdős–Rényi graphs. The work offers a new lens for comparing graph structures: the entropy curve rises faster for denser or shorter-diameter graphs, and the complete and path graphs serve as practical (though not fully proven) upper and lower reference curves.

What carries the argument

The central object is the conditional entropy H(Z(t)|Z(0)) of the heat-diffusion continuous-time Markov chain, defined as the average over initial nodes of the Shannon entropy of each row of the transition matrix e^{-Lt}, where L is the combinatorial graph Laplacian. The key identity connecting entropy to the second law is H_i(t|0) = log(N) - D_KL(T_{i,:}(0,t) || π), with π the uniform stationary distribution; the data-processing inequality for KL divergence then forces each row entropy to increase. Exact formulas rely on the spectral decomposition of L: the graph Fourier transform for circulant graphs, the discrete cosine transform for path graphs, and a simple projection for complete graph

What would settle it

Numerically compute the conditional entropy curve for a small connected graph, e.g., a path or a random 3-regular graph, starting from a single node and using a fine time grid; any time interval where the curve dips would disprove Theorem 3.4. The theorem predicts monotonic increase, so a single observed decrease is a concrete counterexample.

Watch

Extended reading notes

Core claim

The central claim is Theorem 3.4: for the heat-diffusion Markov chain on a connected graph, conditional entropy H(Z(t2)|Z(0)) is always at least H(Z(t1)|Z(0)) whenever t1 ≤ t2, regardless of the initial distribution. The proof shows row by row that the KL divergence from each row of the transition matrix to the uniform stationary distribution decreases over time, and because heat diffusion has a uniform stationary distribution, each row's entropy equals log(N) minus that KL divergence. This yields a clean information-theoretic 'second law' and justifies using conditional entropy curves as a fingerprint of network structure, with complete graphs diffusing fastest and path graphs slowest.

Load-bearing premise

The proof that conditional entropy never decreases relies on heat diffusion having a uniform stationary distribution on the graph, so that each row's entropy is exactly log(N) minus its KL divergence to uniformity; if the diffusion were not symmetric in this way, the monotonicity can fail.

Editorial extensions

If this is right

  • Conditional entropy curves can be used to compare the mixing speed of different graphs of the same size, with denser and smaller-diameter graphs reaching the asymptotic log(N) limit faster.
  • The mean-field approximation for Erdős–Rényi graphs gives a closed-form entropy curve that becomes more accurate for larger and denser graphs, enabling fast estimates without simulation.
  • For disconnected graphs, the asymptotic conditional entropy is a weighted sum of log(component sizes), extending the formalism beyond the connected case.
  • The monotonicity result suggests that conditional entropy could serve as a robust statistical observable for detecting structural changes in temporal or multilayer networks.
  • Because the monotonicity holds for any initial condition, entropy-based methods need not assume stationarity of the starting distribution.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Editorial inference: the row-wise KL-divergence proof suggests the monotonicity is tied to the symmetry of the Laplacian (uniform stationary distribution); a directed or non-reversible diffusion would likely violate the second law, as the paper's own counterexample for general chains indicates.
  • Editorial inference: if the heuristic path–complete bounding is ever proven, it would imply that entropy curves are ordered by graph connectivity in a majorization sense, potentially linking conditional entropy to graph spectra beyond the asymptotic regime.
  • Editorial inference: the mean-field approximation for ER graphs could be extended to other random graph ensembles with known degree distributions, such as configuration models, by replacing the uniform mean-field Laplacian with a degree-corrected version.
  • Editorial inference: the monotonicity theorem may hold for any reversible Markov chain whose stationary distribution is uniform, which includes random walks on regular graphs; testing this on non-regular reversible chains could delineate the exact scope of the thermodynamic analogy.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. This paper studies the conditional entropy H(Z(t)|Z(0)) of the continuous-time heat-diffusion Markov chain on an undirected graph, i.e., the process with generator -L where L is the combinatorial Laplacian. The main theoretical claim is Theorem 3.4: for any initial distribution and any t1 <= t2, H(Z(t2)|Z(0)) >= H(Z(t1)|Z(0)). The proof uses the data-processing inequality for KL divergence row-wise and the fact that the uniform distribution is stationary. The paper also derives exact spectral formulas for complete graphs (Cor. 3.8), path graphs (Prop. 3.9), and circulant graphs (Props. 3.10--3.11); asymptotic limits (Props. 3.14--3.15); mixing-time estimates (Prop. 3.16); spectral interlacing bounds (Prop. 3.17, 3.19); a Pinsker-type inequality (Prop. 3.20); and a mean-field approximation for Erdős-Rényi graphs (Sect. 3.6). Simulations on Watts-Strogatz and ER graphs illustrate the behavior and compare against circulant references.

Significance. The monotonicity result, Theorem 3.4, is a clean and nontrivial information-theoretic statement: it extends the usual second-law analogy for Markov chains from stationary initial conditions to arbitrary initial conditions in the special case of heat diffusion on graphs. The proof is parameter-free and does not rely on any fitted constants. The exact formulas for complete, path, and circulant graphs are useful for fast computation, and the mean-field approximation for ER graphs is a reasonable engineering tool. If the pointwise bounding claims were properly justified or clearly labeled as conjectural, the paper would be a solid contribution to entropy-based network analysis. The paper is honest in labeling the bounds as heuristic in the introduction, but the figure caption and some abstract-level claims overstate them.

major comments (3)
  1. [§3.4 and Fig. 2] The pointwise bounding claim—that the conditional entropy curve of every graph lies between the path-graph curve from below and the complete-graph curve from above—is asserted in Fig. 2's caption ('The entropy curves are bounded from below by the path graph curve and above by the complete graph curve') and used to interpret the simulations. However, the paper only proves eigenvalue interlacing (Prop. 3.17) and minimal algebraic connectivity of the path (Prop. 3.19). These spectral inequalities do not imply a pointwise ordering of H(t), because H(t) is a nonlinear function of the full spectrum and the eigenvectors; a graph with a slightly larger spectral gap but different prefactors could in principle cross the path or complete curve at finite times. The introduction itself concedes these are 'heuristically established' bounds. Please either prove the pointwise ordering under stated condi
  2. [§3.3, Eq. (3.52)] In the mixing-time discussion, Eq. (3.52) writes 'lim_{t→∞} π^T - p(t)^T ≈ e^{-λ2 t} ...', and Prop. 3.16's proof uses an equality 'lim ||π - p(t)||_p = lim || e^{-λ2 t} ... ||_p'. Strictly, the omitted faster-decaying terms cannot be dropped inside the limit before taking the norm. The final conclusion that both limits are 0 is correct, but the presentation confuses an asymptotic equivalence with an equality. Please rewrite Eq. (3.52) and the proof of Prop. 3.16 using standard asymptotic notation (e.g., 'as t → ∞, π^T - p(t)^T = e^{-λ2 t} p(0)^T v^{(2)} v^{(2)T} + O(e^{-λ3 t})').
  3. [Appendix A, derivation of Cor. 3.8] In the computation for the complete graph, the second line contains a typo: the coefficient of the e^{-Nt} term in the second entropy contribution is written as (1/N + (N-1)/N)e^{-Nt}, whereas the correct expression is (1/N + (N-1)/N e^{-Nt}). This is presumably a typesetting slip, since the final formula (3.23) is correct, but the intermediate line is confusing and should be fixed.
minor comments (4)
  1. [Prop. 3.14] The statement assumes a connected non-bipartite graph, but for heat diffusion with generator -L the transition semigroup e^{-Lt} is continuous-time and converges to the uniform distribution for every connected graph, including bipartite ones. The non-bipartite assumption is unnecessary in this context and may mislead readers.
  2. [Proof of Theorem 3.4] The proof writes 't1 > 0' when applying the data-processing inequality. The statement covers t1 = 0 as well; this case is trivial because H(Z(0)|Z(0)) = 0. Please mention this explicitly.
  3. [Prop. 3.20] The inequality is stated for every p ≥ 1, but the proof uses Pinsker's inequality in l1 and then the monotonicity of l_p norms. This is correct, but the phrase 'for every p ≥ 1' should appear in the proof to avoid the impression that Pinsker itself holds for arbitrary l_p norms.
  4. [Fig. 3 and Sect. 3.5] The text refers to 'Section 3.5 (A)' and 'Section 3.5 (B)' when meaning the panels of Fig. 3. Please use 'Fig. 3(A)' and 'Fig. 3(B)' for clarity.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: Theorem 3.4 is derived from the standard data-processing inequality, not assumed; the heuristic bounds are an unproven gap, not a circular step.

full rationale

The load-bearing claim, Theorem 3.4, is derived rather than presupposed. Its proof uses the chain rule for KL divergence to obtain the data-processing inequality (Eqs. 3.9-3.11), then applies it to each row of the heat-diffusion transition matrix. Because the uniform distribution π is stationary for heat diffusion on a connected graph (Eq. 2.8), DPI gives D_KL(T_{i,:}(0,t+τ)||π) ≤ D_KL(T_{i,:}(0,t)||π), and the identity H_i(t) = log N − D_KL(T_{i,:}(0,t)||π), stated in the proof of Theorem 3.4, converts this into H_i(t+τ) ≥ H_i(t). Averaging over the initial distribution preserves monotonicity. No fitted parameter is renamed as a prediction: the complete, path, and circulant formulas are obtained from explicit spectral eigendecompositions, and the ER mean-field uses the assumed ensemble Laplacian ⟨L⟩ = p(NI−J), not a fit to the entropy curves. The pointwise bounding claim in Figures 2-3 is indeed only heuristic—the introduction says bounds are 'heuristically established' and Section 3.4 proves only eigenvalue interlacing and asymptotic limits—but that is an unproven or overclaimed statement, not a circular derivation, since the bound is not an input used to prove itself. The self-citations present (e.g., [3] on flow stability) are contextual and not load-bearing. Therefore no circular step meeting the quoted-evidence standard was found.

Assumptions & free parameters 0 free parameters · 6 assumptions · 0 invented entities

The central theorem uses standard information-theoretic results (DPI, chain rule, Pinsker) and the ergodicity of connected heat diffusion. The only modeling choice beyond established theory is the mean-field Laplacian ⟨L⟩=p(NI−J) for ER graphs. No constants are fitted to data.

assumptions (6)
  • standard math Chain rule for KL divergence and Pinsker inequality (Cover–Thomas / Csiszár–Körner).
    Invoked in Theorem 3.4 proof and Proposition 3.20; these are standard results cited from [6] and [7].
  • standard math Data-processing inequality for KL divergence under Markov evolution.
    Central to the proof that each row of the heat transition matrix approaches the uniform distribution monotonically in KL divergence.
  • domain assumption Connected undirected graph heat diffusion is ergodic with uniform stationary distribution.
    This is the structural fact that makes H_i = log N - D_KL(T_i,: || pi) and hence row-entropy monotonicity hold; it is true for the combinatorial Laplacian but is assumed in Theorem 3.4.
  • standard math Known spectral decompositions of the Laplacian on complete, path, and circulant graphs.
    Used in Section 3.2 to derive exact transition matrices and entropy formulas.
  • ad hoc to paper Mean-field Laplacian for ER graphs is L_meanfield = p(N I - J).
    Section 3.6 models each node with the expected degree pN, ignoring degree fluctuations; this is an approximation introduced for this paper, not a theorem.
  • standard math Weyl eigenvalue interlacing and Fiedler's theorem on algebraic connectivity.
    Used in Section 3.4 to prove eigenvalue ordering and path-graph minimal algebraic connectivity.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Evolution of Conditional Entropy for Diffusion Dynamics on Graphs." pith.science (2026). https://pith.science/paper/6NCL64NY

@misc{pith2026251019441,
  author       = {Pith},
  title        = {Pith review of: Evolution of Conditional Entropy for Diffusion Dynamics on Graphs},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/6NCL64NY}},
  note         = {Machine review of arXiv:2510.19441}
}
read the original abstract

The modeling of diffusion processes on graphs is the basis for many network science and machine learning approaches. Entropic measures of network-based diffusion have recently been employed to investigate the reversibility of these processes and the diversity of the modeled systems. While results about their steady state are well-known, very few exact results about their finite-time evolution exist. Here, we introduce the conditional entropy of heat diffusion in graphs, and outline a mathematical framework that contextualizes diffusion and conditional entropy within the theories of continuous-time Markov chains and information theory. In particular, we highlight that this entropic measure satisfies an information-theoretical version of the second law of thermodynamics, thereby providing a parallelism between diffusion dynamics on networks and their physical counterparts. Furthermore, we obtain explicit results for its evolution on complete, path, and circulant graphs, as well as a mean-field approximation for Erd\"os-R\'enyi graphs. We also obtain asymptotic results for general networks and provide bounds for the evolution of conditional entropy. Finally, we experimentally demonstrate several properties of conditional entropy for diffusion over random graphs, such as the Watts-Strogatz model.

Figures

Figures reproduced from arXiv: 2510.19441 by the authors.

Figure 1
Figure 1. Heat diffusion on a path graph with 10 nodes with initial condition [PITH_FULL_IMAGE:figures/full_fig_p005_1.png] view at source ↗
Figure 2
Figure 2. Conditional entropy for heat diffusion on a complete graph, path graph, and circulant graphs with different [PITH_FULL_IMAGE:figures/full_fig_p011_2.png] view at source ↗
Figure 3
Figure 3. Comparison of Watts-Strogatz and ER graphs with circulant matrices sharing similar structural properties. [PITH_FULL_IMAGE:figures/full_fig_p015_3.png] view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: Evolution of the conditional entropy over samples of 5 ER graphs (dotted lines) with three different density [PITH_FULL_IMAGE:figures/full_fig_p016_4.png]

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Conditional Entropy of Heat Diffusion on Temporal Networks

    cs.SI 2026-05 unverdicted novelty 7.0 of 10

    On temporal networks, the conditional entropy of heat diffusion is monotone in time, and its local-window version gives a signal that detects structural and activity change points.

Reference graph

Works this paper leans on

42 extracted references · 1 linked inside Pith · cited by 1 Pith paper

  1. [1]

    AHMED, T

    N. AHMED, T. NATARAJAN,ANDK. RAO,Discrete Cosine Transform, IEEE Transactions on Computers, C-23 (1974), pp. 90–93

    1974

  2. [2]

    W. N. ANDERSON ANDT. D. MORLEY,Eigenvalues of the Laplacian of a graph, Tech. Rep. NASA-CR-125547, University of Maryland, Oct. 1971. NTRS Author Affiliations: Maryland Univ. NTRS Document ID: 19720008812 NTRS Research Center: Legacy CDMS (CDMS)

    1971

  3. [3]

    BOVET, J.-C

    A. BOVET, J.-C. DELVENNE,ANDR. LAMBIOTTE,Flow stability for dynamic community detection, Science Advances, 8 (2022), p. eabj3063. _eprint: https://www.science.org/doi/pdf/10.1126/sciadv.abj3063

    doi:10.1126/sciadv.abj3063 2022

  4. [4]

    CARLETTI,Random walks on hypergraphs, Physical Review E, 101 (2020)

    T. CARLETTI,Random walks on hypergraphs, Physical Review E, 101 (2020)

    2020

  5. [5]

    F. R. CHUNG,Spectral graph theory, vol. 92, American Mathematical Soc., 1997

    1997

  6. [6]

    T. M. COVER ANDJ. A. THOMAS,ELEMENTS OF INFORMATION THEORY, Wiley-Interscience, 2006

    2006

  7. [7]

    CSISZÁR ANDJ

    I. CSISZÁR ANDJ. KÖRNER,Information Theory: Coding Theorems for Discrete Memoryless Systems, Cambridge University Press, Cambridge, 2 ed., 2011

    2011

  8. [8]

    DAVIS,Circulant Matrices by Philip J

    P. DAVIS,Circulant Matrices by Philip J. Davis, Chelsea Publishing Series, Chelsea, 1994

    1994

Show all 42 references
  1. [9]

    DEDOMENICO ANDJ

    M. DEDOMENICO ANDJ. BIAMONTE,Spectral Entropies as Information-Theoretic Tools for Complex Network Comparison, Phys. Rev. X, 6 (2016), p. 041062. Publisher: American Physical Society

    2016

  2. [10]

    DELVENNE, S

    J.-C. DELVENNE, S. N. YALIRAKI,ANDM. BARAHONA,Stability of graph communities across time scales, Proceedings of the National Academy of Sciences, 107 (2010), pp. 12755–12760. _eprint: https://www.pnas.org/doi/pdf/10.1073/pnas.0903215107

    2010 doi

  3. [11]

    DURRETT,Dynamics on Graphs, Cambridge Series in Statistical and Probabilistic Mathematics, Cambridge University Press, 2025

    R. DURRETT,Dynamics on Graphs, Cambridge Series in Statistical and Probabilistic Mathematics, Cambridge University Press, 2025

    2025

  4. [12]

    FIEDLER,Algebraic connectivity of graphs, Czechoslovak Mathematical Journal, 23 (1973), pp

    M. FIEDLER,Algebraic connectivity of graphs, Czechoslovak Mathematical Journal, 23 (1973), pp. 298–305

    1973

  5. [13]

    GHAVASIEH, C

    A. GHAVASIEH, C. NICOLINI,ANDM. DEDOMENICO,Statistical physics of complex information dynamics, Physical Review E, 102 (2020), p. 052304

    2020

  6. [14]

    GÓMEZ-GARDEÑES ANDV

    J. GÓMEZ-GARDEÑES ANDV. LATORA,Entropy rate of diffusion processes on complex networks, Phys. Rev. E, 78 (2008), p. 065102. Publisher: American Physical Society

    2008

  7. [15]

    J. J. HALLIWELL, J. PÉREZ-MERCADER,ANDW. H. ZUREK,Physical origins of time asymmetry, Cambridge University Press, 1996

    1996

  8. [16]

    HELMKE ANDJ

    U. HELMKE ANDJ. ROSENTHAL,Eigenvalue inequalities and Schubert calculus, Mathematische Nachrichten, 171 (1995), pp. 207–225. ISBN: 0025-584X Publisher: Wiley Online Library

    1995

  9. [17]

    LAMBIOTTE, J.-C

    R. LAMBIOTTE, J.-C. DELVENNE,ANDM. BARAHONA,Random Walks, Markov Processes and the Multiscale Modular Organization of Complex Networks, IEEE Transactions on Network Science and Engineering, 1 (2014), pp. 76–90. Conference Name: IEEE Transactions on Network Science and Engineering

    2014

  10. [18]

    LAMBIOTTE ANDM

    R. LAMBIOTTE ANDM. T. SCHAUB,Modularity and dynamics on complex networks, Cambridge University Press, 2021

    2021

  11. [19]

    LANCHIER,Stochastic Modeling, Universitext, Springer International Publishing, Cham, 2017

    N. LANCHIER,Stochastic Modeling, Universitext, Springer International Publishing, Cham, 2017

    2017

  12. [20]

    LATORA ANDM

    V. LATORA ANDM. BARANGER,Kolmogorov-Sinai Entropy Rate versus Physical Entropy, Phys. Rev. Lett., 82 (1999), pp. 520–523. Publisher: American Physical Society

    1999

  13. [21]

    D. A. LEVIN ANDY. PERES,Markov chains and mixing times, vol. 107, American Mathematical Soc., 2017

    2017

  14. [22]

    MASUDA, M

    N. MASUDA, M. A. PORTER,ANDR. LAMBIOTTE,Random walks and diffusion on networks, Random walks and diffusion on networks, 716-717 (2017), pp. 1–58. 19 EVOLUTION OFCONDITIONALENTROPY FORDIFFUSIONDYNAMICS ONGRAPHS

    2017

  15. [23]

    NARTALLO-KALUARACHCHI, M

    R. NARTALLO-KALUARACHCHI, M. ASLLANI, G. DECO, M. L. KRINGELBACH, A. GORIELY,ANDR. LAM- BIOTTE,Broken detailed balance and entropy production in directed networks, Physical Review E, 110 (2024), p. 034313

    2024

  16. [24]

    NEWMAN,Networks, Oxford university press, 2018

    M. NEWMAN,Networks, Oxford university press, 2018

    2018

  17. [25]

    M. J. NEWMAN,A measure of betweenness centrality based on random walks, Social Networks, 27 (2005), pp. 39–54

    2005

  18. [26]

    ORTEGA, P

    A. ORTEGA, P. FROSSARD, J. KOVA ˇCEVI ´C, J. M. F. MOURA,ANDP. VANDERGHEYNST,Graph Signal Processing: Overview, Challenges, and Applications, Proceedings of the IEEE, 106 (2018), pp. 808–828

    2018

  19. [27]

    PONS ANDM

    P. PONS ANDM. LATAPY,Computing Communities in Large Networks Using Random Walks, Journal of Graph Algorithms and Applications, 10 (2006), pp. 191–218

    2006

  20. [28]

    ROSVALL ANDC

    M. ROSVALL ANDC. T. BERGSTROM,Maps of random walks on complex networks reveal community structure, Proceedings of the National Academy of Sciences, 105 (2008), pp. 1118–1123. Publisher: Proceedings of the National Academy of Sciences

    2008

  21. [29]

    A. RÉNYI,On measures of entropy and information, in Proceedings of the fourth Berkeley symposium on mathematical statistics and probability, volume 1: contributions to the theory of statistics, vol. 4, University of California Press, 1961, pp. 547–562

    1961

  22. [30]

    M. T. SCHAUB, J.-C. DELVENNE, S. N. YALIRAKI,ANDM. BARAHONA,Markov Dynamics as a Zooming Lens for Multiscale Community Detection: Non Clique-Like Communities and the Field-of-View Limit, PLOS ONE, 7 (2012), p. e32210. Publisher: Public Library of Science

    2012

  23. [31]

    SCHNAKENBERG,Network theory of microscopic and macroscopic behavior of master equation systems, Reviews of Modern Physics, 48 (1976), pp

    J. SCHNAKENBERG,Network theory of microscopic and macroscopic behavior of master equation systems, Reviews of Modern Physics, 48 (1976), pp. 571–585

    1976

  24. [32]

    C. E. SHANNON,A mathematical theory of communication, The Bell System Technical Journal, 27 (1948), pp. 379–423

    1948

  25. [33]

    VANMIEGHEM,Graph spectra for complex networks, Cambridge university press, 2023

    P. VANMIEGHEM,Graph spectra for complex networks, Cambridge university press, 2023

    2023

  26. [34]

    T. F. VARLEY,Information Theory for Complex Systems Scientists, Aug. 2024. arXiv:2304.12482

    2024 arXiv

  27. [35]

    VILLEGAS, A

    P. VILLEGAS, A. GABRIELLI, A. POGGIALINI,ANDT. GILI,Multi-scale Laplacian community detection in heterogeneous networks, Physical Review Research, 7 (2025), p. 013065

    2025

  28. [36]

    VILLEGAS, A

    P. VILLEGAS, A. GABRIELLI, F. SANTUCCI, G. CALDARELLI,ANDT. GILI,Laplacian paths in complex networks: Information core emerges from entropic transitions, Phys. Rev. Res., 4 (2022), p. 033196. Publisher: American Physical Society

    2022

  29. [37]

    VILLEGAS, T

    P. VILLEGAS, T. GILI, G. CALDARELLI,ANDA. GABRIELLI,Laplacian renormalization group for heteroge- neous networks, Nature Physics, 19 (2023), pp. 445–450

    2023

  30. [38]

    D. J. WATTS,Small worlds: the dynamics of networks between order and randomness, Princeton university press, 1999

    1999

  31. [39]

    D. J. WATTS ANDS. H. STROGATZ,Collective dynamics of ‘small-world’ networks, Nature, 393 (1998), pp. 440–442. Publisher: Nature Publishing Group

    1998

  32. [40]

    WEHRL,On the relation between classical and quantum-mechanical entropy, Reports on Mathematical Physics, 16 (1979), pp

    A. WEHRL,On the relation between classical and quantum-mechanical entropy, Reports on Mathematical Physics, 16 (1979), pp. 353–358. ISBN: 0034-4877 Publisher: Elsevier

    1979

  33. [41]

    H. WEYL,Das asymptotische Verteilungsgesetz der Eigenwerte linearer partieller Differentialgleichungen (mit einer Anwendung auf die Theorie der Hohlraumstrahlung), Mathematische Annalen, 71 (1912), pp. 441–479

    1912

  34. [42]

    YANG ANDH

    Y.-J. YANG ANDH. QIAN,Unified formalism for entropy production and fluctuation relations, Phys. Rev. E, 101 (2020), p. 022129. Publisher: American Physical Society. 20

    2020

Pith tools

Reviewed August 4, 2026 · model on record in the stance chip above.