Structural results for the tree builder random walk

DOI10.1214/24-AAP2128MaRDI QIDQ6970118zbMATH OpenFDO

Authors János Engländer, Giulio Iacobelli, Gábor Pete, Rodrigo Ribeiro

Publication date 18 June 2025

Published in The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/journals/annals-of-applied-probability/volume-35/issue-2/Structural-results-for-the-tree-builder-random-walk/10.1214/24-AAP2128.full

zbMATH Keywords

random walkrandom graphrandom environmentpreferential attachment

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Discrete-time Markov processes on general state spaces (60J05) Random walks on graphs (05C81)

Cites work

• scientific article; zbMATH DE number 1246230 (Why is no real title available?)
• scientific article; zbMATH DE number 1866312 (Why is no real title available?)
• A surprising property of the Barabási--Albert random tree
• Bounds on the cover time
• Co-evolving dynamic networks
• Connectivity Transitions in Networks with Super-Linear Preferential Attachment
• Emergence of Scaling in Random Networks
• Estimating graph parameters with random walks
• Geometric bounds for eigenvalues of Markov chains
• Internal diffusion limited aggregation
• Levels of a scale-free tree
• Localization for linearly edge reinforced random walks
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• Note on the heights of random recursive trees and random m‐ary search trees
• On a random walk that grows its own tree
• On random trees
• PageRank beyond the web
• Probability on trees and networks
• Random Graphs and Complex Networks
• Random graphs and complex networks. Volume 1
• Random trees and general branching processes
• Random walk attachment graphs
• Shuffling Cards and Stopping Times
• Statistical mechanics of complex networks
• Strong uniform times and finite random walks
• The Maximum Degree of the Barabási–Albert Random Tree
• The degree sequence of a scale-free random graph process
• The power of averaging at two consecutive time steps: proof of a mixing conjecture by Aldous and Fill
• The true self-repelling motion
• Transient and slim versus recurrent and fat: random walks and the trees they grow
• Tree builder random walk: recurrence, transience and ballisticity
• Width of a scale-free tree

Cited in

(1)

• A phase transition for the biased tree-builder random walk

This page was built for publication: Structural results for the tree builder random walk

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6970118)