On the public citation graph

A diffusion limit for a class of randomly-growing binary trees

0 signed · 91 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4615-8065-2openalex-snapshot
The Theory of Stochastic Processes III
inferredcites →https://doi.org/10.1007/bf00320085openalex-snapshot
Splitting intervals II: Limit laws for lengths
inferredcites →https://doi.org/10.1016/0022-247x(84)90141-0openalex-snapshot
On growing random binary trees
inferredcites →https://doi.org/10.1017/s0001867800014658openalex-snapshot
Discounted branching random walks
inferredcites →https://doi.org/10.1017/s0001867800015603openalex-snapshot
Paths in a random digital tree: limiting distributions
inferredcites →https://doi.org/10.1063/1.3047872openalex-snapshot
The Theory of Stochastic Processes
inferredcites →https://doi.org/10.1090/s0002-9939-1976-0423450-2openalex-snapshot
A Limit Theorem for Measurable Random Processes and Its Applications
inferredcites →https://doi.org/10.1103/physrevb.30.6788openalex-snapshot
Directed diffusion-limited aggregation on the Bethe lattice: Exact results
inferredcites →https://doi.org/10.1109/tit.1977.1055714openalex-snapshot
A universal algorithm for sequential data compression
inferredcites →https://doi.org/10.1109/tit.1978.1055911openalex-snapshot
Coding theorems for individual sequences
inferredcites →https://doi.org/10.1214/aop/1176991417openalex-snapshot
Stopping Times and Tightness. II
inferredcites →https://doi.org/10.1214/aop/1176992456openalex-snapshot
Splitting Intervals
inferredcites →https://doi.org/10.1214/aop/1176993000openalex-snapshot
Asymptotical Growth of a Class of Random Trees
inferredcites →https://doi.org/10.1214/aop/1176993140openalex-snapshot
Oriented Percolation in Two Dimensions
inferredcites →https://doi.org/10.1214/aop/1176995990openalex-snapshot
A Criterion for Tightness for a Sequence of Martingales

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.5281/zenodo.23138275zenodo-depositor-declared
inferred← citeshttps://doi.org/10.5281/zenodo.23146447zenodo-depositor-declared
inferred← citeshttps://doi.org/10.1002/9781118032770.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/rsa.10006openalex-snapshot
Analysis of random LC tries
inferred← citeshttps://doi.org/10.1002/rsa.10022openalex-snapshot
D⋅E⋅K=(1000)8
inferred← citeshttps://doi.org/10.1002/rsa.20979openalex-snapshot
Node profiles of symmetric digital search trees: Concentration properties
inferred← citeshttps://doi.org/10.1002/rsa.3240030209openalex-snapshot
A note on the probabilistic analysis of patricia trees
inferred← citeshttps://doi.org/10.1002/rsa.3240030309openalex-snapshot
Generalized Digital Trees and Their Difference—Differential Equations
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_17openalex-snapshot
Discs and other related data structures
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_74openalex-snapshot
Analytic analysis of algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4612-0719-1_1openalex-snapshot
Probability Distributions on Cladograms
inferred← citeshttps://doi.org/10.1007/978-3-031-33296-8_4openalex-snapshot
Continuous Parameter Jump Markov Processes
inferred← citeshttps://doi.org/10.1007/978-3-319-32253-7_3openalex-snapshot
SCOT-Modeling and Nonparametric Testing of Stationary Strings
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_1openalex-snapshot
Profile of Tries
inferred← citeshttps://doi.org/10.1007/s004400050076openalex-snapshot
Diffusion-limited aggregation on a tree
inferred← citeshttps://doi.org/10.1007/s00453-001-0053-3openalex-snapshot
Average Profile of the Lempel-Ziv Parsing Scheme for a Markovian Source
inferred← citeshttps://doi.org/10.1007/s00453-004-1137-7openalex-snapshot
Universal Asymptotics for Random Tries and PATRICIA Trees
inferred← citeshttps://doi.org/10.1007/s00453-006-0109-5openalex-snapshot
Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees
inferred← citeshttps://doi.org/10.1007/s10955-006-9193-9openalex-snapshot
Phase Transition in a Generalized Eden Growth Model on a Tree
inferred← citeshttps://doi.org/10.1007/s10955-012-0549-zopenalex-snapshot
A Markovian Growth Dynamics on Rooted Binary Trees Evolving According to the Gompertz Curve
inferred← citeshttps://doi.org/10.1007/s10958-014-2181-8openalex-snapshot
Selection of a Metric for the Nearest Neighbor Entropy Estimators
inferred← citeshttps://doi.org/10.1007/s236-002-8034-5openalex-snapshot
The variance of the height of digital search trees
inferred← citeshttps://doi.org/10.1016/0097-3165(90)90072-5openalex-snapshot
How many random questions are necessary to identify n distinct objects?
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00298-wopenalex-snapshot
Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
inferred← citeshttps://doi.org/10.1016/j.jfa.2022.109722openalex-snapshot
Doubly stochastic Yule cascades (Part I): The explosion problem in the time-reversible case
inferred← citeshttps://doi.org/10.1016/j.jmaa.2018.11.064openalex-snapshot
Stochastic explosion and non-uniqueness for α-Riccati equation
inferred← citeshttps://doi.org/10.1016/s0167-2789(03)00047-2openalex-snapshot
Data compression and learning in time sequences analysis
inferred← citeshttps://doi.org/10.1016/s0377-0427(01)00458-7openalex-snapshot
Laws of large numbers and tail inequalities for random tries and PATRICIA trees
inferred← citeshttps://doi.org/10.1017/cbo9780511843204openalex-snapshot
Analytic Pattern Matching
inferred← citeshttps://doi.org/10.1017/s0021900200001340openalex-snapshot
A Central Limit Theorem for Non-Overlapping Return Times
inferred← citeshttps://doi.org/10.1023/a:1022610816550openalex-snapshot
Asymptotic Recurrence and Waiting Times for Stationary Processes
inferred← citeshttps://doi.org/10.1051/ps:2007043openalex-snapshot
Digital search trees and chaos game representation
inferred← citeshttps://doi.org/10.1090/proc/13905openalex-snapshot
A Delayed Yule Process
inferred← citeshttps://doi.org/10.1103/physreve.68.026103openalex-snapshot
Traveling front solutions to directed diffusion-limited aggregation, digital search trees, and the Lempel-Ziv data compression algorithm
inferred← citeshttps://doi.org/10.1109/18.179356openalex-snapshot
Growing binary trees in a random environment
inferred← citeshttps://doi.org/10.1109/18.259648openalex-snapshot
Asymptotic properties of data compression and suffix trees
inferred← citeshttps://doi.org/10.1109/18.370149openalex-snapshot
Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm
inferred← citeshttps://doi.org/10.1109/18.567640openalex-snapshot
Average redundancy rate of the Lempel-Ziv code
inferred← citeshttps://doi.org/10.1109/dcc.1995.515516openalex-snapshot
Generalized Lempel-Ziv parsing scheme and its preliminary analysis of the average profile
inferred← citeshttps://doi.org/10.1109/infcom.1991.147565openalex-snapshot
Growing binary trees in a random environment
inferred← citeshttps://doi.org/10.1109/isit.1995.531116openalex-snapshot
Asymptotic behavior of the Lempel-Ziv parsing scheme and digital trees
inferred← citeshttps://doi.org/10.1109/isit.2011.6033794openalex-snapshot
Limiting distribution of Lempel Ziv'78 redundancy
inferred← citeshttps://doi.org/10.1109/sibircon.2010.5555303openalex-snapshot
Discovery of patterns in LZ-78 text discrimination
inferred← citeshttps://doi.org/10.1109/tit.2014.2358679openalex-snapshot
On the Limiting Distribution of Lempel-Ziv’78 Redundancy for Memoryless Sources
inferred← citeshttps://doi.org/10.1134/s1064562412020251openalex-snapshot
Compression based homogeneity testing
inferred← citeshttps://doi.org/10.1137/070685531openalex-snapshot
Profiles of Tries
inferred← citeshttps://doi.org/10.1137/s0040585x97978087openalex-snapshot
Testing Randomness: A Suite of Statistical Procedures
inferred← citeshttps://doi.org/10.1137/s0097539790189368openalex-snapshot
Digital Search Trees Again Revisited: The Internal Path Length Perspective
inferred← citeshttps://doi.org/10.1137/s0097539796301811openalex-snapshot
Average Profile of the Generalized Digital Search Tree and the Generalized Lempel--Ziv Algorithm
inferred← citeshttps://doi.org/10.1137/s0097539799356812openalex-snapshot
Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel--Ziv Scheme
inferred← citeshttps://doi.org/10.1137/s0895480104440134openalex-snapshot
Bimodality and Phase Transitions in the Profile Variance of Random Binary Search Trees
inferred← citeshttps://doi.org/10.1145/195058.195456openalex-snapshot
A functional equation often arising in the analysis of algorithms (extended abstract)
inferred← citeshttps://doi.org/10.1214/09-aap640openalex-snapshot
A functional limit theorem for the profile of b-ary trees
inferred← citeshttps://doi.org/10.1214/14-aop988openalex-snapshot
Behavior near the extinction time in self-similar fragmentations II: Finite dislocation measures
inferred← citeshttps://doi.org/10.1214/22-aihp1316openalex-snapshot
Doubly stochastic Yule cascades (part II): The explosion problem in the non-reversible case
inferred← citeshttps://doi.org/10.1214/22-aihp1330openalex-snapshot
Scaling limits of external multi-particle DLA on the plane and the supercooled Stefan problem
inferred← citeshttps://doi.org/10.1214/aop/1176988855openalex-snapshot
Domination Between Trees and Application to an Explosion Problem
inferred← citeshttps://doi.org/10.1214/ecp.v15-1581openalex-snapshot
The Aldous-Shields model revisited with application to cellular ageing
inferred← citeshttps://doi.org/10.1214/ejp.v10-257openalex-snapshot
Martingales and Profile of Binary Search Trees
inferred← citeshttps://doi.org/10.1214/ss/1177010038openalex-snapshot
Tree-Indexed Processes
inferred← citeshttps://doi.org/10.1239/jap/1143936241openalex-snapshot
A Central Limit Theorem for Non-Overlapping Return Times
inferred← citeshttps://doi.org/10.3150/21-bej1429openalex-snapshot
Continuous-time digital search tree and a border aggregation model
inferred← citeshttps://doi.org/10.3934/amc.2014.8.119openalex-snapshot
Nearest-neighbor entropy estimators with weak metrics
inferred← citeshttps://doi.org/10.4213/tvp328openalex-snapshot
Testing randomness: a suite of statistical procedures
inferred← citeshttps://doi.org/10.4230/lipics.aofa.2020.15openalex-snapshot
Analysis of Lempel-Ziv'78 for Markov Sources
inferred← citeshttps://doi.org/10.46298/dmtcs.2775openalex-snapshot
Almost sure asymptotics for the random binary search tree
inferred← citeshttps://doi.org/10.46298/dmtcs.3357openalex-snapshot
A hooray for Poisson approximation
inferred← citeshttps://doi.org/10.46298/dmtcs.3517openalex-snapshot
Concentration Properties of Extremal Parameters in Random Discrete Structures
inferred← citeshttps://doi.org/10.46298/dmtcs.498openalex-snapshot
Asymptotic variance of random symmetric digital search trees
inferred← citeshttps://doi.org/10.48550/arxiv.math/0410318openalex-snapshot
Connecting Yule Process, Bisection and Binary Search Tree via Martingales
inferred← citeshttps://doi.org/10.48550/arxiv.nlin/0401040openalex-snapshot
Corrections of the NIST Statistical Test Suite for Randomness
inferred← citeshttps://doi.org/10.5281/zenodo.23132297openalex-snapshot
The height of symmetric digital search trees: two-point concentration and the law of the height
inferred← citeshttps://doi.org/10.5281/zenodo.23138274openalex-snapshot
An integer-visiting process with real multipliers: coverage and rates
inferred← citeshttps://doi.org/10.5555/313651.313662openalex-snapshot
On the entropy of DNA: algorithms and measurements based on memory and rapid convergence
inferred← citeshttps://doi.org/10.5555/338219.338251openalex-snapshot
Height in a digital search tree and the longest phrase of the Lempel-Ziv scheme
inferred← citeshttps://doi.org/10.6028/nist.sp.800-22openalex-snapshot
A statistical test suite for random and pseudorandom number generators for cryptographic applications
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.