First cycles in random directed graph processes
type: Item
instance of: scholarly article
title: First cycles in random directed graph processes
zbMATH Open document ID: 0696.05044
DOI: 10.1016/0012-365X(89)90078-2
author: Béla Bollobás
author: Steen Rasmussen
published in: Discrete Mathematics
publication date: 1989-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 60G42
zbMATH DE Number: 4139792
zbMATH Keywords: random graph processes
zbMATH Keywords: graph evolution
zbMATH Keywords: cycles
MaRDI profile type: Publication
cites work: Weighted sums of certain dependent random variables
cites work: On generalized graphs
cites work: Q4207934
cites work: Q3267900
cites work: The first cycles in an evolving graph
cites work: Q5659089
cites work: Poisson convergence and Poisson processes with applications to random graphs
cites work: Q4138569
cites work: The equilibrium statistics of a clustering process in the uncondensed phase
description: scientific article; zbMATH DE number 4139792