SearcharxivSearch

arXiv · 2412.03774

Refining Concentration for Gaussian Quadratic Chaos with Applications in Sonar and Communications

Abstract

The paper studies concentration of measure for Gaussian quadratic chaos in the non-asymptotic regime where existing bounds are improved and new bounds are proposed. We begin by slightly tightening Hanson-Wright inequality (HWI) by increasing its absolute constant from the largest known value of 0.125 to at least 0.145 in the symmetric case. A sharper version of an inequality of Laurent and Massart (LMI) is presented. It results in an increase in the absolute constant in HWI from the largest available value of $1-\frac{\sqrt{3}}{2}$ due to LMI to $\frac{9-\sqrt{17}}{32}$ in the positive-semidefinite case. Moving beyond HWI, we develop a sequence of inequalities indexed by $m\ge1$ that involves Schatten norms of the underlying symmetric matrix. The case $m=1$ recovers HWI and the case $m=\infty$ leads to a novel bound called the $m_\infty$-bound. Avoiding Markov's inequality, we introduce the strong $\chi^2$-inequality and its loosened version, the weak $\chi^2$-inequality. To investigate the $m_\infty$-bound, we explore all concentration bounds that only involve the operator norm of the underlying positive-definite matrix. Five candidates are examined, namely, the $m_\infty$-bound, relaxed versions of HWI and LMI, the weak $\chi^2$-bound and the large deviations bound. The sharpest among these bounds is either the $m_\infty$-bound or the weak $\chi^2$-bound. If the matrix dimension is $n=2,4,6$, the weak $\chi^2$-bound is tighter than the $m_\infty$-bound. For even $n\ge8$, the $m_\infty$-bound is sharper than the weak $\chi^2$-bound if and only if the ratio of the tail parameter over the operator norm lies inside an open interval which expands indefinitely as $n$ grows. Modified versions of HW, $m_\infty$ and strong $\chi^2$ inequalities of various orders are proposed. Their effectiveness is demonstrated by two applications in signal detection for sonar and wireless communications.

Explore related subjects

Keep this discovery

BibTeXRIS

Kamyar Moshksar. 2024-12-04. Refining Concentration for Gaussian Quadratic Chaos with Applications in Sonar and Communications. https://arxiv.org/abs/2412.03774

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR