The Number of Components in Random Linear Graphs
From MaRDI portal
Publication:3260871
DOI10.1214/aoms/1177706204zbMath0088.11602OpenAlexW2087169066MaRDI QIDQ3260871
R. E. Fagen, W. F. Penney, John Riordan, Thomas L. jun. Austin
Publication date: 1959
Published in: The Annals of Mathematical Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoms/1177706204
Related Items (12)
The enumeration of rooted trees by total height ⋮ Connectivity of finite anisotropic random graphs and directed graphs ⋮ Stochastic recursions on directed random graphs ⋮ The pebbling threshold of the square of cliques ⋮ PageRank on inhomogeneous random digraphs ⋮ PageRank's behavior under degree correlations ⋮ An Operator Approach to the Principle of Inclusion and Exclusion ⋮ Survey sampling in graphs ⋮ Universality for distances in power-law random graphs ⋮ Random matrices and graphs ⋮ The Structure of an Outbreak on a College Campus ⋮ Graph evolution by stochastic additions of points and lines
This page was built for publication: The Number of Components in Random Linear Graphs
