Structure of large random hypergraphs
| dc.creator | Darling, R. W. R. | |
| dc.creator | Norris, J. R. | |
| dc.date | 2001-09-04 | |
| dc.date | 2004-01-16 | |
| dc.date.accessioned | 2026-07-07T04:43:15Z | |
| dc.date.available | 2026-07-07T04:43:15Z | |
| dc.description | 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 Levy 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 v is identifiable in n steps if there is a hyperedge containing v all of whose other vertices are identifiable in fewer than n steps. We say that a hyperedge is identifiable if every one of its vertices is identifiable. Our analytic formulae describe the asymptotics of the number of identifiable vertices and the number of identifiable hyperedges for a Poisson random hypergraph on a set of N vertices, in the limit as N goes to infinity. | |
| dc.description | Revised version with minor conceptual improvements and additional discussion. 32 pages, 5 figures | |
| dc.identifier | https://arxiv.org/abs/math/0109020 | |
| dc.identifier | http://arxiv.org/abs/math/0109020 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/62137 | |
| dc.subject | Probability | |
| dc.subject | Combinatorics | |
| dc.subject | 05C65; 60J75, 05C80 | |
| dc.title | Structure of large random hypergraphs | |
| dc.type | text |