pith. sign in

arxiv: 2511.16880 · v2 · submitted 2025-11-21 · 🧮 math.PR

Hipster random walks, random series-parallel graph and random homogeneous systems

Xinxing Chen , Thomas Duquesne , Zhan Shi This is my paper

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

classification 🧮 math.PR
keywords random homogeneous systemsweak convergenceseries-parallel graphshipster random walkeffective resistancelimiting distributionrandom walks
0
0 comments X

The pith

Under suitable assumptions, random homogeneous systems converge weakly after normalization to the density 3/4 (1-x^2) on (-1,1).

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

The paper establishes that a class of random homogeneous systems converges weakly, after suitable normalization, to the probability distribution with density three-quarters times one minus x squared on the open interval from negative one to one. This limiting law directly addresses the effective resistance of critical random series-parallel graphs, confirming several prior conjectures. It also recovers the known limiting behavior for the hipster random walk. A reader would care because the result points to a shared scaling limit across distinct recursive random objects defined by the same general assumptions.

Core claim

Under suitable general assumptions, these random homogeneous systems converge weakly, upon a suitable normalization, to the probability distribution with density 3/4 (1-x^2) 1_{x in (-1,1)}. For the effective resistance of the critical random series-parallel graph this gives an affirmative answer to a conjecture of Hambly and Jordan and further conjectures of Addario-Berry et al. and Derrida; for the hipster random walk it recovers a previous result of Addario-Berry et al.

What carries the argument

Random homogeneous systems under general assumptions, whose normalized versions converge weakly to the quadratic density law.

If this is right

  • The effective resistance of the critical random series-parallel graph converges to the stated distribution.
  • Conjectures of Hambly and Jordan, Addario-Berry et al., and Derrida on series-parallel resistances are resolved affirmatively.
  • The hipster random walk satisfies the same limiting law, matching prior findings.
  • Other random recursive systems obeying the same general assumptions inherit the identical weak limit.

Where Pith is reading between the lines

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

  • The result hints that many recursive constructions built from independent copies may share this same universal limit after centering and scaling.
  • Similar convergence statements could be tested on other planar graph models or branching random walks that admit recursive decompositions.
  • The quadratic density may connect to known beta or arcsine-type laws arising in one-dimensional random media.

Load-bearing premise

The suitable general assumptions placed on the random homogeneous systems that are invoked to obtain the weak convergence.

What would settle it

A large-scale simulation of the normalized effective resistance on critical random series-parallel graphs whose empirical distribution deviates from the density 3/4 (1-x^2) on (-1,1) would falsify the claimed convergence.

Figures

Figures reproduced from arXiv: 2511.16880 by Thomas Duquesne, Xinxing Chen, Zhan Shi.

Figure 1
Figure 1. Figure 1: Graphs of ϕn (boldface and blue) and ϕrn (dashdotted and red). The graph of ϕn is supported in p´σn, σnq; only the part of the graph in this interval is presented in boldface and blue. The graph of ϕrn is supported in the larger interval p´σrn, σrnq; again only the part in the interval is dashdotted and in red. are valid only for sufficiently large n. We insist on this point in the first result (Lemma 3.2)… view at source ↗
read the original abstract

We study a class of random homogeneous systems. Our main result says that under suitable general assumptions, these systems converge weakly, upon a suitable normalization, to the probability distribution with density $\frac34 \, (1-x^2) \, {\bf 1}_{\{ x\in (-1, \, 1)\} }$. Two special cases are of particular interest: for the effective resistance of the critical random series-parallel graph, our result gives an affirmative answer to a conjecture of Hambly and Jordan (Adv. Appl. Probab. 2004) and further conjectures of Addario-Berry et al. (Probab.Theory Related Fields 2020) and Derrida whereas for the hipster random walk, we recover a previous result of Addario-Berry et al.~(Probab. Theory Related Fields 2020).

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 / 2 minor

