English
Related papers

Related papers: Random Words, Toeplitz Determinants and Integrable…

200 papers

We derive an asymptotic expansion for the distribution of a compound sum of independent random variables, all having the same light-tailed subexponential distribution. The examples of a Poisson and geometric number of summands serve as an…

Probability · Mathematics 2007-05-23 Ph . Barbe , W. P. McCormick , C. Zhang

The extended de Finetti theorem characterizes exchangeable infinite random sequences as conditionally i.i.d. and shows that the apparently weaker distributional symmetry of spreadability is equivalent to exchangeability. Our main result is…

Operator Algebras · Mathematics 2008-06-24 Claus Köstler

This work is a follow-up to our previous work "A numerical approach related to defect-type theories for some weakly random problems in homogenization" (preprint available on this archive). It extends and complements, both theoretically and…

Analysis of PDEs · Mathematics 2010-05-24 Arnaud Anantharaman , Claude Le Bris

We completely characterize $\Delta$- and local subexponentialities of positive-half compound Poisson distributions and extend the characterization on two-sided distributions. Moreover, $\Delta$-subexponentiality of infinitely divisible…

Probability · Mathematics 2023-02-21 Muneya Matsui , Toshiro Watanabe

Non-uniform estimates are obtained for Poisson, compound Poisson, translated Poisson, negative binomial and binomial approximations to sums of of m-dependent integer-valued random variables. Estimates for Wasserstein metric also follow…

Probability · Mathematics 2014-08-19 P. Vellaisamy , V. Cekanavicius

We investigate the order of the $r$-th, $1\le r < +\infty$, central moment of the length of the longest common subsequence of two independent random words of size $n$ whose letters are identically distributed and independently drawn from a…

Probability · Mathematics 2016-04-22 Christian Houdré , Jinyong Ma

This paper focuses on the size-biased permutation of $n$ independent and identically distributed (i.i.d.) positive random variables. This is a finite dimensional analogue of the size-biased permutation of ranked jumps of a subordinator…

Probability · Mathematics 2015-09-30 Jim Pitman , Ngoc M. Tran

Letting $w$ denote a finite, nonempty word, let $\text{red}(w)$ denote the word obtained from $w$ by replacing every subword $s$ of $w$ of the form $cc \cdots c$ for a given character $c$ (such that there is no character immediately to the…

Combinatorics · Mathematics 2025-09-22 John M. Campbell , James Currie , Narad Rampersad

In this paper we develop via Girsanov's transformation a perturbation argument to investigate weak convergence of Euler-Maruyama (EM) scheme for path-dependent SDEs with H\"older continuous drifts. This approach is available to other…

Probability · Mathematics 2018-09-11 Jianhai Bao , Jinghai Shao

We propose a new class of discrete generalized linear models based on the class of Poisson-Tweedie factorial dispersion models with variance of the form $\mu + \phi\mu^p$, where $\mu$ is the mean, $\phi$ and $p$ are the dispersion and…

We study a 2-parametric family of probability measures on an infinite-dimensional simplex (the Thoma simplex). These measures originate in harmonic analysis on the infinite symmetric group (S.Kerov, G.Olshanski and A.Vershik, Comptes Rendus…

Representation Theory · Mathematics 2008-03-02 Grigori Olshanski

The Mallows measure on the symmetric group $S_n$ is the probability measure such that each permutation has probability proportional to $q$ raised to the power of the number of inversions, where $q$ is a positive parameter and the number of…

Probability · Mathematics 2015-09-29 Carl Mueller , Shannon Starr

Within the study of uncertain dynamical systems, iterated random functions are a key tool. There, one samples a family of functions according to a stationary distribution. Here, we introduce an extension, where one sample functions…

Probability · Mathematics 2019-09-24 Ramen Ghosh , Jakub Marecek , Robert Shorten

In this work we introduce a general approach, based on the mar-tingale representation of a sampling design and Azuma-Hoeffding's inequality , to derive exponential inequalities for the difference between a Horvitz-Thompson estimator and its…

Statistics Theory · Mathematics 2020-10-26 Guillaume Chauvet , Mathieu Gerber

We consider Landau Hamiltonians with a weak coupling random electric potential of breather type. Under appropriate assumptions we prove a Wegner estimate. It implies the Hoelder continuity of the integrated density of states. The main…

Mathematical Physics · Physics 2017-09-27 Matthias Täufer , Ivan Veselic

We consider a class of general SDEs with a jump integral term driven by a time-inhomogeneous Poisson random measure. We propose a two-parameters Euler-type scheme for this SDE class and prove an optimal rate for the strong convergence with…

Probability · Mathematics 2025-08-07 Mireille Bossy , Paul Maurer

We consider the problem of sampling from a probability distribution $\pi$. It is well known that this can be written as an optimisation problem over the space of probability distribution in which we aim to minimise the Kullback--Leibler…

Methodology · Statistics 2026-02-11 Francesca R. Crucinio , Sahani Pathiraja

In this paper, we examine the performance of randomised Euler-Maruyama (EM) method for additive time-inhomogeneous SDEs with an irregular drift driven by symmetric $\alpha$-table process, $\alpha\in (1,2)$. In particular, the drift is…

Probability · Mathematics 2025-07-16 Jianhai Bao , Haitao Wang , Yue Wu , Danqi Zhuang

We study the problem of bounding the posterior distribution of discrete probabilistic programs with unbounded support, loops, and conditioning. Loops pose the main difficulty in this setting: even if exact Bayesian inference is possible,…

Programming Languages · Computer Science 2024-12-06 Fabian Zaiser , Andrzej S. Murawski , C. -H. Luke Ong

Two finite words are k-binomially equivalent if each subword (i.e., subsequence) of length at most k occurs the same number of times in both words. The k-binomial complexity of an infinite word is a function that maps the integer $n\geq 0$…

Combinatorics · Mathematics 2024-12-25 M. Golafshan , M. Rigo , M. Whiteland