Related papers: Matching marginals and sums

A little-known and highly economical characterization of the real interval [0, 1], essentially due to Freyd, states that the interval is homeomorphic to two copies of itself glued end to end, and, in a precise sense, is universal as such.…

We compute analytically the joint probability density of eigenvalues and the level spacing statistics for an ensemble of random matrices with interesting features. It is invariant under the standard symmetry groups (orthogonal and unitary)…

Corresponding to $n$ independent non-negative random variables $X_1,...,X_n$, are values $M_1,...,M_n$, where each $M_i$ is the expected value of the maximum of $n$ independent copies of $X_i$. We obtain an upper bound to the expected value…

We construct a uniformly discrete sequence $\{\lambda_1 < \lambda_2 < \cdots\} \subset \mathbb{R}$ and functions $g$ and $\{g_n^*\}$ in $L^2(\mathbb{R})$, such that every $f \in L^2(\mathbb{R})$ admits a series expansion \[ f(x) =…

We extend, in the free probability framework, an invariance principle for multilinear homogeneous sums with low influences recently established in [E. Mossel, R. O'Donnell and K. Oleszkiewicz (2010). Noise stability of functions with low…

Let $X_1,X_2, \ldots $ be independent random uniform points in a bounded domain $A \subset \mathbb{R}^d$ with smooth boundary. Define the coverage threshold $R_n$ to be the smallest $r$ such that $A$ is covered by the balls of radius $r$…

Let {(X_i,Y_i)}_{i=1}^n be a sequence of independent bivariate random vectors. In this paper, we establish a refined Cram\'er type moderate deviation theorem for the general self-normalized sum \sum_{i=1}^n X_i/(\sum_{i=1}^n Y_i^2)^{1/2},…

Two Bayesian models with different sampling densities are said to be marginally equivalent if the joint distribution of observables and the parameter of interest is the same for both models. We discuss marginal equivalence in the general…

We construct a family of self-similar Markov martingales with given marginal distributions. This construction uses the self-similarity and Markov property of a reference process to produce a family of Markov processes that possess the same…

Let M be a noncompact metric space in which every closed ball is compact, and let G be a semigroup of Lipschitz mappings of M. Denote by (Y_n)_{n\geq1} a sequence of independent G-valued, identically distributed random variables (r.v.'s),…

Let $\log^{2+\varepsilon} n \le d \le n/2$ for some fixed $\varepsilon \in (0,1)$, and let $M_n$ be an $n\times n$ random matrix with entries in ${0,1}$, where each row is independently and uniformly sampled from the set of all vectors in…

We establish a generic symmetrization property for dependent random variables $\{x_{t}\}_{t=1}^{n}$ on $\mathbb{R}^{p}$, where $p$ $>>$ $n$ is allowed. We link $\mathbb{E}\psi (\max_{1\leq i\leq p}|1/n\sum_{t=1}^{n}(x_{i,t}$ $-$…

Let $X^1, ..., X^k$ and $Y^1, ..., Y^m$ be jointly independent copies of random variables $X$ and $Y$, respectively. For a fixed total number $n$ of random variables, we aim at maximising $M(k,m):= E \max \{X^1, ..., X^k, Y^1, >..., Y^{m}…

We say that a random integer variable $X$ is monotone if the modulus of the characteristic function of $X$ is decreasing on $[0,\pi]$. This is the case for many commonly encountered variables, e.g., Bernoulli, Poisson and geometric random…

For a general family of non-negative functions matching upper and lower bounds are established for their average over the values of any equidistributed sequence.

Let $X$ be a symmetric random matrix with independent but non-identically distributed centered Gaussian entries. We show that $$ \mathbf{E}\|X\|_{S_p} \asymp \mathbf{E}\Bigg[ \Bigg(\sum_i\Bigg(\sum_j X_{ij}^2\Bigg)^{p/2}\Bigg)^{1/p} \Bigg]…

Continuing the study reported in Satheesh (2001),(arXiv:math.PR/0304499 dated 01May2003) here we study certain aspects of randomization in infinitely divisible (ID) and max-infinitely divisible (MID) laws. They generalize ID and MID laws.…

Consider the following prediction problem. Assume that there is a block box that produces bits according to some unknown computable distribution on the binary tree. We know first $n$ bits $x_1 x_2 \ldots x_n$. We want to know the…

We prove a structural result for degree-$d$ polynomials. In particular, we show that any degree-$d$ polynomial, $p$ can be approximated by another polynomial, $p_0$, which can be decomposed as some function of polynomials $q_1,...,q_m$ with…

(This is the third version of a working paper.) We develop a family of self-normalized concentration inequalities for marginal mean under martingale-difference structure and $\phi/\tilde{\phi}$-mixing conditions, where the latter includes…