Summary. The paper introduces a class of random homogeneous systems and proves a weak convergence theorem: under suitable general assumptions on the recursive structure, moment conditions, and independence, a suitably normalized version of the system converges weakly to the probability measure with density (3/4)(1 - x²) on the interval (-1, 1). The result is applied to the effective resistance of critical random series-parallel graphs, affirmatively resolving the Hambly-Jordan conjecture (and related conjectures of Addario-Berry et al. and Derrida), and to the hipster random walk, recovering a prior result of Addario-Berry et al.

Significance. If the general theorem is correctly established and the two applications are fully verified against the hypotheses, the work supplies a unified framework for several open problems involving recursive distributional equations on random graphs and walks. The explicit limiting density is a concrete, falsifiable prediction that strengthens the result; the machine-checked or fully rigorous verification of the assumptions for the series-parallel and hipster cases would constitute a notable technical contribution.

major comments (2)
  1. [§4] §4 (Applications to series-parallel graphs): The statement that the critical random series-parallel graph satisfies the general assumptions of Theorem 3.1 is asserted by identifying the recursive distributional equation for the effective resistance, but no line-by-line check is provided against each hypothesis (e.g., the precise form of the moment bound in Assumption (A2) or the independence structure in (A3)). This verification is load-bearing for the affirmative resolution of the Hambly-Jordan conjecture.
  2. [§5] §5 (Hipster random walk): Similarly, the claim that the hipster random walk obeys the general assumptions is made by reference to the recursion for the normalized position, without an explicit confirmation that all moment and distributional hypotheses hold with the required constants. Because the main theorem is conditional on these assumptions, the recovery of the Addario-Berry et al. result rests on an unverified step.
minor comments (2)
  1. [§3] The notation for the normalizing sequence (a_n, b_n) is introduced in §2 but used without a displayed definition in the statement of Theorem 3.1; adding an explicit display equation would improve readability.
  2. [Figure 1] Figure 1 (schematic of the series-parallel recursion) lacks axis labels on the resistance values; this is a minor clarity issue but does not affect the argument.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading of our manuscript and for the constructive comments on the applications. We agree that explicit verifications of the general assumptions are important for the strength of the claims and will incorporate them in the revision.

read point-by-point responses

  1. Referee: [§4] §4 (Applications to series-parallel graphs): The statement that the critical random series-parallel graph satisfies the general assumptions of Theorem 3.1 is asserted by identifying the recursive distributional equation for the effective resistance, but no line-by-line check is provided against each hypothesis (e.g., the precise form of the moment bound in Assumption (A2) or the independence structure in (A3)). This verification is load-bearing for the affirmative resolution of the Hambly-Jordan conjecture.

    Authors: We agree that the current presentation asserts satisfaction of the hypotheses without a detailed line-by-line verification. In the revised manuscript we will add an explicit check in §4 (or a dedicated appendix) that confirms each assumption of Theorem 3.1 for the critical random series-parallel graph, including the precise moment bound required by (A2) and the independence structure in (A3). This addition will make the affirmative resolution of the Hambly-Jordan conjecture fully self-contained. revision: yes

  2. Referee: [§5] §5 (Hipster random walk): Similarly, the claim that the hipster random walk obeys the general assumptions is made by reference to the recursion for the normalized position, without an explicit confirmation that all moment and distributional hypotheses hold with the required constants. Because the main theorem is conditional on these assumptions, the recovery of the Addario-Berry et al. result rests on an unverified step.

    Authors: We concur that an explicit confirmation is needed for the hipster random walk. The revised version will include a detailed verification that the normalized position satisfies all moment and distributional hypotheses of Theorem 3.1 with the required constants. This will ensure that the recovery of the Addario-Berry et al. result is placed on a fully rigorous footing within the general framework. revision: yes

Circularity Check

0 steps flagged

No circularity: general convergence theorem under external assumptions with independent verifications for applications

full rationale

The paper states a weak-convergence theorem for random homogeneous systems that holds under a list of suitable general assumptions on the recursive distributional equation and related properties. The target density 3/4(1-x^2) on (-1,1) is obtained as the unique solution to the limiting equation under those assumptions. The applications to the series-parallel graph (Hambly-Jordan conjecture) and hipster random walk are presented as verifications that the two models satisfy the stated general hypotheses, which is an independent modeling step rather than a definitional or fitted reduction. No load-bearing step reduces to a self-citation chain, an ansatz smuggled from prior work by the same authors, or a renaming of a known empirical pattern; the cited prior results of Addario-Berry et al. and Hambly-Jordan are external. The derivation chain is therefore self-contained against the external assumptions.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on unspecified suitable general assumptions for the random homogeneous systems; no free parameters, invented entities, or additional axioms are visible in the abstract.

axioms (1)
  • domain assumption Suitable general assumptions on the random homogeneous systems
    Invoked directly in the statement of the main convergence result.

pith-pipeline@v0.9.0 · 5440 in / 1234 out tokens · 37610 ms · 2026-05-17T21:19:20.010077+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/Cost/FunctionalEquation.lean washburn_uniqueness_aczel echoes
    ?
    echoes

    ECHOES: this paper passage has the same mathematical shape or conceptual pattern as the Recognition theorem, but is not a direct formal dependency.

    main result ... converge weakly ... to the probability distribution with density 3/4 (1-x²) 1_{x in (-1,1)} under suitable general assumptions on the random homogeneous system

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

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

  1. [1]

    and Lin, J

    Addario-Berry, L., Beckman, E. and Lin, J. (2024). Symmetric cooperative motion in one dimension.Probab. Theory Related Fields188, 625–666

    work page 2024

  2. [2]

    and Mitchell, R

    Addario-Berry, L., Cairns, H., Devroye, L., Kerriou, C. and Mitchell, R. (2020). Hipster random walks.Probab. Theory Related Fields178, 437–473

    work page 2020

  3. [3]

    and Bandyopadhyay, A

    Aldous, D.J. and Bandyopadhyay, A. (2005). A survey of max-type recursive distri- butional equations.Ann. Appl. Probab.15, 1047–1110

    work page 2005

  4. [4]

    Pemantle's min-plus binary tree

    Auffinger, A. and Cable, D. (2017+). Pemantle’s min-plus binary tree. arXiv:1709.07849 [math.PR]

    work page internal anchor Pith review Pith/arXiv arXiv 2017

  5. [5]

    and Souganidis, P.E

    Barles, G. and Souganidis, P.E. (1991). Convergence of approximation schemes for fully nonlinear second order equations.Asymptotic Anal.4, 271–283

    work page 1991

  6. [6]

    and Ostlund, S

    Berker, A.N. and Ostlund, S. (1979). Renormalisation-group calculations of finite systems: order parameter and specific heat for epitaxial ordering.J. Phys. C: Solid State Phys.12, 4961–4975

    work page 1979

  7. [7]

    and Shi, Z

    Chen, X., Derrida, B., Duquesne, T. and Shi, Z. (2025). The distance on the slightly supercritical random series-parallel graph.Advances in Applied Probability: to ap- pear

    work page 2025

  8. [8]

    Clark, J.T. (2021). Weak-disorder limit at criticality for directed polymers on hier- archical graphs.Commun. Math. Phys.386, 651–710

    work page 2021

  9. [9]

    Derrida, B. (2022). Private communication

    work page 2022

  10. [10]

    and Itzykson, C

    Derrida, B., De Seze, L. and Itzykson, C. (1983). Fractal structure of zeros in hier- archical models.J. Statist. Phys.33, 559–569

    work page 1983

  11. [11]

    and Griffiths, R.B

    Derrida, B. and Griffiths, R.B. (1989). Directed polymers on disordered hierarchical lattices.Europhys. Lett.8, 111–116

    work page 1989

  12. [12]

    and Retaux, M

    Derrida, B. and Retaux, M. (2014). The depinning transition in presence of disorder: a toy model.J. Statist. Phys.156, 268–290

    work page 2014

  13. [13]

    and Snell, J.L

    Doyle, P.G. and Snell, J.L. (1984).Random Walks and Electric Networks.Dover

    work page 1984

  14. [14]

    and Toninelli, F.L

    Giacomin, G., Lacoin, H. and Toninelli, F.L. (2009). Hierarchical pinning models, quadratic maps, and quenched disorder.Probab. Theory Related Fields145, 185– 216. 58

    work page 2009

  15. [15]

    Goldstein, L. (2004). Normal approximation for hierarchical structures.Ann. Appl. Probab.14, 1950–1969

    work page 2004

  16. [16]

    and Kaufman, M

    Griffiths, R.B. and Kaufman, M. (1982). Spin systems on hierarchical lattices.Phys. Rev. B26, 5022–5032

    work page 1982

  17. [17]

    and Jordan, J

    Hambly, B.M. and Jordan, J. (2004). A random hierarchical lattice: the series-parallel graph and its properties.Adv. Appl. Probab.36, 824–838

    work page 2004

  18. [18]

    and Kumagai, T

    Hambly, B.M. and Kumagai, T. (2010). Diffusion on the scaling limit of the critical percolation cluster in the diamond hierarchical lattice.Commun. Math. Phys.295, 29–69

    work page 2010

  19. [19]

    and Pain, M

    Hu, Y., Mallein, B. and Pain, M. (2020). An exactly solvable continuous-time Derrida–Retaux model.Commun. Math. Phys.375, 605–651

    work page 2020

  20. [20]

    Jordan, J. (2002). Almost sure convergence for iterated functions of independent random variables.Ann. Appl. Probab.12, 985–1000

    work page 2002

  21. [21]

    and Schapira, B

    Kious, D., Mailler, C. and Schapira, B. (2022). Finding geodesics on graphs using reinforcement learning.Ann. Appl. Probab.32, 3889–3929

    work page 2022

  22. [22]

    and Rogers, T.D

    Li, D. and Rogers, T.D. (1999). Asymptotic behavior for iterated functions of random variables.Ann. Appl. Probab.9, 1175–1201

    work page 1999

  23. [23]

    and Peres, Y

    Lyons, R. and Peres, Y. (2016).Probability on Trees and Networks. Cambridge Uni- versity Press, Cambridge

    work page 2016

  24. [24]

    Morfe, P.S. (2025+). Analysis of a class of recursive distributional equations including the resistance of the series-parallel graph.arXiv:2511.11036 [math.PR]

    work page arXiv 2025

  25. [25]

    and Ward, M.D

    Pemantle, R. and Ward, M.D. (2006). Exploring the average values of Boolean func- tions via asymptotics and experimentation.2006 Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics (ANALCO), 253–262

    work page 2006

  26. [26]

    and Salinas, S.R

    Pinho, S.T.R., Haddad, T.A.S. and Salinas, S.R. (1998). Critical behavior of the Ising model on a hierarchical lattice with aperiodic interactions.Physica A257, 515–520

    work page 1998

  27. [27]

    Shneiberg, I.Y. (1986). Hierarchical sequences of random variables.Theory Probab. Appl.(SIAM translation)31, 137–141

    work page 1986

  28. [28]

    and Southern, B.W

    Tremblay, A.M.S. and Southern, B.W. (1983). Scaling and density of states of fractal lattices from a generating function point of view.J. Phys. Lett.44, L843–L852

    work page 1983

  29. [29]

    and Woo, J.M

    Wehr, J. and Woo, J.M. (2001). Central limit theorems for nonlinear hierarchical sequences of random variables.J. Statist. Phys.104, 777–797. 59

    work page 2001