Community Detection

A likelihood-ratio type test for stochastic block models with bounded degrees

A fundamental problem in network data analysis is to test Erdos-Renyi model versus a bisection stochastic block model. This problem serves as the foundation of many other problems such as testing-based methods for determining the number of …

Testing Community Structures for Hypergraphs

Many complex networks in real world can be formulated as hypergraphs where community detection has been widely used. However, the fundamental question of whether communities exist or not in an observed hypergraph still remains unresolved. The aim of …

How Many Communities Are There?

Stochastic blockmodels and variants thereof are among the most widely used approaches to community detection for social networks and relational data. A stochastic blockmodel partitions the nodes of a network into disjoint sets, called communities. …

Community detection with nodal information

Community detection is one of the fundamental problems in the study of network data. Most existing community detection approaches only consider edge information as inputs, and the output could be suboptimal when nodal information is available. In …