On the public citation graph
The Horton–Strahler number of conditioned Galton–Watson trees
0 signed · 36 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/rsa.21072openalex-snapshot
Root estimation in Galton–Watson trees
inferredcites →https://doi.org/10.1007/978-3-0348-7915-6_21openalex-snapshot
New Strahler Numbers for Rooted Plane Trees
inferredcites →https://doi.org/10.1007/978-3-642-65809-9openalex-snapshot
Sums of Independent Random Variables
inferredcites →https://doi.org/10.1007/bf00289094openalex-snapshot
The average number of registers needed to evaluate a binary tree optimally
inferredcites →https://doi.org/10.1016/0020-0190(94)00135-9openalex-snapshot
A note on the Horton-Strahler number for random trees
inferredcites →https://doi.org/10.1016/0020-0190(95)00114-ropenalex-snapshot
A note on the Horton-Strahler number for random trees
inferredcites →https://doi.org/10.1016/0022-0000(82)90004-6openalex-snapshot
The average height of binary trees and other simple trees
inferredcites →https://doi.org/10.1016/0304-3975(79)90009-4openalex-snapshot
The number of registers required for evaluating arithmetic expressions
inferredcites →https://doi.org/10.1016/s0167-5060(08)70860-4openalex-snapshot
On Horton's Law for Random Channel Networks
inferredcites →https://doi.org/10.1017/9781316672815openalex-snapshot
Probability on Trees and Networks
inferredcites →https://doi.org/10.1017/s0021900200026711openalex-snapshot
The total progeny in a branching process and a related random walk
inferredcites →https://doi.org/10.1017/s0021900200048750openalex-snapshot
The Galton-Watson process conditioned on the total progeny
inferredcites →https://doi.org/10.1029/91wr03033openalex-snapshot
Power law distributions of discharge mass and energy in river basins
inferredcites →https://doi.org/10.1063/1.882305openalex-snapshot
Fractal River Basins: Chance and Self-Organization
inferredcites →https://doi.org/10.1088/0305-4470/27/2/014openalex-snapshot
Horton-Strahler ordering of random binary trees
inferredcites →https://doi.org/10.1130/0016-7606(1945)56[275:edosat]2.0.co;2openalex-snapshot
EROSIONAL DEVELOPMENT OF STREAMS AND THEIR DRAINAGE BASINS; HYDROPHYSICAL APPROACH TO QUANTITATIVE MORPHOLOGY
inferredcites →https://doi.org/10.1130/0016-7606(1952)63[1117:haaoet]2.0.co;2openalex-snapshot
HYPSOMETRIC (AREA-ALTITUDE) ANALYSIS OF EROSIONAL TOPOGRAPHY
inferredcites →https://doi.org/10.1137/0215046openalex-snapshot
Register Allocation for Unary–Binary Trees
inferredcites →https://doi.org/10.1137/0404050openalex-snapshot
A Large Deviation Rate and Central Limit Theorem for Horton Ratios
inferredcites →https://doi.org/10.1137/0601005openalex-snapshot
On the Order of Random Channel Networks
inferredcites →https://doi.org/10.1137/1111059openalex-snapshot
The Galton-Watson Process with Mean One and Finite Variance
inferredcites →https://doi.org/10.1145/1159892.1159894openalex-snapshot
The register function for t -ary trees
inferredcites →https://doi.org/10.1145/368892.368907openalex-snapshot
On programming of arithmetic operations
inferredcites →https://doi.org/10.1214/11-ps188openalex-snapshot
Simply generated trees, conditioned Galton–Watson trees, random allocations and condensation
inferredcites →https://doi.org/10.1214/17-aihp879openalex-snapshot
Local limits of large Galton–Watson trees rerooted at a random vertex
inferredcites →https://doi.org/10.1214/19-ps331openalex-snapshot
Random self-similar trees: A mathematical theory of Horton laws
inferredcites →https://doi.org/10.1214/aoms/1177731235openalex-snapshot
On Cumulative Sums of Random Variables
inferredcites →https://doi.org/10.2307/3318630openalex-snapshot
A Self-Similar Invariance of Critical Binary Galton-Watson Trees
inferredcites →https://doi.org/10.30757/alea.v14-29openalex-snapshot
A study of large fringe and non-fringe subtrees in conditional Galton-Watson trees
inferredcites →https://doi.org/10.4153/cjm-1978-085-0openalex-snapshot
On the Altitude of Nodes in Random Trees
inferredcites →https://doi.org/10.48550/arxiv.1101.3656openalex-snapshot
On the Height Profile of a Conditioned Galton-Watson Tree
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1112/plms.70086openalex-snapshot
Thick points of 4D critical branching Brownian motion
inferred← citeshttps://doi.org/10.1214/25-aap2204openalex-snapshot
The Horton–Strahler number of Galton–Watson trees with possibly infinite variance
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.