相关论文: Geometric sharp large deviations for random projec…
The upper tail problem in a random graph asks to estimate the probability that the number of copies of some fixed subgraph in an Erd\H{o}s--R\'enyi random graph exceeds its expectation by some constant factor. There has been much exciting…
We present a generic and powerful approach to study the statistics of extreme phenomena (meteorology, finance, biology...) that we apply to the statistical estimation of the tail of the distribution of earthquake sizes. The chief innovation…
The delta method is a popular and elementary tool for deriving limiting distributions of transformed statistics, while applications of asymptotic distributions do not allow one to obtain desirable accuracy of approximation for tail…
We consider (annealed) large deviation principles for component empirical measures of several families of marked sparse random graphs, including (i) uniform graphs on $n$ vertices with a fixed degree distribution; (ii) uniform graphs on $n$…
We study the appearance of the giant component in random subgraphs of a given large finite graph G=(V,E) in which each edge is present independently with probability p. We show that if G is an expander with vertices of bounded degree, then…
It is well known that symplectic methods have been rigorously shown to be superior to non-symplectic ones especially in long-time computation, when applied to deterministic Hamiltonian systems. In this paper, we attempt to study the…
We study the lower tail large deviation problem for subgraph counts in a random graph. Let $X_H$ denote the number of copies of $H$ in an Erd\H{o}s-R\'enyi random graph $\mathcal{G}(n,p)$. We are interested in estimating the lower tail…
Let $(X,Y)$ be a random vector whose conditional excess probability $\theta(x,y):=P(Y\leq y | X>x)$ is of interest. Estimating this kind of probability is a delicate problem as soon as $x$ tends to be large, since the conditioning event…
We consider large deviations of empirical measures of diffusion processes. In a first part, we present conditions to obtain a large deviations principle (LDP) for a precise class of unbounded functions. This provides an analogue to the…
Under scenario of high frequency data, consistent estimator of realized Laplace transform of volatility is proposed by \citet{TT2012a} and related central limit theorem has been well established. In this paper, we investigate the asymptotic…
This article investigates, by probabilistic methods, various geometric questions on B_p^n, the unit ball of \ell_p^n. We propose realizations in terms of independent random variables of several distributions on B_p^n, including the…
We study the Taylor expansion for the solutions of differential equations driven by $p$-rough paths with $p>2$. We prove a general theorem concerning the convergence of the Taylor expansion on a nonempty interval provided that the vector…
We prove existence of the large deviation principle, with a proper convex rate function, for the distribution of the renormalized distance from the origin of a random walk on a free product of finitely generated groups. As a consequence, we…
In this paper we propose a framework that enables the study of large deviations for point processes based on stationary sequences with regularly varying tails. This framework allows us to keep track not of the magnitude of the extreme…
In this paper, we investigate the precise local large deviation probabilities for random sums of independent real-valued random variables with a common distribution $F$, where $F(x+\Delta)=F((x, x+T])$ is an $\mathcal{O}$-regularly varying…
Both parametric distribution functions appearing in extreme value theory - the generalized extreme value distribution and the generalized Pareto distribution - have log-concave densities if the extreme value index gamma is in [-1,0].…
In dense Erd\H{o}s-R\'enyi random graphs, we are interested in the events where large numbers of a given subgraph occur. The mean behavior of subgraph counts is known, and only recently were the related large deviations results discovered.…
An influential line of recent work has focused on the generalization properties of unregularized gradient-based learning procedures applied to separable linear classification with exponentially-tailed loss functions. The ability of such…
For a $\Delta$-regular connected graph ${\sf H}$ the problem of determining the upper tail large deviation for the number of copies of ${\sf H}$ in $\mathbb{G}(n,p)$, an Erd\H{o}s-R\'{e}nyi graph on $n$ vertices with edge probability $p$,…
We establish large deviation principles for the largest eigenvalue of large random matrices with variance profiles. For $N \in \mathbb N$, we consider random $N \times N$ symmetric matrices $H^N$ which are such that…