Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs.
Boris G. PittelDaniel J. PoolePublished in: Random Struct. Algorithms (2016)
Keyphrases
- uniformly distributed
- high dimensional
- large deviations
- central limit theorem
- heavy tailed
- worst case
- probability distribution
- sparse representation
- laplace transform
- asymptotically optimal
- spatial distribution
- sparse data
- compressive sensing
- undirected graph
- power law
- compressed sensing
- probability density function
- data sets
- random samples
- connected components
- line segments