University of Cambridge > Talks.cam > Statistics > Global testing for dependent Bernoullis

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Global testing for dependent Bernoullis

Download to your calendar using vCal

If you have a question about this talk, please contact Qingyuan Zhao .

Suppose $(X_1,\ldots,X_n)$ are independent Bernoulli random variables with $\mathbb{E}(X_i)= p_i$, and we want to test the global null hypothesis that $p_i=\frac{1}{2}$ for all $i$, versus the alternative that there is a sparse set of size $s$ on which $p_i\ge \frac{1}{2}+A$. The detection boundary of this test in terms of $(s,A)$ is well understood, both in the case when the signal is arbitrary, and when the signal is present in a segment.

We study the above questions when the Bernoullis are dependent, and the dependence is modeled by a graphical model (Ising model). In this case, contrary to what typically happens, dependence can allow detection of smaller signals than the independent case. This phenomenon happens over a wide range of graphs, for both arbitrary signals and segment signals.

This talk is based on joint work with Nabarun Deb, Rajarshi Mukherjee, and Ming Yuan

This talk is part of the Statistics series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Zoom + presence (lecture theatre 2) Electrical Engineering, Department of Engineering - Seminar Room - 9 JJ Thomson Avenue, Cambridge, CB3 0FA Boulind Room 6/7, Homerton College, Hills Road, Cambridge, CB2 8PH

Other talks

Cambridge RNA Club - ONLINE TBC Kirk Public Lecture: Title TBC CSaP Annual Cleevely Lecture 2026 Online Causal Inference Semina Pancreatic cancer - the clinical challenge;  Why the microenvironment matters during pancreatic cancer progression and treatment
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity