Comparing the sensitivity of social networks, web graphs, and random graphs with respect to vertex removal.
Christoph MartinPeter NiemeyerPublished in: CoRR (2014)
Keyphrases
- web graph
- random graphs
- social networks
- directed graph
- undirected graph
- ranking algorithm
- small world
- attributed graphs
- link analysis
- graph theoretic
- random walk
- social network analysis
- complex networks
- community structure
- degree distribution
- directed acyclic graph
- phase transition
- link prediction
- online social networks
- social media
- web pages
- graph structure
- graph mining
- social interaction
- social relationships
- community detection
- network structure
- special case
- data analysis