Optimal de-anonymization in random graphs with community structure.
Efe OnaranSiddharth GargElza ErkipPublished in: Sarnoff Symposium (2016)
Keyphrases
- random graphs
- community structure
- complex networks
- community detection
- graph theoretic
- network analysis
- small world
- social networks
- community discovery
- communities in social networks
- bipartite networks
- social network data
- scale free
- phase transition
- optimal solution
- real world networks
- biological networks
- network structure
- community detection algorithms
- worst case
- community formation