Berry-Esseen bound of modularity in network
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.