The Concentration and Stability of the Community Detecting Functions on Random Networks

Details The Concentration and Stability of the Community Detecting Functions on Random Networks The Concentration and Stability of the Community Detecting Functions on Random Networks

2012-03-27

arxiv.org/abs/1203.5974v1

Mathematics

Probability

Scientific paper

We propose a general form of community detecting functions for finding the communities or the optimal partition of a random network, and examine the concentration and stability of the function values using the bounded difference martingale method. We derive LDP inequalities for both the general case and several specific community detecting functions: modularity, graph bipartitioning and q-Potts community structure. We also discuss the concentration and stability of community detecting functions on different types of random networks: the sparse and non-sparse networks and some examples such as ER and CL networks.

Affiliated with

Also associated with

No associations

Rating

The Concentration and Stability of the Community Detecting Functions on Random Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Concentration and Stability of the Community Detecting Functions on Random Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Concentration and Stability of the Community Detecting Functions on Random Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-641062