Empirical likelihood test for community structure in networks
arXiv (Cornell University)(2023)
摘要
Network data, characterized by interconnected nodes and edges, is pervasive in various domains and has gained significant popularity in recent years. In network data analysis, testing the presence of community structure in a network is one of the important research tasks. Existing tests are mainly developed for unweighted networks. In this paper, we study the problem of testing the existence of community structure in general (either weighted or unweighted) networks. We propose two new tests: the Weighted Signed-Triangle (WST) test and the empirical likelihood (EL) test. Both tests can be applied to weighted or unweighted networks and outperform existing tests for small networks. The EL test may outperform the WST test for small networks.
更多查看译文
关键词
community structure,empirical likelihood test,networks
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要