Detecting Planted Structure in Circular Data
By: Taha Ameen, Bruce Hajek
Potential Business Impact:
Finds hidden patterns in circle-shaped data.
Hypothesis testing problems for circular data are formulated, where observations take values on the unit circle and may contain a hidden, phase-coherent structure. Under the null, the data are independent uniform on the unit circle; under the alternative, either (i) a planted subset of size K concentrates around an unknown phase (the flat setting), or (ii) a planted community of size k induces coherence among the edges of a complete graph (the community setting). In each of the two settings, two circular signal distributions are considered: a hard-cluster distribution, where correlated planted observations lie in an arc of known length and unknown location, and a von Mises distribution, where correlated planted observations follow a von Mises distribution with a common unknown location parameter. For each of the four resulting models, nearly matching necessary and sufficient conditions are derived (up to constants and occasional logarithmic factors) for detectability, thereby establishing information-theoretic phase transitions.
Similar Papers
Cluster expansion of the log-likelihood ratio: Optimal detection of planted matchings
Statistics Theory
Finds hidden patterns in connected data.
Finding Planted Cycles in a Random Graph
Statistics Theory
Finds hidden loops in computer networks.
Robust Detection of Planted Subgraphs in Semi-Random Models
Information Theory
Find hidden groups even when some connections are hidden.