On the Minimum Node Degree and k-Connectivity in Inhomogeneous Random K-Out Graphs.
Mansi SoodOsman YaganPublished in: IEEE Trans. Inf. Theory (2021)
Keyphrases
- graph structure
- degree distribution
- directed graph
- undirected graph
- spanning tree
- strongly connected
- finding the shortest path
- graph theoretic
- graph theory
- heavy tailed
- random graphs
- connected components
- topological information
- graph matching
- social networks
- preferential attachment
- edge weights
- markov chain
- minimum cost
- graph model
- power law
- graph structures
- graph mining
- graph connectivity
- power law degree distribution
- neural network
- betweenness centrality
- clustering coefficient
- graph representation
- weighted graph
- shortest path