Work

Leaf Stripping on Uniform Attachment Trees

Year: 2025

Type: article

Abstract: ABSTRACT In this note, we analyze the performance of a simple root‐finding algorithm in uniform attachment trees. The leaf‐stripping algorithm recursively removes all leaves of the tree for a carefully chosen number of rounds. We show that, with probability , the set of remaining vertices contains the root and has a size only depending on but not on the size of the tree.

Source: Random Structures and Algorithms

DOI: 10.1002/rsa.70023

Authors: Louigi Addario‐Berry, Anna Brandenberger, Simon Briend, Nicolas Broutin, Gábor Lugosi

Institutions: McGill University, Massachusetts Institute of Technology, UniDistance Suisse, Sorbonne Université, Laboratoire de Probabilités, Statistique et Modélisation, Institució Catalana de Recerca i Estudis Avançats, Universitat Pompeu Fabra, Barcelona School of Economics

Language: English

Topic: Complex Network Analysis Techniques

Subfield: Statistical and Nonlinear Physics

Field: Physics and Astronomy

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $4,550

Funders: National Science Foundation, Simons Foundation, Fundación BBVA, McGill University, Canada Research Chairs, Ministerio de Economía y Competitividad, Banco Bilbao Vizcaya Argentaria, Natural Sciences and Engineering Research Council of Canada

Awards: G4119437170, Graduate Research Fellowship Program (GRFP)

OpenAlex ID: W4412946758

FWCI: 0.572

Cites: 20

Cited by: 2

Related to: 10