English
Related papers

Related papers: On Littlewood-Offord theory for arbitrary distribu…

200 papers

We give the distribution of $M_n$, the maximum of a sequence of $n$ observations from a moving average of order 1. Solutions are first given in terms of repeated integrals and then for the case where the underlying independent random…

Methodology · Statistics 2009-09-07 Christopher S. Withers , Saralees Nadarajah

For the basic maximum likelihood estimating function of the two parameters Weibull distribution, a simple proof on its global monotonicity is given to ensure the existence and uniqueness of its solution. The boundary of the function's…

Methodology · Statistics 2009-10-04 DeTao Mao , Wenyuan Li

Let $X_1,..., X_n$ be i.i.d.\ copies of a random variable $X=Y+Z,$ where $ X_i=Y_i+Z_i,$ and $Y_i$ and $Z_i$ are independent and have the same distribution as $Y$ and $Z,$ respectively. Assume that the random variables $Y_i$'s are…

Statistics Theory · Mathematics 2018-04-17 Shota Gugushvili , Bert van Es , Peter Spreij

The paper deals with studying a connection of the Littlewood--Offord problem with estimating the concentration functions of some symmetric infinitely divisible distributions.

Probability · Mathematics 2022-11-15 Friedrich Götze , Andrei Yu. Zaitsev

We consider upper exponential bounds for the probability of the event that an absolute deviation of sample mean from mathematical expectation p is bigger comparing with some ordered level epsilon. These bounds include 2 coefficients {alpha,…

Probability · Mathematics 2010-04-13 Vladimir Nikulin

In the classical optimal stopping problem, a player is given a sequence of random variables $X_1\ldots X_n$ with known distributions. After observing the realization of $X_i$, the player can either accept the observed reward from $X_i$ and…

Discrete Mathematics · Computer Science 2020-07-24 Shipra Agrawal , Jay Sethuraman , Xingyu Zhang

We prove optimal constant over root $n$ upper bounds for the maximal probabilities of $n$th convolution powers of discrete uniform distributions.

Probability · Mathematics 2007-06-07 Lutz Mattner , Bero Roos

It is well known that a random vector with given marginal distributions is comonotonic if and only if it has the largest sum with respect to the convex order [ Kaas, Dhaene, Vyncke, Goovaerts, Denuit (2002), A simple geometric proof that…

Risk Management · Quantitative Finance 2016-05-10 Chuancun Yin , Dan Zhu

We provide algorithms that learn simple auctions whose revenue is approximately optimal in multi-item multi-bidder settings, for a wide range of valuations including unit-demand, additive, constrained additive, XOS, and subadditive. We…

Computer Science and Game Theory · Computer Science 2017-09-04 Yang Cai , Constantinos Daskalakis

The bounds for absolute moments of order statistics are established. Let $X_1,\dots ,X_n$ be independent identically distributed real-valued random variables and let $X_{1:n}\le \dots \le X_{n:n}$ be the corresponding order statistics. The…

Probability · Mathematics 2016-08-01 Nadezhda V. Gribkova

We study the problem of model selection type aggregation with respect to the Kullback-Leibler divergence for various probabilistic models. Rather than considering a convex combination of the initial estimators $f_1, \ldots, f_N$, our…

Statistics Theory · Mathematics 2016-01-22 Cristina Butucea , Jean-François Delmas , Anne Dutfoy , Richard Fischer

This paper considers the asymptotic distribution of the longest edge of the minimal spanning tree and nearest neighbor graph on X_1,...,X_{N_n} where X_1,X_2,... are i.i.d. in \Re^2 with distribution F and N_n is independent of the X_i and…

Probability · Mathematics 2007-05-23 Tailen Hsing , Holger Rootzen

We consider the Random Euclidean Assignment Problem in dimension $d=1$, with linear cost function. In this version of the problem, in general, there is a large degeneracy of the ground state, i.e. there are many different optimal matchings…

Probability · Mathematics 2021-07-16 Sergio Caracciolo , Vittorio Erba , Andrea Sportiello

Suppose a customer is faced with a sequence of fluctuating prices, such as for airfare or a product sold by a large online retailer. Given distributional information about what price they might face each day, how should they choose when to…

Data Structures and Algorithms · Computer Science 2019-10-10 Hossein Esfandiari , MohammadTaghi HajiAghayi , Brendan Lucier , Michael Mitzenmacher

We give the distribution of $M_n$, the maximum of a sequence of $n$ observations from a moving average of order 1. Solutions are first given in terms of repeated integrals and then for the case where the underlying independent random…

Methodology · Statistics 2009-04-06 Christopher S. Withers , Saralees Nadarajah

Given natural parameters s and r, where $2\leq s\leq r$, we consider the distribution of a random variable $\xi=\sum\limits_{k=1}^{\infty}s^{-k}\xi_k\equiv\Delta^{r_s}_{\xi_1\xi_2...\xi_k...},$ where $(\xi_k)$ is a sequence of independent…

Probability · Mathematics 2026-01-06 Mykola Pratsiovytyi , Sofiia Ratushniak

Let $\zeta = \xi + i\xi'$ where $\xi, \xi'$ are iid copies of a mean zero, variance one, subgaussian random variable. Let $N_n$ be a $n \times n$ random matrix with entries that are iid copies of $\zeta$. We prove that there exists a $c \in…

Probability · Mathematics 2017-10-10 Kyle Luh

Given a star-shaped domain $K\subseteq \mathbb R^d$, $n$ vectors $v_1,\dots,v_n \in \mathbb R^d$, a number $R>0$, and i.i.d. random variables $\eta_1,\dots,\eta_n$, we study the geometric and arithmetic structure of the set of vectors $V =…

Probability · Mathematics 2015-10-15 Omer Friedland , Ohad Giladi , Olivier Guédon

We derive an upper bound for the annealed return probability for the simple random walk on supercritical Bienaym\'e-Galton-Watson trees. The bound decays subexponentially in time $t$ with $t^{1/3}$ in the exponent. It is valid for all…

Probability · Mathematics 2026-03-04 Markus Heydenreich , Peter Müller , Sara Terveer

In this work, we continue the line of research on the complexity of distributions (Viola, Journal of Computing 2012), and study samplers defined by low degree polynomials. An $n$-tuple $P = (P_1,\dots, P_n)$ of functions $P_i \colon…

Computational Complexity · Computer Science 2026-05-05 Mohammad Mahdi Khodabandeh , Igor Shinkar
‹ Prev 1 4 5 6 7 8 10 Next ›