Journal of Applied Probability

Birth of a strongly connected giant in an inhomogeneous random digraph

Mindaugas Bloznelis, Friedrich Götze, and Jerzy Jaworski

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

We present and investigate a general model for inhomogeneous random digraphs with labeled vertices, where the arcs are generated independently, and the probability of inserting an arc depends on the labels of its endpoints and on its orientation. For this model, the critical point for the emergence of a giant component is determined via a branching process approach.

Article information

Source
J. Appl. Probab., Volume 49, Number 3 (2012), 601-611.

Dates
First available in Project Euclid: 6 September 2012

Permanent link to this document
https://projecteuclid.org/euclid.jap/1346955320

Digital Object Identifier
doi:10.1239/jap/1346955320

Mathematical Reviews number (MathSciNet)
MR3012086

Zentralblatt MATH identifier
1252.05196

Subjects
Primary: 05C80: Random graphs [See also 60B20]
Secondary: 90B15: Network models, stochastic 60J85: Applications of branching processes [See also 92Dxx]

Keywords
Inhomogeneous digraph phase transition giant component

Citation

Bloznelis, Mindaugas; Götze, Friedrich; Jaworski, Jerzy. Birth of a strongly connected giant in an inhomogeneous random digraph. J. Appl. Probab. 49 (2012), no. 3, 601--611. doi:10.1239/jap/1346955320. https://projecteuclid.org/euclid.jap/1346955320


Export citation

References

  • Albert, R. and Barabási, A.-L. (2002). Statistical mechanics of complex networks. Rev. Modern Phys. 74, 47–97.
  • Bollobás, B., Janson, S. and Riordan, O. (2007). The phase transition in inhomogeneous random graphs. Random Structures Algorithms 31, 3–122.
  • Cooper, C. and Frieze, A. (2004). The size of the largest strongly connected component of a random digraph with a given degree sequence. Combinatorics Prob. Comput. 13, 319–337.
  • Dorogovtsev, S. N., Mendes, J. F. F. and Samukhin, A. N. (2001). Giant strongly connected component of directed networks. Phys. Rev. E 64, 025101(R), 4 pp.
  • Durrett, R. (2007). Random Graph Dynamics. Cambridge University Press.
  • Harris, T. E. (1963). The Theory of Branching Processes. Springer, Berlin.
  • Janson, S., Łuczak, T. and Ruciński, A. (2001). Random Graphs. John Wiley, New York.
  • Karp, R. M. (1990). The transitive closure of a random digraph. Random Structures Algorithms 1, 73–93.
  • Łuczak, T. (1990). The phase transition in the evolution of random digraphs. J. Graph Theory 14, 217–223.
  • Łuczak, T. and Cohen, J. E. (1992). Giant components in three-parameter random directed graphs. Adv. Appl. Prob. 24, 845–857.
  • Łuczak, T. and Seierstad, T. G. (2009). The critical behavior of random digraphs. Random Structures Algorithms 35, 271–293.
  • Newman, M. E. J., Strogatz, S. H. and Watts, D. J. (2001). Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E 64, 026118, 17 pp.
  • Söderberg, B. (2002). General formalism for inhomogeneous random graphs. Phys. Rev. E 66, 066121, 6 pp.