English
Related papers

Related papers: Tail bounds for the O'Connell-Yor polymer

200 papers

We study deviation of U-statistics when samples have heavy-tailed distribution so the kernel of the U-statistic does not have bounded exponential moments at any positive point. We obtain an exponential upper bound for the tail of the…

Probability · Mathematics 2023-01-30 Milad Bakhshizadeh

In this paper non-asymptotic exponential estimates are derived for the tail distribution of polynomial martingale differences in terms unconditional tails distributions of summands. Applications are considered in the theory of polynomials…

Probability · Mathematics 2007-05-23 Eugene Ostrovsky

We consider an Erd\H{o}s-R\'{e}nyi graph $\mathbb{G}(n,p)$ on $n$ vertices with edge probability $p$ such that \[ \sqrt{\frac{\log n}{\log \log n}} \ll np \le n^{1/2-o(1)}, \label{eq:abs} \tag{$\dagger$} \] and derive the upper tail large…

Probability · Mathematics 2023-09-08 Anirban Basak

We re-examine a lower-tail upper bound for the random variable $$X=\prod_{i=1}^{\infty}\min\left\{\sum_{k=1}^iE_k,1\right\},$$ where $E_1,E_2,\ldots\stackrel{iid}\sim\text{Exp}(1)$. This bound has found use in root-finding and seed-finding…

Probability · Mathematics 2019-05-21 Sam Justice , N. D. Shyamalkumar

Let $N_{\triangle}(G)$ be the number of triangles in a graph $G$. In [14] and [25] (respectively) the following bounds were proved on the lower tail behaviour of triangle counts in the dense Erd\H{o}s-R\'enyi random graphs $G_m\sim G(n,m)$:…

Combinatorics · Mathematics 2025-11-03 José Alvarado , Gabriel Dias , Simon Griffiths

We establish new tail estimates for order statistics and for the Euclidean norms of projections of an isotropic log-concave random vector. More generally, we prove tail estimates for the norms of projections of sums of independent…

We study the tail behavior for the maximum of discrete Gaussian free field on a 2D box with Dirichlet boundary condition after centering by its expectation. We show that it exhibits an exponential decay for the right tail and a double…

Probability · Mathematics 2012-09-26 Jian Ding

We consider the exactly solvable model of exponential directed last passage percolation on $\mathbb{Z}^2$ in the large deviation regime. Conditional on the upper tail large deviation event $\mathcal{U}_{\delta}:=\{T_{n}\geq (4+\delta)n\}$…

Probability · Mathematics 2019-02-26 Riddhipratim Basu , Shirshendu Ganguly

A common bottleneck in evaluating extremal performance measures is that, due to their very nature, tail data are often very limited. The conventional approach selects the best probability distribution from tail data using parametric…

Computation · Statistics 2018-01-03 Henry Lam , Clementine Mottet

Consider the upper tail probability that the homomorphism count of a fixed graph $H$ within a large sparse random graph $G_n$ exceeds its expected value by a fixed factor $1+\delta$. Going beyond the Erd\H{o}s-R\'enyi model, we establish…

Probability · Mathematics 2021-02-01 Sohom Bhattacharya , Amir Dembo

Let (X,Y) be a bivariate elliptical random vector with associated random radius in the Gumbel max-domain of attraction. In this paper we obtain a second order asymptotic expansion of the joint survival probability P(X > x, Y> y) for x,y…

Probability · Mathematics 2008-05-15 Enkelejd Hashorva

We prove tail estimates for variables $\sum_i f(X_i)$, where $(X_i)_i$ is the trajectory of a random walk on an undirected graph (or, equivalently, a reversible Markov chain). The estimates are in terms of the maximum of the function $f$,…

Probability · Mathematics 2007-12-25 Roy Wagner

The one-point distribution of the height for the continuum Kardar-Parisi-Zhang (KPZ) equation is determined numerically using the mapping to the directed polymer in a random potential at high temperature. Using an importance sampling…

Disordered Systems and Neural Networks · Physics 2018-05-24 Alexander K. Hartmann , Pierre Le Doussal , Satya N. Majumdar , Alberto Rosso , Gregory Schehr

In this paper, we present a new framework to obtain tail inequalities for sums of random matrices. Compared with existing works, our tail inequalities have the following characteristics: 1) high feasibility--they can be used to study the…

Machine Learning · Computer Science 2019-10-10 Chao Zhang , Min-Hsiu Hsieh , Dacheng Tao

Consider the partition function of a directed polymer in an IID field. We assume that both tails of the negative and the positive part of the field are at least as light as exponential. It is a well-known fact that the free energy of the…

Probability · Mathematics 2012-10-04 Iddo Ben-Ari

We consider a multivariate distributional recursion of sum-type as arising in the probabilistic analysis of algorithms and random trees. We prove an upper tail bound for the solution using Chernoff's bounding technique by estimating the…

Probability · Mathematics 2011-06-21 Goetz Olaf Munsonius

We show on complete metric spaces a polynomial tail decay for stationary measures of contracting on average generating measures.

Dynamical Systems · Mathematics 2026-02-04 Samuel Kittle , Constantin Kogler

We study the model of Directed Polymers in Random Environment in 1+1 dimensions, where the distribution at a site has a tail which decays regularly polynomially with power \alpha, where \alpha \in (0,2). After proper scaling of temperature…

Probability · Mathematics 2010-01-08 Antonio Auffinger , Oren Louidor

We study the height and width of a Galton--Watson tree with offspring distribution B satisfying E(B)=1, 0 < Var(B) < infinity, conditioned on having exactly n nodes. Under this conditioning, we derive sub-Gaussian tail bounds for both the…

Probability · Mathematics 2014-07-22 Louigi Addario-Berry , Luc Devroye , Svante Janson

This paper examines bounds on upper tails for cycle counts in $G_{n,p}$. For a fixed graph $H$ define $\xi_H= \xi_H^{n,p}$ to be the number of copies of $H$ in $G_{n,p}$. It is a much studied and surprisingly difficult problem to understand…

Combinatorics · Mathematics 2019-04-03 Abigail Raz