相关论文: Soft Covering Through the Lens of Hypothesis Testi…

In this paper, we derive a central limit theorem for collections of weakly correlated random variables indexed by discrete metric spaces, where the correlation decays in the distance of the indices. The correlation structure we study…

We explore the fundamental limits of heterogeneous distributed detection in an anonymous sensor network with n sensors and a single fusion center. The fusion center collects the single observation from each of the n sensors to detect a…

We show that the empirical process associated with a system of weakly interacting diffusion processes exhibits a form of noise-induced metastability. The result is based on an analysis of the associated McKean--Vlasov free energy, which,…

Accurate determination of the electron energy probability function (EEPF) is vital for understanding electron kinetics and energy distributions in plasmas. However, interpreting Langmuir probe current-voltage (I-V) characteristics is often…

The design of asymptotically minimax robust hypothesis testing is formalized for the Bayesian and Neyman-Pearson tests of Type-I and Type-II. The uncertainty classes based on the KL-divergence, $\alpha$-divergence, symmetrized…

The matched filter (MF) represents one of the main tools to detect signals from known sources embedded in the noise. In the Gaussian case the noise is assumed to be the realization of a Gaussian random field (GRF). The most important…

In this paper, we propose a simple and easy-to-implement Bayesian hypothesis test for the presence of an association, described by Kendall's \tau coefficient, between two variables measured on at least an ordinal scale. Owing to the absence…

The ability to automatically and robustly self-verify periodicity present in time-series astronomical data is becoming more important as data sets rapidly increase in size. The age of large astronomical surveys has rendered manual…

Random constraint satisfaction problems (CSPs) such as random $3$-SAT are conjectured to be computationally intractable. The average case hardness of random $3$-SAT and other CSPs has broad and far-reaching implications on problems in…

Interactive encoding and decoding based on binary low-density parity-check codes with syndrome accumulation (SA-LDPC-IED) is proposed and investigated. Assume that the source alphabet is $\mathbf{GF}(2)$, and the side information alphabet…

Correlation analysis is a fundamental problem in statistics. In this paper, we consider the correlation detection problem between a pair of Erdos-Renyi graphs. Specifically, the problem is formulated as a hypothesis testing problem: under…

We consider statistical hypothesis testing simultaneously over a fairly general, possibly uncountably infinite, set of null hypotheses, under the assumption that a suitable single test (and corresponding $p$-value) is known for each…

We provide a tight asymptotic characterization of the error exponent for classical-quantum channel coding assisted by activated non-signaling correlations. Namely, we find that the optimal exponent--also called reliability function--is…

In this paper, we consider the problem of variable-length source coding allowing errors. The exponential moment of the codeword length is analyzed in the non-asymptotic regime and in the asymptotic regime. Our results show that the smooth…

We derive the essentials of the skewed weak lensing likelihood via a simple Hierarchical Model. Our likelihood passes four objective and cosmology-independent tests which a standard Gaussian likelihood fails. We demonstrate that sound weak…

Hypergraph product codes are a class of constant-rate quantum low-density parity-check (LDPC) codes equipped with a linear-time decoder called small-set-flip (SSF). This decoder displays sub-optimal performance in practice and requires very…

Interval censoring arises frequently in clinical, epidemiological, financial, and sociological studies, where the event or failure of interest is known only to occur within an interval induced by periodic monitoring. We formulate the…

Error probabilities of random codes for memoryless channels are considered in this paper. In the area of communication systems, admissible error probability is very small and it is sometimes more important to discuss the relative gap…

We consider the problem of modulation and estimation of a random parameter $U$ to be conveyed across a discrete memoryless channel. Upper and lower bounds are derived for the best achievable exponential decay rate of a general moment of the…

The paper addresses a sequential changepoint detection problem, assuming that the duration of change may be finite and unknown. This problem is of importance for many applications, e.g., for signal and image processing where signals appear…