Finding the seed of uniform attachment trees

DOI10.1214/19-EJP268zbMath1466.60013arXiv1801.01816OpenAlexW2964269465MaRDI QIDQ2631843

Alan Pereira, Gábor Lugosi

Publication date: 16 May 2019

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

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

zbMATH Keywords

random treesseeddiscrete probabilityuniform attachment

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items (8)

Epicenter of random epidemic spanning trees on finite graphs ⋮ Correlated randomly growing graphs ⋮ Root finding algorithms and persistence of Jordan centrality in growing random trees ⋮ Influence of the seed in affine preferential attachment trees ⋮ Root estimation in Galton–Watson trees ⋮ Degree centrality and root finding in growing random networks ⋮ Persistence of hubs in growing random networks ⋮ Broadcasting on random recursive trees

Cites Work

• Unnamed Item
• Unnamed Item
• Scaling limits and influence of the seed graph in preferential attachment trees
• Looking for vertex number one
• On normal approximation rates for certain sums of dependent random variables
• Discrete minimax estimation with trees
• From trees to seeds: on the inference of the seed from large trees in the uniform attachment model
• The central limit theorem for dependent random variables
• Finding Rumor Sources on Random Trees
• Finding Adam in random growing trees
• Limit laws for local counters in random binary search trees
• Random Trees
• Persistence of centrality in random growing trees
• Large deviations for sums of partly dependent random variables
• Rumors in a Network: Who's the Culprit?

This page was built for publication: Finding the seed of uniform attachment trees