<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0476009</ARLID> <utime>20240103214235.1</utime><mtime>20170710235959.9</mtime>   <WOS>000416069000004</WOS>            <title language="eng" primary="1">A simple rank-based Markov chain with self-organized criticality</title>  <specification> <page_count>16 s.</page_count> </specification>   <serial><ARLID>cav_un_epca*0323221</ARLID><ISSN>1024-2953</ISSN><title>Markov Processes and Related Fields</title><part_num/><part_title/><volume_id>23</volume_id><volume>1 (2017)</volume><page_num>87-102</page_num></serial>    <keyword>self-reinforcement</keyword>   <keyword>self-organized criticality</keyword>   <keyword>canyon</keyword>    <author primary="1"> <ARLID>cav_un_auth*0217893</ARLID> <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>  <share>100</share> <name1>Swart</name1> <name2>Jan M.</name2> <institution>UTIA-B</institution> <country>CZ</country> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>   <source> <url>http://library.utia.cas.cz/separaty/2017/SI/swart-0476009.pdf</url> </source>        <cas_special> <project> <ARLID>cav_un_auth*0291241</ARLID> <project_id>GAP201/12/2613</project_id> <agency>GA ČR</agency> </project> <project> <ARLID>cav_un_auth*0321649</ARLID> <project_id>GA15-08819S</project_id> <agency>GA ČR</agency> <country>CZ</country> </project>  <abstract language="eng" primary="1">We introduce a self-reinforced point processes on the unit interval that appears to exhibit self-organized criticality, somewhat reminiscent of the well-known Bak-Sneppen model. The process takes values in the finite subsets of the unit interval and evolves according to the following rules. In each time step, a particle is added at a uniformly chosen position, independent of the particles that are already present. If there are any particles to the left of the newly arrived particle, then the left-most of these is removed. We show that all particles arriving to the left of p_c = 1 - e^{-1} are a.s. eventually removed, while for large enough time, particles arriving to the right of p_c stay in the system forever.</abstract>     <RIV>BA</RIV> <FORD0>10000</FORD0> <FORD1>10100</FORD1> <FORD2>10101</FORD2>   <reportyear>2018</reportyear>      <num_of_auth>1</num_of_auth>  <inst_support> RVO:67985556 </inst_support>  <permalink>http://hdl.handle.net/11104/0273536</permalink>   <confidential>S</confidential>  <unknown tag="mrcbC86"> 3+4 Article Statistics Probability  </unknown> <unknown tag="mrcbC86"> 3+4 Article Statistics Probability  </unknown> <unknown tag="mrcbC86"> 3+4 Article Statistics Probability  </unknown>         <unknown tag="mrcbT16-e">STATISTICS&amp;PROBABILITY</unknown> <unknown tag="mrcbT16-f">0.464</unknown> <unknown tag="mrcbT16-g">0</unknown> <unknown tag="mrcbT16-h">9.3</unknown> <unknown tag="mrcbT16-i">0.00101</unknown> <unknown tag="mrcbT16-j">0.442</unknown> <unknown tag="mrcbT16-k">280</unknown> <unknown tag="mrcbT16-s">0.452</unknown> <unknown tag="mrcbT16-5">0.414</unknown> <unknown tag="mrcbT16-6">21</unknown> <unknown tag="mrcbT16-7">Q4</unknown> <unknown tag="mrcbT16-B">31.4</unknown> <unknown tag="mrcbT16-C">6.1</unknown> <unknown tag="mrcbT16-D">Q3</unknown> <unknown tag="mrcbT16-E">Q3</unknown> <unknown tag="mrcbT16-M">0.27</unknown> <unknown tag="mrcbT16-N">Q4</unknown> <unknown tag="mrcbT16-P">6.098</unknown> <arlyear>2017</arlyear>       <unknown tag="mrcbU14"> SCOPUS </unknown> <unknown tag="mrcbU24"> PUBMED </unknown> <unknown tag="mrcbU34"> 000416069000004 WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0323221 Markov Processes and Related Fields 1024-2953 1024-2953 Roč. 23 č. 1 2017 87 102 </unknown> </cas_special> </bibitem>