Journal of Applied Probability

The strong giant in a random digraph

Mathew D. Penrose

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

Consider a random directed graph on n vertices with independent and identically distributed outdegrees with distribution F having mean μ, and destinations of arcs selected uniformly at random. We show that if μ > 1 then for large n there is very likely to be a unique giant strong component with proportionate size given as the product of two branching process survival probabilities, one with offspring distribution F and the other with Poisson offspring distribution with mean μ. If μ ≤ 1 there is very likely to be no giant strong component. We also extend this to allow for F varying with n.

Article information

Source
J. Appl. Probab., Volume 53, Number 1 (2016), 57-70.

Dates
First available in Project Euclid: 8 March 2016

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

Mathematical Reviews number (MathSciNet)
MR3471946

Zentralblatt MATH identifier
1335.05164

Subjects
Primary: 05C80: Random graphs [See also 60B20]
Secondary: 60J85: Applications of branching processes [See also 92Dxx] 92D30: Epidemiology

Keywords
Semi-homogeneous random digraph giant component branching process

Citation

Penrose, Mathew D. The strong giant in a random digraph. J. Appl. Probab. 53 (2016), no. 1, 57--70. https://projecteuclid.org/euclid.jap/1457470558


Export citation

References

  • Bloznelis, M., Götze, F. and Jaworski, J. (2012). Birth of a strongly connected giant in an inhomogeneous random digraph. J. Appl. Prob. 49, 601–611.
  • Bollobás, B. (2001). Random Graphs, 2nd edn. Cambridge University Press.
  • Broder, A. \et (2000). Graph structure in the Web. Comput. Networks 33, 309–320.
  • Comets, F., Delarue, F. and Schott, R. (2014). Information transmission under random emission constraints. Combin. Prob. Comput. 23, 973–1009.
  • Cooper, C. and Frieze, A. (2004). The size of the largest strongly connected component of a random digraph with a given degree sequence. Combin. 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).
  • Feller, W. (1968). An Introduction to Probability Theory and Its Applications, Vol. I, 3rd edn. John Wiley, New York.
  • Fenner, T. I. and Frieze, A. M. (1982). On the connectivity of random $m$-orientable graphs and digraphs. Combinatorica 2, 347–359.
  • 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.