Related papers: Tail and moment estimates for chaoses generated by…
We develop an efficient simulation algorithm for computing the tail probabilities of the infinite series $S = \sum_{n \geq 1} a_n X_n$ when random variables $X_n$ are heavy-tailed. As $S$ is the sum of infinitely many random variables, any…
Convolutions of independent random variables often arise in a natural way in many applied problems. In this article, we compare convolutions of two sets of gamma (negative binomial) random variables in the convolution order and the usual…
We consider the problem of probabilistic quantification of dynamical systems that have heavy-tailed characteristics. These heavy-tailed features are associated with rare transient responses due to the occurrence of internal instabilities.…
The task for a general and useful classification of the tail behaviors of probability distributions still has no satisfactory solution. Due to lack of information outside the range of the data the tails of the distribution should be…
This paper investigates the asymptotic behavior of higher-order conditional tail moments, which quantify the contribution of individual losses in the event of systemic collapse. The study is conducted within a framework comprising two…
We consider multivariate extreme value statistics for independent but nonidentically distributed random vectors. In particular, the data may have varying tail copulas and also heteroscedastic marginal distributions. Assuming smoothly…
We prove two basic conjectures on the distribution of the smallest singular value of random n times n matrices with independent entries. Under minimal moment assumptions, we show that the smallest singular value is of order n^{-1/2}, which…
We investigate the use of optimization to compute bounds for extremal performance measures. This approach takes a non-parametric viewpoint that aims to alleviate the issue of model misspecification possibly encountered by conventional…
We deduce in this paper the sufficient conditions for weak convergence of centered and normed deviation of the u-statistics with values in the space of the real valued continuous function defined on some compact metric space. We obtain also…
Large crossed data sets, described by generalized linear mixed models, have become increasingly common and provide challenges for statistical analysis. At very large sizes it becomes desirable to have the computational costs of estimation,…
For dynamical systems modeled by a Young tower with exponential tails, we prove an exponential concentration inequality for all separately Lipschitz observables of n variables. When tails are polynomial, we prove polynomial concentration…
We establish uniform estimates for order statistics of sequences of independent identically distributed random variables with log-concave distribution in terms of Orlicz norms associated with the distribution function of the random…
We develop two new estimators for a general class of stationary GARCH models with possibly heavy tailed asymmetrically distributed errors, covering processes with symmetric and asymmetric feedback like GARCH, Asymmetric GARCH, VGARCH and…
We consider random walks with finite second moment which drifts to $-\infty$ and have heavy tail. We focus on the events when the minimum and the final value of this walk belong to some compact set. We first specify the associated…
For a risk vector $V$, whose components are shared among agents by some random mechanism, we obtain asymptotic lower and upper bounds for the individual agents' exposure risk and the aggregated risk in the market. Risk is measured by…
This paper studies properties of functions having monotone tails. We extend Theorem 1 of Dhaene et al. (2002a) and show how the tail quantiles of a random variable transformed with a monotone tail function can be expressed as the…
Polynomial Chaos Expansions represent a powerful tool to simulate stochastic models of dynamical systems. Yet, deriving the expansion's coefficients for complex systems might require a significant and non-trivial manipulation of the model,…
Let (Z_n)_{n\in\N_0} be a d-dimensional random walk in random scenery, i.e., Z_n=\sum_{k=0}^{n-1}Y_{S_k} with (S_k)_{k\in\N_0} a random walk in Z^d and (Y_z)_{z\in Z^d} an i.i.d. scenery, independent of the walk. We assume that the random…
For probabilistic programs, it is usually not possible to automatically derive exact information about their properties, such as the distribution of states at a given program point. Instead, one can attempt to derive approximations, such as…
We discuss the possibility of applying some standard statistical methods (the least square method, the maximum likelihood method, the method of statistical moments for estimation of parameters) to deterministically chaotic low-dimensional…