Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2503.05829 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910864978739200 |
|---|---|
| author | Engel, Rafael |
| author_facet | Engel, Rafael |
| contents | This Master's thesis examines the properties of large degree vertices in random recursive directed acyclic graphs (RRDAGs), a generalization of the well-studied random recursive tree (RRT) model. Using a novel adaptation of Kingman's coalescent, we extend results from RRTs to RRDAGs, focusing on different vertex properties. For large degrees, we establish the asymptotic joint distribution of the degree of multiple uniform vertices, proving that they follow a multivariate geometric distribution, and obtain results on maximal and near-maximal degree vertices. In addition, we consider a version of vertex depth that we call ungreedy depth and describe its asymptotic behavior, along with the labels, of single uniform vertices with a given large degree. Finally, we extend this analysis to multiple uniform vertices by deriving the asymptotic behavior of their labels conditional on large degrees. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_05829 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Large degree vertices in random directed acyclic graphs Engel, Rafael Probability This Master's thesis examines the properties of large degree vertices in random recursive directed acyclic graphs (RRDAGs), a generalization of the well-studied random recursive tree (RRT) model. Using a novel adaptation of Kingman's coalescent, we extend results from RRTs to RRDAGs, focusing on different vertex properties. For large degrees, we establish the asymptotic joint distribution of the degree of multiple uniform vertices, proving that they follow a multivariate geometric distribution, and obtain results on maximal and near-maximal degree vertices. In addition, we consider a version of vertex depth that we call ungreedy depth and describe its asymptotic behavior, along with the labels, of single uniform vertices with a given large degree. Finally, we extend this analysis to multiple uniform vertices by deriving the asymptotic behavior of their labels conditional on large degrees. |
| title | Large degree vertices in random directed acyclic graphs |
| topic | Probability |
| url | https://arxiv.org/abs/2503.05829 |