Generating infinite random graphs

From MaRDI portal




Abstract: We define a growing model of random graphs. Given a sequence of nonnegative integers dnn=0infty with the property that dileqi, we construct a random graph on countably infinitely many vertices v0,v1ldots by the following process: vertex vi is connected to a subset of v0,ldots,vi1 of cardinality di chosen uniformly at random. We study the resulting probability space. In particular, we give a new characterization of random graph and we also give probabilistic methods for constructing infinite random trees.











This page was built for publication: Generating infinite random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5228177)