The Number of Components in Random Linear Graphs

DOI10.1214/AOMS/1177706204zbMATH Open0088.11602OpenAlexW2087169066MaRDI QIDQ3260871FDOQ3260871

Authors: Thomas L. jun. Austin, R. E. Fagen, W. F. Penney, John Riordan 

Publication date: 1959

Published in: Annals of Mathematical Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aoms/1177706204

zbMATH Keywords

probability theory

Cited In (12)

• PageRank on inhomogeneous random digraphs
• Random matrices and graphs
• The pebbling threshold of the square of cliques
• Universality for distances in power-law random graphs
• The enumeration of rooted trees by total height
• Stochastic recursions on directed random graphs
• Graph evolution by stochastic additions of points and lines
• An Operator Approach to the Principle of Inclusion and Exclusion
• The structure of an outbreak on a college campus
• Survey sampling in graphs
• PageRank's behavior under degree correlations
• Connectivity of finite anisotropic random graphs and directed graphs

This page was built for publication: The Number of Components in Random Linear Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3260871)