Related papers: Pickands' constant $H_{\alpha}$ does not equal $1/…

In the theory of extreme values of Gaussian processes, many results are expressed in terms of the Pickands constant $\mathcal{H}_{\alpha}$. This constant depends on the local self-similarity exponent $\alpha$ of the process, i.e. locally it…

We prove new lower bounds for the upper tail probabilities of suprema of Gaussian processes. Unlike many existing bounds, our results are not asymptotic, but supply strong information when one is only a little into the upper tail. We…

For a non-negative separable random field $Z(t), t\in \mathbb{R}^d$ satisfying some mild assumptions we show that \begin{eqnarray*} H_Z^\delta = \lim_{T\to\infty} \frac{1}{T^d} E \{\sup_{ t\in [0,T]^d \cap \delta \mathbb{Z}^d } Z(t) \}…

Let $\{Z_t, t\geq 0\}$ be a strictly stable process on $\R$ with index $\alpha\in (0,2]$. We prove that for every $p > \alpha$, there exists $\gamma = \gamma (\alpha, p)$ and $\k = \k (\alpha, p)\in (0, +\infty)$ such that…

Let $\Lambda$ be the limiting smallest eigenvalue in the general (\beta, a)-Laguerre ensemble of random matrix theory. Here \beta>0, a >-1; for \beta=1,2,4 and integer a, this object governs the singular values of certain rank n Gaussian…

Let $\gamma(S_n)$ be the minimum number of proper subgroups $H_i$ of the symmetric group $S_n$ such that each element in $S_n$ lies in some conjugate of one of the $H_i.$ In this paper we conjecture that…

Pickands constants play a crucial role in the asymptotic theory of Gaussian processes. They are commonly defined as the limits of a sequence of expectations involving fractional Brownian motions and, as such, their exact value is often…

In this manuscript, we address open questions raised by Dieker \& Yakir (2014), who proposed a novel method of estimation of (discrete) Pickands constants $\mathcal{H}^\delta_\alpha$ using a family of estimators $\xi^\delta_\alpha(T), T>0$,…

Consider a discrete-time martingale $\{X_t\}$ taking values in a Hilbert space $\mathcal H$. We show that if for some $L \geq 1$, the bounds $\mathbb{E} \left[\|X_{t+1}-X_t\|_{\mathcal H}^2 \mid X_t\right]=1$ and $\|X_{t+1}-X_t\|_{\mathcal…

Let $X(t),t\in \mathbb{R}$ be a stochastically continuous stationary max-stable process with Fr\'{e}chet marginals $\Phi_\alpha, \alpha>0$ and set $M_X(T)=\sup_{t \in [0,T]} X(t),T>0$. In the light of the seminal articles [1,2], it follows…

Consider a closed curve of length $2\pi$ with curvature $\kappa(s)$ and the Schr\"odinger operator $H$ with $\kappa^2$ as the potential term. Let $\lambda_\Gamma$ be the lowest eigenvalue of $H$. The Ovals Conjecture proposed by Benguria…

In 1976, Gallagher showed that, conditional on the Hardy--Littlewood conjectures, the number of primes below $x$ in a randomly chosen short interval of length $\lambda \log x$ asymptotically follows a Poisson distribution with mean…

We study the persistence exponent for the first passage time of a random walk below the trajectory of another random walk. More precisely, let $\{B_n\}$ and $\{W_n\}$ be two centered, weakly dependent random walks. We establish that…

For a graph $G,$ let $\alpha(G)$ denote its second smallest Laplacian eigenvalue. The Laplacian Spread Conjecture states that $\alpha(G)+\alpha(\overline{G}) \geq 1,$ where $\overline{G}$ is the complement of $G.$ In this paper, we have…

Given a fixed graph H, what is the (exponentially small) probability that the number X_H of copies of H in the binomial random graph G_{n,p} is at least twice its mean? Studied intensively since the mid 1990s, this so-called infamous upper…

A Hamilton cycle in a graph $\Gamma$ is a cycle passing through every vertex of $\Gamma$. A Hamiltonian decomposition of $\Gamma$ is a partition of its edge set into disjoint Hamilton cycles. One of the oldest results in graph theory is…

Let R be a symmetric a-stable Riemann-Liouville process with Hurst parameter H > 0. Consider ||.|| a translation invariant, b-self-similar, and p-pseudo-additive functional semi-norm. We show that if H > (b + 1/p) and c = (H - b - 1/p),…

Finding general conditions which ensure that a graph is Hamiltonian is a central topic in graph theory. An old and well known conjecture in the area states that any $d$-regular $n$-vertex graph $G$ whose second largest eigenvalue in…

We consider the Pickands process {equation*} P_{n}(s)=\log (1/s)^{-1}\log \frac{X_{n-k+1,n}-X_{n-[k/s]+1,n}}{% X_{n-[k/s]+1,n}-X_{n-[k/s^{2}]+1,n}}, {equation*} {equation*} (\frac{k}{n}\leq s^2 \leq 1), {equation*} which is a generalization…

For $0<\alpha<1$ let $V(\alpha)$ denote the supremum of the numbers $v$ such that every $\alpha$-H\"older continuous function is of bounded variation on a set of Hausdorff dimension $v$. Kahane and Katznelson (2009) proved the estimate $1/2…