English
Related papers

Related papers: Self-normalized Cram\'{e}r type moderate deviation…

200 papers

Stein's method is used to obtain two theorems on multivariate normal approximation. Our main theorem, Theorem 1.2, provides a bound on the distance to normality for any nonnegative random vector. Theorem 1.2 requires multivariate size bias…

Probability · Mathematics 2007-05-23 Larry Goldstein , Yosef Rinott

If each edge (u,v) of a graph G=(V,E) is decorated with a permutation pi_{u,v} of k objects, we say that it has a permuted k-coloring if there is a coloring sigma from V to {1,...,k} such that sigma(v) is different from pi_{u,v}(sigma(u))…

Combinatorics · Mathematics 2011-11-16 Varsha Dani , Cristopher Moore , Anna Olson

Three algorithms of Gram-Schmidt type are given that produce an orthogonal decomposition of finite $d$-dimensional symmetric, alternating, or Hermitian forms over division rings. The first uses $d^3/3+O(d^2)$ ring operations with very…

Numerical Analysis · Mathematics 2020-11-23 James B. Wilson

Using martingale methods, we obtain some upper bounds for large and moderate deviations of products of independent and identically distributed elements of GL d (R). We investigate all the possible moment conditions, from super-exponential…

Probability · Mathematics 2016-10-25 Christophe Cuny , Jérôme Dedecker , Florence Merlevède

The position $x(t)$ of a particle diffusing in a one-dimensional uncorrelated and time dependent random medium is simply Gaussian distributed in the typical direction, i.e. along the ray $x=v_0 t$, where $v_0$ is the average drift. However,…

Statistical Mechanics · Physics 2021-08-05 Guillaume Barraquand , Pierre Le Doussal

In order to characterize the fluctuation between the ergodic limit and the time-averaging estimator of a full discretization in a quantitative way, we establish a central limit theorem for the full discretization of the parabolic stochastic…

Probability · Mathematics 2022-02-21 Chuchu Chen , Tonghe Dang , Jialin Hong , Tau Zhou

This survey concerns regular graphs that are extremal with respect to the number of independent sets, and more generally, graph homomorphisms. More precisely, in the family of of $d$-regular graphs, which graph $G$ maximizes/minimizes the…

Combinatorics · Mathematics 2017-11-03 Yufei Zhao

Let $(Z_{n})$ be a supercritical branching process in a random environment $\xi $, and $W$ be the limit of the normalized population size $Z_{n}/\mathbb{E}[Z_{n}|\xi ]$. We show large and moderate deviation principles for the sequence $\log…

Probability · Mathematics 2013-02-19 Chunmao Huang , Quansheng Liu

This paper investigates the stochastic Ricker difference equation $X_{n+1} = X_n \exp(r(1-X_n)) \varepsilon_n$, where $X_n$ is a random variable representing the population size and $\{\varepsilon_n\}$ denotes independent random…

Probability · Mathematics 2026-01-29 Haiyan Wang , Melinda Wang

We consider entropically regularized, semi-discrete versions of variational problems on the set of probability measures involving optimal transport as well as other terms. We prove that the solutions can be characterized by well-posed…

Optimization and Control · Mathematics 2026-04-07 Adrien Cances , Luca Nenna , Daniyar Omarov , Brendan Pass

The estimation of normalizing constants is a fundamental step in probabilistic model comparison. Sequential Monte Carlo methods may be used for this task and have the advantage of being inherently parallelizable. However, the standard…

Machine Learning · Statistics 2016-08-16 Marco Fraccaro , Ulrich Paquet , Ole Winther

Optimal stability estimates in the class of regularized distributions are derived for the characterization of normal laws in Cramer's theorem with respect to relative entropy and Fisher information distance.

Probability · Mathematics 2015-12-14 S. G. Bobkov , G. P. Chistyakov , F. Götze

Let $\{X_{n}, n\ge 1\}$ be a sequence of independent random variables with common general error distribution $GED(v)$ with shape parameter $v>0$, and let $M_{n,r}$ denote the $r$th largest order statistics of $X_{1}, X_{2}, \cdots, X_{n}$.…

Probability · Mathematics 2019-05-07 Yingyin Lu , Zuoxiang Peng

We consider the problem of distributed mean estimation (DME), in which $n$ machines are each given a local $d$-dimensional vector $x_v \in \mathbb{R}^d$, and must cooperate to estimate the mean of their inputs $\mu = \frac 1n\sum_{v = 1}^n…

Machine Learning · Computer Science 2021-04-08 Peter Davies , Vijaykrishna Gurunathan , Niusha Moshrefi , Saleh Ashkboos , Dan Alistarh

This paper considers a variation of the full-information secretary problem where the random variables to be observed are independent but not necessary identically distributed. The main result is a sharp lower bound for the optimal win…

Probability · Mathematics 2018-12-12 Pieter C. Allaart , Jose A. Islas

Here we develop a first order autoregressive model {Xn} that is marginally stationary where Xn is the sum/ extreme of k i.i.d observations. We prove that stationary solutions to these models are either semi-selfdecomposable/…

Probability · Mathematics 2007-05-23 S Satheesh , E Sandhya , S Sherly

We study asymptotic probabilities of attaining the maximum in heterogeneous Gaussian samples. In the two-group setting, the first sample has variance $1$ and size $n_1$, while the second has variance $\sigma^2>1$ and size $n_2$. We…

Probability · Mathematics 2026-05-21 Chunxu Zhang , Baiqi Miao , Tiantian Mao

Estimates are constructed for the deviation of the concentration functions of sums of independent random variables with finite variances from the folded normal distribution function without any assumptions concerning the existence of the…

Probability · Mathematics 2016-08-11 V. Yu. Korolev , A. V. Dorofeeva

For normalized sums $Z_n$ of i.i.d. random variables, we explore necessary and sufficient conditions which guarantee the normal approximation with respect to the R\'enyi divergence of infinite order. In terms of densities $p_n$ of $Z_n$,…

Probability · Mathematics 2024-06-21 Sergey G. Bobkov , Friedrich Götze

A proper vertex coloring of a graph is equitable if the sizes of color classes differ by at most 1. The equitable chromatic number of a graph $G$, denoted by $\chi_=(G)$, is the minimum $k$ such that $G$ is equitably $k$-colorable. The…

Combinatorics · Mathematics 2012-10-02 Zhidan Yan , Wei Wang
‹ Prev 1 8 9 10 Next ›