相关论文: Probabilistic behavior of hash tables

Recent works have proposed incorporating heavy-tailed (HT) noise into diffusion- and flow-based generative models, with the goals of better recovering the tails of target distributions and improving generative diversity. This motivation is…

Suppose that $X$ is a bounded-degree polynomial with nonnegative coefficients on the $p$-biased discrete hypercube. Our main result gives sharp estimates on the logarithmic upper tail probability of $X$ whenever an associated extremal…

In this work an approximated path integral model describing the dynamics of a inextensible chain is presented. To this purpose, the nonlinear constraints which enforce the property of inextensibility of the chain are relaxed and are just…

The so-called partition function is a sample moment statistic based on blocks of data and it is often used in the context of multifractal processes. It will be shown that its behaviour is strongly influenced by the tail of the distribution…

The problem of estimating the coefficient of bivariate tail dependence is considered here from the robustness point of view; it combines two apparently contradictory theories of robust statistics and extreme value statistics. The usual…

We study the long-time behavior of the scaled walker (particle) position associated with decoupled continuous-time random walk which is characterized by superheavy-tailed distribution of waiting times and asymmetric heavy-tailed…

We study the long-time behavior of decoupled continuous-time random walks characterized by superheavy-tailed distributions of waiting times and symmetric heavy-tailed distributions of jump lengths. Our main quantity of interest is the…

Score-based model research in the last few years has produced state of the art generative models by employing Gaussian denoising score-matching (DSM). However, the Gaussian noise assumption has several high-dimensional limitations,…

Empirical distributions have their in-sample maxima as natural censoring. We look at the "hidden tail", that is, the part of the distribution in excess of the maximum for a sample size of $n$. Using extreme value theory, we examine the…

We prove an exponential probability tail inequality for positive semidefinite quadratic forms in a subgaussian random vector. The bound is analogous to one that holds when the vector has independent Gaussian entries.

We make use of the empirical process theory to approximate the adapted Hill estimator, for censored data, in terms of Gaussian processes. Then, we derive its asymptotic normality, only under the usual second-order condition of regular…

``Localization'' has proven to be a valuable tool in the Statistical Learning literature as it allows sharp risk bounds in terms of the problem geometry. Localized bounds seem to be much less exploited in the Stochastic Optimization…

The upper tail problem in the Erd\H{o}s--R\'enyi random graph $G\sim\mathcal{G}_{n,p}$ asks to estimate the probability that the number of copies of a graph $H$ in $G$ exceeds its expectation by a factor $1+\delta$. Chatterjee and Dembo…

We propose a new heavy-tailed distribution --- Gaussian-Chain (GC) distribution, which is inspirited by the hierarchical structures prevailing in social organizations. We determine the mean, variance and kurtosis of the Gaussian-Chain…

We propose a variational tail bound for norms of random vectors under moment assumptions on their one-dimensional marginals. A simplified version of the bound that parametrizes the ``aggregating distribution'' using a certain pushforward of…

We consider heavy-tailed distributions and compare the well-known estimators of the tail index, based on extreme value theory with a comparatively recent estimator based on a different idea.

This paper proposes a probabilistic approach to investigate the shape of landscapes of multi-dimensional potential functions. Under a suitable coupling scheme, two copies of the overdamped Langevin dynamics associated with the potential…

We give a probabilistic analysis for the randomized game tree evaluation algorithm of Snir. We first show that there exists an input such that the running time, measured as the number of external nodes read by the algorithm, on that input…

The areas under workload process and under queuing process in a single server queue over the busy period have many applications not only in queuing theory but also in risk theory or percolation theory. We focus here on the tail behaviour of…

In this article we study the tail probability of the mass of critical Gaussian multiplicative chaos (GMC) associated to a general class of log-correlated Gaussian fields in any dimension, including the Gaussian free field (GFF) in dimension…