Cluster Detection in Networks using Percolation

Details Cluster Detection in Networks using Percolation Cluster Detection in Networks using Percolation

2011-04-02

arxiv.org/abs/1104.0338v1

Mathematics

Statistics Theory

Scientific paper

We consider the task of detecting a salient cluster in a sensor network, i.e., an undirected graph with a random variable attached to each node. Motivated by recent research in environmental statistics and the drive to compete with the reigning scan statistic, we explore alternatives based on the percolative properties of the network. The first method is based on the size of the largest connected component after removing the nodes in the network whose value is lower than a given threshold. The second one is the upper level set scan test introduced by Patil and Taillie (2003). We establish their performance in an asymptotic decision theoretic framework where the network size increases. We make abundant use of percolation theory to derive our theoretical results and our theory is complemented with some numerical experiments.

Affiliated with

Also associated with

No associations

Rating

Cluster Detection in Networks using Percolation 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 Cluster Detection in Networks using Percolation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cluster Detection in Networks using Percolation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-131380