<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Addario-Berry, Louigi</dc:creator>
  <dc:creator>Brandenberger, Anna</dc:creator>
  <dc:creator>Briend, Simon</dc:creator>
  <dc:creator>Broutin, Nicolas</dc:creator>
  <dc:creator>Lugosi, Gábor</dc:creator>
  <dc:date>2024</dc:date>
  <dc:description xmlns:ns0="xml" ns0:lang="en">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 $1 - ε$, the set of remaining vertices contains the root and has a size only depending on $ε$ but not on the size of the tree.</dc:description>
  <dc:format>application/pdf</dc:format>
  <dc:identifier>https://sonar.unidistance.ch/global/documents/336044</dc:identifier>
  <dc:identifier>https://n2t.net/ark:/51647/srd1336044</dc:identifier>
  <dc:identifier>https://sonar.unidistance.ch/documents/336044/files/Leaf-Stripping-on-Uniform-Attachment-Trees.pdf</dc:identifier>
  <dc:relation>info:eu-repo/semantics/altIdentifier/doi/10.48550/ARXIV.2410.06481</dc:relation>
  <dc:relation>info:eu-repo/semantics/altIdentifier/ark/51647/srd1336044</dc:relation>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:title xmlns:ns1="xml" ns1:lang="en">Leaf Stripping on Uniform Attachment Trees</dc:title>
  <dc:type>http://purl.org/coar/resource_type/c_816b</dc:type>
</oai_dc:dc>