Tight Bounds for the Probability of Connectivity in Random K-out Graphs.
Mansi SoodOsman YaganPublished in: ICC (2021)
Keyphrases
- tight bounds
- upper bound
- probability distribution
- graph matching
- central limit theorem
- topological information
- graph theoretic
- graph representation
- connected components
- conditional probabilities
- random sample
- series parallel
- graph mining
- directed graph
- graph construction
- constraint satisfaction problems
- labeled graphs
- objective function