Local Clustering Tests and Botnet Localization in Sparse Random Geometric Networks
Luca Di Persio, Gianmarco Bet, Youness Outaleb
Abstract
We use local clustering to test for botnets in sparse random geometric networks. Under the null hypothesis, the vertices are independent uniform points on a fixed-dimensional torus, with edges determined by a distance threshold. Under the alternative, an unknown set of vertices ignores the geometry and connects independently with the same marginal edge probability. Every prescribed vertex has the same marginal binomial degree law under both hypotheses, so its degree alone carries no information. Triangle closure, however, distinguishes the two models. Under the null, conditional on a degree of at least two, the local clustering coefficient has exact mean Cd>0, a known constant that depends only on the dimension. Under the alternative, the corresponding mean is pn for a bot. For a non-bot, the corresponding mixture mean converges to Cd when the botnet size is o(n). We prove non-asymptotic concentration bounds, an exponential bound on the worst-case risk of a scan test, and exact-support recovery. For every deterministic sequence 1≤ kn=o(n), if μn=(n-1)pn satisfies μn/ n∞, the local rule recovers the botnet with probability tending to one, uniformly over all label sets of size kn. The proof combines geometric U-statistics, bounded differences on random neighborhoods, and a stability bound showing that genuine vertices retain their geometric clustering when bots form only a vanishing fraction of their neighbors. The test does not use the latent positions. The theorem assumes that the model parameters are known, although Cd can instead be estimated consistently. In the high-expected-degree regime, the rule also works for a single bot.
Create a lesson
Related papers
Anytime-valid inference for time series via self-normalization
Tim Kutta, Xiaofeng Shao
Simple Private Noisy SGD is Minimax-Optimal under Population Strong Convexity
Valentin Roth, Marco Avella Medina
Asymptotic efficiency comparison of explicit Dirichlet shape estimators
Ioannis Oikonomidis, Samis Trevezas
Sharp minimax rates and adaptive estimation of latent proportions in bivariate Poisson mixtures
Essoham Ali
Inference in High-Dimensional Linear Mediation Models
Samriddha Lahiry, Rajarshi Mukherjee, Pragya Sur
Gaussian Quasi-Likelihood Estimation for Nonsynchronously Observed Lévy processes
Teppei Ogihara, Yuma Uehara