162,667 research outputs found
A nonparametric two-sample hypothesis testing problem for random dot product graphs
We consider the problem of testing whether two finite-dimensional random dot
product graphs have generating latent positions that are independently drawn
from the same distribution, or distributions that are related via scaling or
projection. We propose a test statistic that is a kernel-based function of the
adjacency spectral embedding for each graph. We obtain a limiting distribution
for our test statistic under the null and we show that our test procedure is
consistent across a broad range of alternatives.Comment: 24 pages, 1 figure
Multiple testing, uncertainty and realistic pictures
We study statistical detection of grayscale objects in noisy images. The
object of interest is of unknown shape and has an unknown intensity, that can
be varying over the object and can be negative. No boundary shape constraints
are imposed on the object, only a weak bulk condition for the object's interior
is required. We propose an algorithm that can be used to detect grayscale
objects of unknown shapes in the presence of nonparametric noise of unknown
level. Our algorithm is based on a nonparametric multiple testing procedure. We
establish the limit of applicability of our method via an explicit,
closed-form, non-asymptotic and nonparametric consistency bound. This bound is
valid for a wide class of nonparametric noise distributions. We achieve this by
proving an uncertainty principle for percolation on finite lattices.Comment: This paper initially appeared in January 2011 as EURANDOM Report
2011-004. Link to the abstract at EURANDOM Repository:
http://www.eurandom.tue.nl/reports/2011/004-abstract.pdf Link to the paper at
EURANDOM Repository: http://www.eurandom.tue.nl/reports/2011/004-report.pd
Changepoint Detection over Graphs with the Spectral Scan Statistic
We consider the change-point detection problem of deciding, based on noisy
measurements, whether an unknown signal over a given graph is constant or is
instead piecewise constant over two connected induced subgraphs of relatively
low cut size. We analyze the corresponding generalized likelihood ratio (GLR)
statistics and relate it to the problem of finding a sparsest cut in a graph.
We develop a tractable relaxation of the GLR statistic based on the
combinatorial Laplacian of the graph, which we call the spectral scan
statistic, and analyze its properties. We show how its performance as a testing
procedure depends directly on the spectrum of the graph, and use this result to
explicitly derive its asymptotic properties on few significant graph
topologies. Finally, we demonstrate both theoretically and by simulations that
the spectral scan statistic can outperform naive testing procedures based on
edge thresholding and testing
Derandomization and Group Testing
The rapid development of derandomization theory, which is a fundamental area
in theoretical computer science, has recently led to many surprising
applications outside its initial intention. We will review some recent such
developments related to combinatorial group testing. In its most basic setting,
the aim of group testing is to identify a set of "positive" individuals in a
population of items by taking groups of items and asking whether there is a
positive in each group.
In particular, we will discuss explicit constructions of optimal or
nearly-optimal group testing schemes using "randomness-conducting" functions.
Among such developments are constructions of error-correcting group testing
schemes using randomness extractors and condensers, as well as threshold group
testing schemes from lossless condensers.Comment: Invited Paper in Proceedings of 48th Annual Allerton Conference on
Communication, Control, and Computing, 201
- …