A relative anti-concentration inequality

Given two vectors in Euclidean space, how unlikely is it that a random vector has a larger inner product with the shorter vector than with the longer one? When the random vector has independent, identically distributed components, we conjecture that this probability is no more than a constant multiple of the ratio of the Euclidean norms of the two given vectors, up to an additive term to allow for the possibility that the longer vector has more arithmetic structure. We give some partial results to support the basic conjecture.

Comments: 9 pages

Similar Publications

This paper is the first chapter of three of the author's undergraduate thesis. We study the random matrix ensemble of covariance matrices arising from random $(d_b, d_w)$-regular bipartite graphs on a set of $M$ black vertices and $N$ white vertices, for $d_b \gg \log^4 N$. We simultaneously prove that the Green's functions of these covariance matrices and the adjacency matrices of the underlying graphs agree with the corresponding limiting law (e. Read More

The theoretical description of non-renewal stochastic systems is a challenge. Analytical results are often not available or can only be obtained under strong conditions, limiting their applicability. Also, numerical results have mostly been obtained by ad-hoc Monte--Carlo simulations, which are usually computationally expensive when a high degree of accuracy is needed. Read More

We develop a discrete version of paracontrolled distributions as a tool for deriving scaling limits of lattice systems, and we provide a formulation of paracontrolled distribution in weighted Besov spaces. Moreover, we develop a systematic martingale approach to control the moments of polynomials of i.i. Read More

Let $(X_{k})_{k \in \mathbb{Z}}$ be a linear process with values in $\mathbb{R}^{d}$ given by $X_{k}=\sum_{j \in \mathbb{Z}} A_{j-k}\varepsilon_{j}$, where $(A_{j})_{j \in \mathbb{Z}}$ is a sequence of matrices and $(\varepsilon_{j})_{j\in \mathbb{Z}}$ a sequence of independently and identically distributed random vectors. Therefor we derive a central limit theorem and give an application to long-range dependent processes. \\ Furthermore, we investigate a limit theorem for a component wise subordinated multivariate Gaussian process under long-range dependence. Read More

Complex networks in different areas exhibit degree distributions with heavy upper tail. A preferential attachment mechanism in a growth process produces a graph with this feature. We herein investigate a variant of the simple preferential attachment model, whose modifications are interesting for two main reasons: to analyze more realistic models and to study the robustness of the scale free behavior of the degree distribution. Read More

Based on a vast literature on continuous-time moving average processes we suggest an analogue for an autoregressive structure, and from this we combine the two concepts to a model for stationary processes which exhibit an ARMA type behavior. We relate this framework to CARMA processes, and thereby shed light on new aspects of these well-studied processes. Within the model we obtain existence and uniqueness results and study the structure of the solution process. Read More

In the present paper we obtain sufficient conditions for the existence of equivalent martingale measures for L\'{e}vy-driven moving averages and other non-Markovian jump processes. The conditions that we obtain are, under mild assumptions, also necessary. For instance, this is the case for moving averages driven by an $\alpha$-stable L\'{e}vy process with $\alpha \in (1,2]$. Read More

We define the Abelian distribution and study its basic properties. Abelian distributions arise in the context of neural modeling and describe the size of neural avalanches in fully-connected integrate-and-fire models of self-organized criticality in neural systems. Read More

Diffusion approximations have been a popular tool for performance analysis in queueing theory, with the main reason being tractability and computational efficiency. This dissertation is concerned with establishing theoretical guarantees on the performance of steady-state diffusion approximations of queueing systems. We develop a modular framework based on Stein's method that allows us to establish error bounds, or convergence rates, for the approximations. Read More

We study almost sure limiting behavior of extreme and intermediate order statistics arising from strictly stationary sequences. First, we provide sufficient dependence conditions under which these order statistics converges almost surely to the left or right endpoint of the population support, as in the classical setup of sequences of independent and identically distributed random variables. Next, we derive a generalization of this result valid in the class of all strictly stationary sequences. Read More