Infinite random graphs
Combinatorics
2026-01-23 v1
Abstract
We study countable graphs that -- up to isomorphism and with probability one -- arise from a random process, in a similar fashion as the Rado graph. Unlike in the classical case, we do not require that probabilities assigned to pairs of points are all equal. We give examples of such generalized random graphs, and show that the class of graphs under consideration has a two-element basis.
Cite
@article{arxiv.2601.16013,
title = {Infinite random graphs},
author = {Ziemowit Kostana and Jarosław Swaczyna and Agnieszka Widz},
journal= {arXiv preprint arXiv:2601.16013},
year = {2026}
}
Comments
before the first submission