A Method for Generating Connected Erdos-Renyi Random Graphs
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914101875179520 |
|---|---|
| author | Chinyaev, Boris |
| author_facet | Chinyaev, Boris |
| contents | We propose a novel exact algorithm for generating connected Erdos-Renyi random graphs $G(n,p)$. The method couples the graph exploration process to an inhomogeneous Poisson random walk, which yields an exact sampler that runs in $O(n)$ time in the sparse regime $p=c/n$. We also show how the method extends to the $G(n,M)$ model via an additional acceptance-rejection step. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_05907 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Method for Generating Connected Erdos-Renyi Random Graphs Chinyaev, Boris Data Structures and Algorithms Discrete Mathematics Information Theory Combinatorics Probability We propose a novel exact algorithm for generating connected Erdos-Renyi random graphs $G(n,p)$. The method couples the graph exploration process to an inhomogeneous Poisson random walk, which yields an exact sampler that runs in $O(n)$ time in the sparse regime $p=c/n$. We also show how the method extends to the $G(n,M)$ model via an additional acceptance-rejection step. |
| title | A Method for Generating Connected Erdos-Renyi Random Graphs |
| topic | Data Structures and Algorithms Discrete Mathematics Information Theory Combinatorics Probability |
| url | https://arxiv.org/abs/2504.05907 |