<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-01056125</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-17T19:33:41+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Cutting down $\mathbf p$-trees and inhomogeneous continuum random trees</title>
            <author role="aut">
              <persName>
                <forename type="first">Nicolas</forename>
                <surname>Broutin</surname>
              </persName>
              <email type="md5">966d93f3049951b37a36a84b663ed370</email>
              <email type="domain">sorbonne-universite.fr</email>
              <idno type="idhal" notation="numeric">1031274</idno>
              <idno type="halauthorid" notation="string">483949-1031274</idno>
              <idno type="IDREF">https://www.idref.fr/183676858</idno>
              <idno type="VIAF">https://viaf.org/viaf/314924964</idno>
              <affiliation ref="#struct-454682"/>
              <affiliation ref="#struct-1004954"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Minmin</forename>
                <surname>Wang</surname>
              </persName>
              <idno type="halauthorid">854319-0</idno>
              <affiliation ref="#struct-93591"/>
              <affiliation ref="#struct-1004954"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Nicolas</forename>
                <surname>Broutin</surname>
              </persName>
              <email type="md5">5b88c67116033bdeda998545b0541c97</email>
              <email type="domain">upmc.fr</email>
            </editor>
            <funder ref="#projanr-41192"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2014-08-15 13:06:20</date>
              <date type="whenWritten">2014-08-14</date>
              <date type="whenModified">2025-11-21 16:25:00</date>
              <date type="whenReleased">2014-08-15 13:06:20</date>
              <date type="whenProduced">2017</date>
              <ref type="externalLink" target="http://arxiv.org/pdf/1408.0144"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="179222">
                <persName>
                  <forename>Nicolas</forename>
                  <surname>Broutin</surname>
                </persName>
                <email type="md5">5b88c67116033bdeda998545b0541c97</email>
                <email type="domain">upmc.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01056125</idno>
            <idno type="halUri">https://hal.science/hal-01056125</idno>
            <idno type="halBibtex">broutin:hal-01056125</idno>
            <idno type="halRefHtml">&lt;i&gt;Bernoulli&lt;/i&gt;, 2017, 23 (4A), pp.2380-2433. &lt;a target="_blank" href="https://dx.doi.org/10.3150/16-BEJ813"&gt;&amp;#x27E8;10.3150/16-BEJ813&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Bernoulli, 2017, 23 (4A), pp.2380-2433. &amp;#x27E8;10.3150/16-BEJ813&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UPMC" corresp="SORBONNE-UNIVERSITE">Université Pierre et Marie Curie</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="INRIA-ROCQ">INRIA Paris - Rocquencourt</idno>
            <idno type="stamp" n="INSMI">CNRS-INSMI - INstitut des Sciences Mathématiques et de leurs Interactions</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="TDS-MACS">Réseau de recherche en Théorie des Systèmes Distribués, Modélisation, Analyse et Contrôle des Systèmes</idno>
            <idno type="stamp" n="INRIA2017">INRIA2017</idno>
            <idno type="stamp" n="LPSM" corresp="SORBONNE-UNIVERSITE">Laboratoire de Probabilités, Statistique et Modélisation</idno>
            <idno type="stamp" n="SORBONNE-UNIVERSITE">Sorbonne Université</idno>
            <idno type="stamp" n="SU-INF-2018" corresp="SORBONNE-UNIVERSITE">SORBONNE université &lt;2018</idno>
            <idno type="stamp" n="SU-SCIENCES" corresp="SORBONNE-UNIVERSITE">Faculté des Sciences de Sorbonne Université</idno>
            <idno type="stamp" n="UP-SCIENCES">Université Paris Cité - Faculté des Sciences</idno>
            <idno type="stamp" n="SU-TI">Sorbonne Université - Texte Intégral</idno>
            <idno type="stamp" n="ANR">ANR</idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</idno>
            <idno type="stamp" n="INRIAARTDOI">INRIAARTDOI</idno>
            <idno type="stamp" n="ANR_QUANTIQUE">ANR QUANTIQUE</idno>
            <idno type="stamp" n="ANR_QUANTIQUE_3" corresp="ANR_QUANTIQUE">ANR_QUANTIQUE_3</idno>
          </seriesStmt>
          <notesStmt>
            <note type="commentary">44 pages, 6 figures</note>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Cutting down $\mathbf p$-trees and inhomogeneous continuum random trees</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Nicolas</forename>
                    <surname>Broutin</surname>
                  </persName>
                  <email type="md5">966d93f3049951b37a36a84b663ed370</email>
                  <email type="domain">sorbonne-universite.fr</email>
                  <idno type="idhal" notation="numeric">1031274</idno>
                  <idno type="halauthorid" notation="string">483949-1031274</idno>
                  <idno type="IDREF">https://www.idref.fr/183676858</idno>
                  <idno type="VIAF">https://viaf.org/viaf/314924964</idno>
                  <affiliation ref="#struct-454682"/>
                  <affiliation ref="#struct-1004954"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Minmin</forename>
                    <surname>Wang</surname>
                  </persName>
                  <idno type="halauthorid">854319-0</idno>
                  <affiliation ref="#struct-93591"/>
                  <affiliation ref="#struct-1004954"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">11091</idno>
                <idno type="issn">1350-7265</idno>
                <title level="j">Bernoulli</title>
                <imprint>
                  <publisher>Bernoulli Society for Mathematical Statistics and Probability</publisher>
                  <biblScope unit="volume">23</biblScope>
                  <biblScope unit="issue">4A</biblScope>
                  <biblScope unit="pp">2380-2433</biblScope>
                  <date type="datePub">2017</date>
                </imprint>
              </monogr>
              <idno type="arxiv">1408.0144</idno>
              <idno type="doi">10.3150/16-BEJ813</idno>
              <ref target="https://projecteuclid.org/euclid.bj/1494316821" type="seeAlso"/>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-dm">Computer Science [cs]/Discrete Mathematics [cs.DM]</classCode>
              <classCode scheme="halDomain" n="math.math-co">Mathematics [math]/Combinatorics [math.CO]</classCode>
              <classCode scheme="halDomain" n="math.math-pr">Mathematics [math]/Probability [math.PR]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>We study a fragmentation of the $\mathbf p$-trees of Camarri and Pitman [Elect. J. Probab., vol. 5, pp. 1--18, 2000]. We give exact correspondences between the $\mathbf p$-trees and trees which encode the fragmentation. We then use these results to study the fragmentation of the ICRTs (scaling limits of $\mathbf p$-trees) and give distributional correspondences between the ICRT and the tree encoding the fragmentation. The theorems for the ICRT extend the ones by Bertoin and Miermont [Ann. Appl. Probab., vol. 23(4), pp. 1469--1493, 2013] about the cut tree of the Brownian continuum random tree.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-454682" status="OLD">
          <idno type="RNSR">200418316W</idno>
          <orgName>Networks, Algorithms and Probabilities</orgName>
          <orgName type="acronym">RAP</orgName>
          <date type="start">2004-02-01</date>
          <date type="end">2016-12-31</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/rap</ref>
          </desc>
          <listRelation>
            <relation active="#struct-454310" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-1004954" status="VALID">
          <idno type="IdRef">235620025</idno>
          <idno type="RNSR">201822759P</idno>
          <idno type="ROR">https://ror.org/02vnd0e65</idno>
          <orgName>Laboratoire de Probabilités, Statistique et Modélisation</orgName>
          <orgName type="acronym">LPSM (UMR_8001)</orgName>
          <date type="start">2020-01-01</date>
          <desc>
            <address>
              <addrLine>Campus Jussieu Tour 16-26, 1er étage 4, Place Jussieu 75005 Paris / Bâtiment Sophie Germain 5ème étage Avenue de France 75013 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lpsm.paris</ref>
          </desc>
          <listRelation>
            <relation name="UMR_8001" active="#struct-413221" type="direct"/>
            <relation name="UMR8001" active="#struct-441569" type="direct"/>
            <relation name="UMR_8001" active="#struct-557826" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-93591" status="OLD">
          <idno type="ROR">https://ror.org/02en5vm52</idno>
          <orgName>Université Pierre et Marie Curie - Paris 6</orgName>
          <orgName type="acronym">UPMC</orgName>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>4 place Jussieu - 75005 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.upmc.fr/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-454310" status="VALID">
          <idno type="IdRef">241614864</idno>
          <idno type="RNSR">196718247G</idno>
          <idno type="ROR">https://ror.org/05eyd5d35</idno>
          <orgName>Centre Inria de Paris</orgName>
          <date type="start">2016-03-10</date>
          <desc>
            <address>
              <addrLine>48 Rue Barrault, 75013 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/paris</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
          <orgName type="acronym">Inria</orgName>
          <desc>
            <address>
              <addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-413221" status="VALID">
          <idno type="IdRef">221333754</idno>
          <idno type="ROR">https://ror.org/02en5vm52</idno>
          <orgName>Sorbonne Université</orgName>
          <orgName type="acronym">SU</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <addrLine>21 rue de l’École de médecine - 75006 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.sorbonne-universite.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-557826" status="VALID">
          <idno type="IdRef">236453505</idno>
          <idno type="ISNI">0000 0004 7885 7602</idno>
          <idno type="ROR">https://ror.org/05f82e368</idno>
          <orgName>Université Paris Cité</orgName>
          <orgName type="acronym">UPCité</orgName>
          <date type="start">2020-01-01</date>
          <desc>
            <address>
              <addrLine>85 boulevard Saint-Germain75006 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://u-paris.fr/</ref>
          </desc>
        </org>
      </listOrg>
      <listOrg type="projects">
        <org type="anrProject" xml:id="projanr-41192" status="VALID">
          <idno type="anr">ANR-14-CE25-0014</idno>
          <idno type="program">Appel à projets générique</idno>
          <orgName>GRAAL</orgName>
          <desc>GRaphes et Arbres ALéatoires</desc>
          <date type="start">2014</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>