A novel use of stochastic approximation algorithms for estimating degree of each node in social networks.
Maziyar HamdiVikram KrishnamurthyPublished in: ICASSP (2012)
Keyphrases
- approximation algorithms
- social networks
- approximation schemes
- undirected graph
- degree distribution
- np hard
- special case
- worst case
- vertex cover
- facility location problem
- minimum cost
- open shop
- disjoint paths
- primal dual
- social network analysis
- np hardness
- network design problem
- approximation ratio
- randomized algorithms
- online social networks
- constant factor
- graph structure
- clustering coefficient
- precedence constraints
- polynomial time approximation
- link prediction
- small world
- betweenness centrality
- tie strength
- combinatorial auctions
- directed graph
- centrality measures
- set cover
- complex networks
- network structure
- graphical models
- lower bound
- objective function