First cycles in random directed graph processes (Q910414)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: First cycles in random directed graph processes |
scientific article; zbMATH DE number 4139792
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | First cycles in random directed graph processes |
scientific article; zbMATH DE number 4139792 |
Statements
First cycles in random directed graph processes (English)
0 references
1989
0 references
A directed graph process is defined by successively letting each one of n vertices send out k edges with equal probabilities given to the \(\left( \begin{matrix} n\\ k\end{matrix} \right)\) choices. At time t, exactly t of the vertices have sent out their edges. Martingale theory is used to prove some results about the distribution of the length of the first cycle.
0 references
random graph processes
0 references
graph evolution
0 references
cycles
0 references
