Abstract
The theme of this paper is the derivation of analytic formulae for certain large combinatorial structures. The formulae are obtained via fluid limits of pure jump-type Markov processes, established under simple conditions on the Laplace transforms of their Lévy kernels. Furthermore, a related Gaussian approximation allows us to describe the randomness which may persist in the limit when certain parameters take critical values. Our method is quite general, but is applied here to vertex identifiability in random hypergraphs. A vertex
Citation
R. W. R. Darling. J. R. Norris. "Structure of large random hypergraphs." Ann. Appl. Probab. 15 (1A) 125 - 152, February 2005. https://doi.org/10.1214/105051604000000567
Information