Eve, Adam and the preferential attachment tree

[PDF] arxiv.org

Estimating the history of a random recursive tree

S Briend, C Giraud, G Lugosi, D Sulem - arXiv preprint arXiv:2403.09755, 2024 - arxiv.org
This paper studies the problem of estimating the order of arrival of the vertices in a random
recursive tree. Specifically, we study two fundamental models: the uniform attachment model …
被引用次数：2 相关文章 所有 3 个版本
[PDF] arxiv.org

Finding the root in random nearest neighbor trees

A Brandenberger, C Marcussen, E Mossel… - arXiv preprint arXiv …, 2024 - arxiv.org
We study the inference of network archaeology in growing random geometric graphs. We
consider the root finding problem for a random nearest neighbor tree in dimension …
相关文章 所有 2 个版本
[PDF] arxiv.org

Optimal root recovery for uniform attachment trees and -regular growing trees

L Addario-Berry, C Fontaine, R Khanfir… - arXiv preprint arXiv …, 2024 - arxiv.org
We consider root-finding algorithms for random rooted trees grown by uniform attachment.
Given an unlabeled copy of the tree and a target accuracy $\varepsilon> 0$, such an …
相关文章 所有 4 个版本