Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1912.13453

How exceptional is the extremal Kendall and Kendall-type convolution

B. H. Jasiulis-Gołdyn·J. K. Misiewicz·E. Omey·J. Wesołowski
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper deals with the generalized convolutions connected with the Williamson transform and the maximum operation. We focus on such convolutions which can define transition probabilities of renewal processes. They should be monotonic since the described time or destruction does not go back, it should admit existence of a distribution with a lack of memory property because the analog of the Poisson process shall exist. Another valuable property is the simplicity of calculating and inverting the corresponding generalized characteristic function (in particular Williamson transform) so that the technique of generalized characteristic function can be used in description of our processes. The convex linear combination property (the generalized convolution of two point measures is the convex combination of several fixed measures), or representability (which means that the generalized convolution can be easily written in the language of independent random variables) - they also facilitate the modeling of real processes in that language. We describe examples of generalized convolutions having the required properties ranging from the maximum convolution and its simplest generalization - the Kendall convolution (associated with the Williamson transform), up to the most complicated here - Kingman convolution. It is novel approach to apply in the extreme value theory. Stochastic representation of the Kucharczak-Urbanik in the order statistics terms is proved, which open new paths to investigate Archimedean copulas. This paper open the door to solve an old open problem of the relationship between copulas and generalized convolutions mentioned by B. Schweizer and A. Sklar in 1983. This indicates the path of further research towards extremes and dependency modelling.

Explore related subjects

math.PR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

B. H. Jasiulis-Gołdyn, J. K. Misiewicz, E. Omey, J. Wesołowski. 2022-04-20. How exceptional is the extremal Kendall and Kendall-type convolution. https://arxiv.org/abs/1912.13453

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Generalized Edgeworth expansions for integer-valued additive functionals of uniformly elliptic Markov chains

We obtain asymptotic expansions for probabilities $\bbP(S_N=k)$ of partial sums of uniformly bounded integer-valued functionals $\DS S_N=\sum_{n=1}^N f_n(X_n)$ of uniformly elliptic inhomogeneous Markov chains. The expansions involve products of polynomials and trigonometric polynomials, and they hold without additional assumptions. As an application of the explicit formulas of the trigonometric polynomials, we relate existence of the standard Edgeworth expansions of order $r$ to the rate of equidistributions of $S_N$ modulo $m$ for small positive integers $m.$

math.PR↗
arXiv2026

Permutations from Random Walk

Xavier and Yushi run a "random race" as follows. An atomless probability distribution $μ$ on the real line is chosen. The runners begin at zero. At time $i$ Xavier draws $\mathbf{X}_i$ from $μ$ and advances that distance, while Yushi advances by an independent drawing $\mathbf{Y}_i$. After $n$ such moves, what is the probability that Yushi led all the way? That the answer (namely, $4^{-n}\binom{2n}{n}$) is independent of $μ$ follows from a classical theorem of Darling, stating that for symmetric atomless increments, the distribution of each individual rank in the permutation obtained by ranking the partial sums is independent of the step law. We give a self-contained proof and extend the result to the permutations generated by partial sums of uniformly random signed permutations of any fixed, finite, generic set of reals. For atomless increments with mean zero and finite variance, without assuming symmetry, we show that random-walk permutations approach a random object that we call the "Wiener permuton," whose expected pattern densities equal the probabilities of the corresponding permutations generated by finite random walks with centered Laplace increments. Finally, we exhibit an infinite family of constructions whose limiting permutons interpolate between the Wiener permuton and the recursive separable permuton; each has the same intensity permuton, providing a single two-dimensional extension of the classical arcsine law for all of them.

math.PR↗
arXiv2026

On the uniqueness of quasi-stationary distributions for population models with spatial structure

Subcritical population processes are attracted to extinction and do not have non-trivial stationary distributions, which prompts the study of quasi-stationary distributions (QSDs) instead. In contrast to what generally happens for stationary distributions, QSDs may not be unique, even under irreducibility conditions. The general conditions for uniqueness of QSDs are not always easy to check. For the branching process, besides the quasi-limiting distribution there are many other QSDs. In this paper, we investigate whether adding little extra information to the continuous-time branching process is enough to obtain uniqueness. We consider the branching process with genealogy and branching random walks, and show that they have a unique QSD.

math.PR↗