On Random Walks and Random Sampling to Find Max Degree Nodes in Assortative Erdos Renyi Graphs.
Jonathan StokesSteven WeberPublished in: GLOBECOM (2016)
Keyphrases
- random sampling
- random walk
- directed graph
- average degree
- nodes of a graph
- degree distribution
- small world
- sampling algorithm
- sample size
- graph structure
- active learning
- undirected graph
- random graphs
- spectral methods
- graph structures
- link prediction
- adjacency matrix
- proximity measures
- scale free
- random samples
- clustering coefficient
- markov chain
- sliding window
- markov random walk
- web graph
- power law
- random sample
- social networks
- graph mining
- weighted graph
- path length
- complex networks
- search space