Berry-Esseen bound of modularity in network

2024/04/16 by Miao, Yu, Yin, Qing
#05C82 #60F05 #FOS: Mathematics #Probability (math.PR)

paper · doi:10.48550/arxiv.2404.10325

Abstract

In this paper, the model is a specific partition of a given network. Berry-Esseen bound and strong law of large numbers of modularity for the partition are proved when the size of the network gets large.

Related

• Cramer's moderate deviations of modularity in network
• On weakly optimal partitions in modular networks
• Maximizing Modularity is hard
• Modularity and Graph Expansion
• Modularity bounds for clusters located by leading eigenvectors of the normalized modularity matrix