<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0524245</ARLID> <utime>20250310155934.7</utime><mtime>20200513235959.9</mtime>   <WOS>000532409600001</WOS> <SCOPUS>85085067190</SCOPUS>  <DOI>10.1214/20-EJP460</DOI>           <title language="eng" primary="1">Recursive tree processes and the mean-field limit of stochastic flows</title>  <specification> <page_count>63 s.</page_count> <media_type>E</media_type> </specification>   <serial><ARLID>cav_un_epca*0041954</ARLID><ISSN>1083-6489</ISSN><title>Electronic Journal of Probability</title><part_num/><part_title/><volume_id>25</volume_id><volume/><publisher><place/><name>Institute of Mathematical Statistics</name><year/></publisher></serial>    <keyword>mean-field limit</keyword>   <keyword>recursive tree process</keyword>   <keyword>recursive distributional equation</keyword>   <keyword>endogeny</keyword>   <keyword>interacting particle systems</keyword>   <keyword>cooperative branching</keyword>    <author primary="1"> <ARLID>cav_un_auth*0365236</ARLID>  <share>34</share> <name1>Mach</name1> <name2>Tibor</name2> <institution>UTIA-B</institution> <full_dept language="cz">Stochastická informatika</full_dept> <full_dept language="eng">Department of Stochastic Informatics</full_dept> <department language="cz">SI</department> <department language="eng">SI</department> <full_dept>Department of Stochastic Informatics</full_dept> <country>CZ</country> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author> <author primary="0"> <ARLID>cav_un_auth*0244526</ARLID> <name1>Sturm</name1> <name2>A.</name2> <country>DE</country> </author> <author primary="0"> <ARLID>cav_un_auth*0217893</ARLID>  <share>33</share> <name1>Swart</name1> <name2>Jan M.</name2> <institution>UTIA-B</institution> <full_dept language="cz">Stochastická informatika</full_dept> <full_dept>Department of Stochastic Informatics</full_dept> <department language="cz">SI</department> <department>SI</department> <full_dept>Department of Stochastic Informatics</full_dept> <country>CZ</country> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>   <source> <url>http://library.utia.cas.cz/separaty/2020/SI/swart-0524245.pdf</url> </source> <source> <url>https://projecteuclid.org/journals/electronic-journal-of-probability/volume-25/issue-none/Recursive-tree-processes-and-the-mean-field-limit-of-stochastic/10.1214/20-EJP460.full</url>  </source>        <cas_special> <project> <ARLID>cav_un_auth*0334217</ARLID> <project_id>GA16-15238S</project_id> <agency>GA ČR</agency> <country>CZ</country> </project>  <abstract language="eng" primary="1">Interacting particle systems can often be constructed from a graphical representation, by applying local maps at the times of associated Poisson processes. This leads to a natural coupling of systems started in different initial states. We consider interacting particle systems on the complete graph in the mean-field limit, i.e., as the number of vertices tends to infinity. We are not only interested in the mean-field limit of a single process, but mainly in how several coupled processes behave in the limit. This turns out to be closely related to recursive tree processes as studied by Aldous and Bandyopadyay in discrete time. We here develop an analogue theory for recursive tree processes in continuous time. We illustrate the abstract theory on an example of a particle system with cooperative branching. This yields an interesting new example of a recursive tree process that is not endogenous.</abstract>     <result_subspec>WOS</result_subspec> <RIV>BA</RIV> <FORD0>10000</FORD0> <FORD1>10100</FORD1> <FORD2>10103</FORD2>    <reportyear>2021</reportyear>      <num_of_auth>3</num_of_auth>  <unknown tag="mrcbC52"> 2 R hod 4 4rh 4 20250310155156.7 4 20250310155934.7 </unknown> <inst_support> RVO:67985556 </inst_support>  <permalink>http://hdl.handle.net/11104/0308916</permalink>  <unknown tag="mrcbC61"> 1 </unknown> <cooperation> <ARLID>cav_un_auth*0391976</ARLID> <name>Georg-August-Universität Göttingen</name> </cooperation>  <confidential>S</confidential>  <article_num> 61 </article_num> <unknown tag="mrcbC86"> 2 Article Statistics Probability </unknown> <unknown tag="mrcbC91"> A </unknown>         <unknown tag="mrcbT16-e">STATISTICS&amp;PROBABILITY</unknown> <unknown tag="mrcbT16-f">1.380</unknown> <unknown tag="mrcbT16-g">0.236</unknown> <unknown tag="mrcbT16-h">7.4</unknown> <unknown tag="mrcbT16-i">0.00836</unknown> <unknown tag="mrcbT16-j">1.391</unknown> <unknown tag="mrcbT16-k">2131</unknown> <unknown tag="mrcbT16-q">55</unknown> <unknown tag="mrcbT16-s">1.666</unknown> <unknown tag="mrcbT16-y">33.37</unknown> <unknown tag="mrcbT16-x">1.16</unknown> <unknown tag="mrcbT16-3">484</unknown> <unknown tag="mrcbT16-4">Q1</unknown> <unknown tag="mrcbT16-5">1.032</unknown> <unknown tag="mrcbT16-6">161</unknown> <unknown tag="mrcbT16-7">Q3</unknown> <unknown tag="mrcbT16-B">68.896</unknown> <unknown tag="mrcbT16-C">34.8</unknown> <unknown tag="mrcbT16-D">Q2</unknown> <unknown tag="mrcbT16-E">Q1</unknown> <unknown tag="mrcbT16-M">0.47</unknown> <unknown tag="mrcbT16-N">Q3</unknown> <unknown tag="mrcbT16-P">34.8</unknown> <arlyear>2020</arlyear>    <unknown tag="mrcbTft">  Soubory v repozitáři: swart-0524245.pdf </unknown>    <unknown tag="mrcbU14"> 85085067190 SCOPUS </unknown> <unknown tag="mrcbU24"> PUBMED </unknown> <unknown tag="mrcbU34"> 000532409600001 WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0041954 Electronic Journal of Probability 1083-6489 1083-6489 Roč. 25 č. 1 2020 Institute of Mathematical Statistics </unknown> </cas_special> </bibitem>