Móri, Tamás F. and Rokob, Sándor (2019) Random cherry graphs. PUBLICATIONES MATHEMATICAE DEBRECEN, 95 (1-2). pp. 93-114. ISSN 0033-3883 (print); 2064-2849 (online)
|
Text
1807.pdf Available under License Creative Commons Attribution. Download (225kB) | Preview |
Official URL: http://doi.org/10.5486/PMD.2019.8384
Abstract
Due to the popularity of randomly evolving graph processes, there exists a randomized version of many recursively defined graph models. This is also the case with the cherry tree, which was introduced by Bukszar and Prekopa to improve Bonferroni type upper bounds on the probability of the union of random events. Here we consider a substantially extended random analogue of that model, embedding it into a general time-dependent branching process.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Cherry tree; Crump–Mode–Jagers process; exponential growth; extinction |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika > QA166-QA166.245 Graphs theory / gráfelmélet |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 30 Oct 2019 14:01 |
| Last Modified: | 20 Apr 2023 09:32 |
| URI: | http://real.mtak.hu/id/eprint/102815 |
Actions (login required)
 |
Edit Item |
