Transient and slim versus recurrent and fat: Random walks and the trees they grow

DOI10.1017/jpr.2019.43zbMath1436.60084arXiv1711.02913OpenAlexW2979082250MaRDI QIDQ5235052

Giovanni Neglia, Daniel R. Figueiredo, Giulio Iacobelli

Publication date: 7 October 2019

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.02913

zbMATH Keywords

random walkrandom graphnetwork growth model

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Processes in random environments (60K37) Random walks on graphs (05C81)

Related Items (2)

On a random walk that grows its own tree ⋮ Tree builder random walk: recurrence, transience and ballisticity

Cites Work

• Unnamed Item
• From transience to recurrence with Poisson tree frogs
• Random walk attachment graphs
• Transience of edge-reinforced random walk
• Localization for linearly edge reinforced random walks
• Walking within growing domains: recurrence versus transience
• Emergence of Scaling in Random Networks
• Networks
• Type transition of simple random walks on randomly directed regular lattices

This page was built for publication: Transient and slim versus recurrent and fat: Random walks and the trees they grow