Connectivity of a general class of inhomogeneous random digraphs

DOI10.1002/rsa.20892zbMath1453.82005arXiv1712.03319OpenAlexW2982586439MaRDI QIDQ5113954

Junyu Cao, Mariana Olvera-Cravioto

Publication date: 19 June 2020

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1712.03319

zbMATH Keywords

couplingsscale-free graphsmultitype branching processesinhomogeneous random graphsrandom digraphskernel-based random graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Phase transitions (general) in equilibrium statistical mechanics (82B26) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Related Items (3)

Local weak convergence for PageRank ⋮ Efficient presolving methods for the influence maximization problem ⋮ PageRank's behavior under degree correlations

This page was built for publication: Connectivity of a general class of inhomogeneous random digraphs