Universal lower bound for community structure of sparse graphs.
Vilhelm AgdurNina KamcevFiona SkermanPublished in: CoRR (2023)
Keyphrases
- community structure
- lower bound
- densely connected
- real world networks
- community detection algorithms
- community detection
- complex networks
- upper bound
- real world social networks
- community discovery
- graph clustering
- topological information
- random graphs
- network analysis
- social networks
- graph mining
- branch and bound algorithm
- lower and upper bounds
- branch and bound
- overlapping communities
- objective function
- weighted graph
- bipartite networks
- community formation
- optimal solution
- scale free
- small world
- communities in social networks
- information networks
- graph theoretic
- biological networks
- graph model
- np hard
- degree distribution
- graph matching
- directed graph
- worst case
- high dimensional
- graphical models