Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T09:35:37.187Z Has data issue: false hasContentIssue false

Birth of a Strongly Connected Giant in an Inhomogeneous Random Digraph

Published online by Cambridge University Press:  04 February 2016

Mindaugas Bloznelis*
Affiliation:
Vilnius University
Friedrich Götze*
Affiliation:
Bielefeld University
Jerzy Jaworski*
Affiliation:
Adam Mickiewicz University
*
∗ Postal address: Vilnius University, Naugarduko 24, LT-03225 Vilnius, Lithuania. Email address: mindaugas.bloznelis@mif.vu.lt
∗∗ Postal address: Faculty of Mathematics, Bielefeld University, D-33501 Bielefeld, Germany. Email address: goetze@math.uni-bielefeld.de
∗∗∗ Postal address: Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Umultowska 87, 61-614 Poznań, Poland. Email address: jaworski@amu.edu.pl
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
© Applied Probability Trust