Hostname: page-component-586b7cd67f-t7fkt Total loading time: 0 Render date: 2024-11-26T02:03:24.675Z Has data issue: false hasContentIssue false
  • English
  • Français

Giant components in three-parameter random directed graphs

Part of: Graph theory

Published online by Cambridge University Press:  01 July 2016

Tomasz Łuczak  and
Joel E. Cohen
Tomasz Łuczak*
Affiliation:
Rockefeller University
Joel E. Cohen*
Affiliation:
Rockefeller University
*
∗Permanent postal address: Institute of Mathematics, Adam Mickiewicz University, Matejki 48/49, 60–769 Poznan, Poland.
∗∗Postal address: The Rockefeller University, 1230 York Avenue, Box 20, New York, NY 10021, USA.
Get access Rights & Permissions [Opens in a new window]

Abstract

A three-parameter model of a random directed graph (digraph) is specified by the probability of ‘up arrows' from vertex i to vertex j where i < j, the probability of ‘down arrows' from i to j where i ≥ j, and the probability of bidirectional arrows between i and j. In this model, a phase transition—the abrupt appearance of a giant strongly connected component—takes place as the parameters cross a critical surface. The critical surface is determined explicitly. Before the giant component appears, almost surely all non-trivial components are small cycles. The asymptotic probability that the digraph contains no cycles of length 3 or more is computed explicitly. This model and its analysis are motivated by the theory of food webs in ecology.

Keywords

PHASE TRANSITIONACYCLIC RANDOM DIGRAPHSRANDOM GRAPHSFOOD WEBECOLOGY

MSC classification

Primary: 05C80: Random graphs
Secondary: 92D40: Ecology
Type
Research Article
Information
Advances in Applied Probability , Volume 24 , Issue 4 , December 1992 , pp. 845 - 857
Copyright
Copyright © Applied Probability Trust 1992 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Ajtai, M., Komlós, J. and Szemeredi, E. (1982) Largest random component of a k-cube. Combinatorica 2, 1–7.CrossRefGoogle Scholar
Cohen, J. E., Luczak, T., Newman, C. M. and Zhou, Z. (1990) Stochastic structure and nonlinear dynamics of food webs: qualitative stability in a Lotka-Volterra cascade model. Proc. R. Soc. London B 240, 607–627.Google Scholar
Erdös, P. and Renyi, A. (1960) On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutató Int. Közl. 5, 17–61.Google Scholar
Grimmett, G. R. (1989) Percolation. Springer-Verlag, Berlin.CrossRefGoogle Scholar
Harris, T. E. (1963) The Theory of Branching Processes : Springer-Verlag, Berlin.CrossRefGoogle Scholar
Karp, R. M. (1990) The transitive closure of a random digraph. Random Structures and Algorithms 1, 73–94.CrossRefGoogle Scholar
Kesten, H. (1982) Percolation Theory for Mathematicians. Birkhaüser, Basle.CrossRefGoogle Scholar
Luczak, T. (1990) The phase transition in the evolution of random digraphs. J. Graph Theory 14, 217–223.CrossRefGoogle Scholar
Schmidt-Pruzan, J. and Shamir, E. (1985) Components structure in the evolution of random hypergraphs. Combinatorica 5, 81–94.CrossRefGoogle Scholar