Cluster detection in networks using percolation
From MaRDI portal
surveillancemultiple hypothesis testingcluster detectionpercolationconnected componentsscan statisticupper level set scan statisticlargest open cluster within a box
Nonparametric hypothesis testing (62G10) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Hypothesis testing in multivariate analysis (62H15) Probabilistic graphical models (62H22) Interacting random processes; statistical mechanics type models; percolation theory (60K35) General considerations in statistical decision theory (62C05)
Abstract: We consider the task of detecting a salient cluster in a sensor network, that is, 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 with a value below a given threshold. The second method is the upper level set scan test introduced by Patil and Taillie [Statist. Sci. 18 (2003) 457-465]. We establish the performance of these methods in an asymptotic decision- theoretic framework in which the network size increases. These tests have two advantages over the more conventional scan statistic: they do not require previous information about cluster shape, and they are computationally more feasible. We make abundant use of percolation theory to derive our theoretical results, and complement our theory with some numerical experiments.
Recommendations
Cites work
- scientific article; zbMATH DE number 3874387 (Why is no real title available?)
- scientific article; zbMATH DE number 44577 (Why is no real title available?)
- scientific article; zbMATH DE number 1158743 (Why is no real title available?)
- A central limit theorem with applications to percolation, epidemics and Boolean models.
- A deformable template model, with special reference to elliptical templates
- A simulated annealing strategy for the detection of arbitrarily shaped spatial clusters
- A spatial scan statistic
- A tree-based scan statistic for database disease surveillance
- Critical exponents for two-dimensional percolation
- Critical two-point functions and the lace expansion for spread-out high-dimensional percolation and related models.
- Deformable template models: a review.
- Detection of an anomalous cluster in a network
- Distribution of the Length of the Longest Significance Run on a Bernoulli Net and Its Applications
- False Discovery Control for Random Fields
- Geographic and network surveillance via scan statistics for critical area detection
- Honey-pot constrained searching with local sensory information
- Introduction to algorithms.
- Large deviations for discrete and continuous percolation
- Maximal clusters in non-critical percolation and related models
- Near-Optimal Detection of Geometric Objects by Fast Multiscale Methods
- On a new law of large numbers
- On the geometry of random Cantor sets and fractal percolation
- Optimal and fast detection of spatial clusters with scan statistics
- Percolation
- Prospective Time Periodic Geographical Disease Surveillance Using a Scan Statistic
- Runs and scans with applications
- Searching for a trail of evidence in a maze
- Surface order large deviations for Ising, Potts and percolation models
- The Wulff crystal in Ising and percolation models. École d'Été de Probabilités de Saint-Flour XXXIV -- 2004
- The birth of the infinite cluster: Finite-size scaling in percolation
- The probability of a large cluster in supercritical Bernoulli perlocation
- Winterbottom construction for finite range ferromagnetic models: an \(\mathbb L_ 1\)-approach.
Cited in
(8)- Approximate \(\ell_0\)-penalized estimation of piecewise-constant signals on graphs
- Distribution-free detection of structured anomalies: permutation and rank-based scans
- Analysis of percolation behaviors of clustered networks with partial support-dependence relations
- Distributed detection of clusters of arbitrary size
- Detection of an anomalous cluster in a network
- On the detection of transitive clusters in undirected networks
- Detecting the number of clusters in a network
- Detecting a path of correlations in a network
This page was built for publication: Cluster detection in networks using percolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1952439)
