Related papers: On sequences of expected maxima and expected range…
Every observation may follow a distribution that is randomly selected in a class of distributions. It is called the distribution uncertainty. This is a fact acknowledged in some research fields such as financial risk measure. Thus, the…
For a bivariate random vector (X,Y), symmetry conditions are presented that yield stochastic orderings among |X|, |Y|, |max(X,Y)|, and | min(X, Y)|. Partial extensions of these results for multivariate random vectors (X1,...,Xn) are also…
A spectral representation for regularly varying L\'evy processes with index between one and two is established and the properties of the resulting random noise are discussed in detail giving also new insight in the $L^2$-case where the…
This paper introduces the concept of random context representations for the transition probabilities of a finite-alphabet stochastic process. Processes with these representations generalize context tree processes (a.k.a. variable length…
We conjecture the true rate of growth of the maximum size of the Riemann zeta function and other $L$-functions. We support our conjecture using arguments from random matrix theory, conjectures for moments of $L$-functions, and also by…
In this paper, we consider the maximum of the $\text{Sine}_\beta$ counting process from its expectation. We show the leading order behavior is consistent with the predictions of log-correlated Gaussian fields, also consistent with work on…
Starting from the relation between the kinetic energy of a free Levy-Schroedinger particle and the logarithmic characteristic of the underlying stochastic process, we show that it is possible to get a precise relation between renormalizable…
A thermodynamic-like formalism is developed for superstatistical systems based on conditional entropies. This theory takes into account large-scale variations of intensive variables of systems in nonequilibrium stationary states. Ordinary…
One problem of wide interest involves estimating expected crossing-times. Several tools have been developed to solve this problem beginning with the works of Wald and the theory of sequential analysis. An extension of his approach is…
We give upper and lower estimates of densities of convolution semigroups of probability measures under explicit assumptions on the corresponding Levy measure and the Levy--Khinchin exponent. We obtain also estimates of derivatives of…
We point out that the functional form describing the frequency of sizes of events in complex systems (e.g. earthquakes, forest fires, bursts of neuronal activity) can be obtained from maximal likelihood inference, which, remarkably, only…
The question of optimally approximating an arbitrary probability measure in the Wasserstein distance by a discrete one with uniform weights is considered. Estimates are obtained for the optimal approximation distance, with an explicit rate…
Image analysis frequently deals with shape estimation and image reconstruction. The ob jects of interest in these problems may be thought of as random sets, and one is interested in finding a representative, or expected, set. We consider a…
An explicit expression for the expected value of a regularized multiplicative functional under the sine-process is obtained by passing to the scaling limit in the Borodin-Okounkov-Geronimo-Case formula.
The comparison of alternative rankings of a set of items is a general and prominent task in applied statistics. Predictor variables are ranked according to magnitude of association with an outcome, prediction models rank subjects according…
We consider measures supported on the bi-circle and review the recurrence relations satisfied by the orthogonal polynomials associated with these measures constructed using the lexicographical or reverse lexicographical ordering. New…
We derive new concentration bounds for time averages of measurement outcomes in quantum Markov processes. This generalizes well-known bounds for classical Markov chains which provide constraints on finite time fluctuations of time-additive…
Suppose $k$ balls are dropped into $n$ boxes independently with uniform probability, where $n, k$ are large with ratio approximately equal to some positive real $\lambda$. The maximum box count has a counterintuitive behavior: first of all,…
We explore the interplay between random and deterministic phenomena using a representation of uncertainty based on the measure-theoretic concept of outer measure. The meaning of the analogues of different probabilistic concepts is…
Expectation Maximization (EM) is among the most popular algorithms for estimating parameters of statistical models. However, EM, which is an iterative algorithm based on the maximum likelihood principle, is generally only guaranteed to find…