Connectivity of a general class of inhomogeneous random digraphs. Issue 3 (29th October 2019)

• Record Type: Journal Article
• Authors: Cao, Junyu; Olvera‐Cravioto, Mariana
• Is Part Of: Random structures & algorithms. Volume 56:Issue 3(2020)
• Page Start: 722
• Page End: 774
• Publication Date: 2019-10-29
• Subjects: couplings -- inhomogeneous random graphs -- kernel‐based random graphs -- multitype branching processes -- random digraphs -- scale‐free graphs; Random graphs -- Periodicals; Mathematical analysis -- Periodicals; 519
• DOI: 10.1002/rsa.20892
• Languages: English
• ISSNs: 1042-9832

Abstract

Abstract : We study a family of directed random graphs whose arcs are sampled independently of each other, and are present in the graph with a probability that depends on the attributes of the vertices involved. In particular, this family of models includes as special cases the directed versions of the Erdős‐Rényi model, graphs with given expected degrees, the generalized random graph, and the Poissonian random graph. We establish a phase transition for the existence of a giant strongly connected component and provide some other basic properties, including the limiting joint distribution of the degrees and the mean number of arcs. In particular, we show that by choosing the joint distribution of the vertex attributes according to a multivariate regularly varying distribution, one can obtain scale‐free graphs with arbitrary in‐degree/out‐degree dependence.