Article
Licensed
Unlicensed
Requires Authentication
The cycle structure of a random nonhomogeneous hypergraph on the subcritical stage of evolution
-
A. V. Shapovalov
Published/Copyright:
December 10, 2007
We consider a random nonhomogeneous hypergraph on n vertices with M = M(n) edges, Mi = Mi (n) edges consist of i vertices,
For each edge, vertices are chosen by random and equiprobable sampling with replacement out of n vertices. Under the condition that N → ∞ and
we show that the probability that the random hypergraph consists of hypertrees and components with one cycle tends to one. Similar results for random graphs and random homogeneous hypergraphs have been obtained earlier.
Received: 2005-June-10
Published Online: 2007-12-10
Published in Print: 2007-12-11
© de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- The limit distribution of the size of a giant component in an Internet-type random graph
- On conditions for emergence of a giant tree in a random unlabelled forest
- On the transition of distributions of sums of random variables related to the generalised allocation scheme from one lattice to another
- A multiple optimal stopping rule for sums of independent random variables
- The cycle structure of a random nonhomogeneous hypergraph on the subcritical stage of evolution
- On the structure of the set of reversible cellular automata
- On-line algorithms for packing rectangles into several strips
- An enhanced algorithm to search for low-degree annihilators for a Zhegalkin polynomial
Articles in the same Issue
- The limit distribution of the size of a giant component in an Internet-type random graph
- On conditions for emergence of a giant tree in a random unlabelled forest
- On the transition of distributions of sums of random variables related to the generalised allocation scheme from one lattice to another
- A multiple optimal stopping rule for sums of independent random variables
- The cycle structure of a random nonhomogeneous hypergraph on the subcritical stage of evolution
- On the structure of the set of reversible cellular automata
- On-line algorithms for packing rectangles into several strips
- An enhanced algorithm to search for low-degree annihilators for a Zhegalkin polynomial
