On connectivity, conductance and bootstrap percolation for a random k-out, age-biased graph.
Hüseyin AcanBoris G. PittelPublished in: Random Struct. Algorithms (2020)
Keyphrases
- connected components
- graph connectivity
- random walk
- graph structure
- structured data
- graph theoretic
- graph representation
- graph model
- graph theory
- high quality
- strongly connected
- graph mining
- directed graph
- graph based algorithm
- weighted graph
- bipartite graph
- web graph
- graph matching
- graph clustering
- graph search
- age estimation
- topological information
- stable set
- cross validation