English
Related papers

Related papers: The global and local limit of the continuous-time …

200 papers

Let T be a rooted supercritical multi-type Galton-Watson (MGW) tree with types coming from a finite alphabet, conditioned to non-extinction. The lambda-biased random walk (X_t, t>=0) on T is the nearest-neighbor random walk which, when at a…

Probability · Mathematics 2012-05-08 Amir Dembo , Nike Sun

We describe the limit (for two topologies) of large uniform random square permutations, i.e., permutations where every point is a record. The starting point for all our results is a sampling procedure for asymptotically uniform square…

Probability · Mathematics 2020-11-10 Jacopo Borga , Erik Slivken

We study scaling limits of non-increasing Markov chains with values in the set of non-negative integers, under the assumption that the large jump events are rare and happen at rates that behave like a negative power of the current state. We…

Probability · Mathematics 2012-01-06 Bénédicte Haas , Grégory Miermont

We study the asymptotic behavior of short cycles of random permutations with cycle weights. More specifically, on a specially constructed metric space whose elements encode all possible cycles, we consider a point process containing all…

Probability · Mathematics 2025-02-11 Oleksii Galganov , Andrii Ilienko

Using techniques from Poisson approximation, we prove explicit error bounds on the number of permutations that avoid any pattern. Most generally, we bound the total variation distance between the joint distribution of pattern occurrences…

Combinatorics · Mathematics 2023-06-22 Harry Crane , Stephen DeSalvo

Let $A^{(n)}_{l;k}\subset S_n$ denote the set of permutations of $[n]$ for which the set of $l$ consecutive numbers $\{k, k+1,\cdots, k+l-1\}$ appears in a set of consecutive positions. Under the uniformly probability measure $P_n$ on…

Probability · Mathematics 2020-12-21 Ross G. Pinsky

We establish a general sufficient condition for a sequence of Galton Watson branching processes in varying environment to converge weakly. This condition extends previous results by allowing offspring distributions to have infinite…

Probability · Mathematics 2014-09-22 Vincent Bansaye , Florian Simatos

Recently, Brandt, Maus and Uitto [PODC'19] showed that, in a restricted setting, the dependency of the complexity of the distributed Lov\'asz Local Lemma (LLL) on the chosen LLL criterion exhibits a sharp threshold phenomenon: They proved…

Data Structures and Algorithms · Computer Science 2020-06-09 Sebastian Brandt , Christoph Grunau , Václav Rozhoň

We prove a central limit theorem for a sequence of random variables whose means are ambiguous and vary in an unstructured way. Their joint distribution is described by a set of measures. The limit is (not the normal distribution and is)…

Probability · Mathematics 2020-07-01 Zengjing Chen , Larry G. Epstein

This paper is devoted to the analysis of the finite-dimensional distributions and asymptotic behavior of extremal Markov processes connected to the Kendall convolution. In particular, based on its stochastic representation, we provide…

Probability · Mathematics 2019-10-10 Marek Arendarczyk , Barbara Jasiulis-Gołdyn , Edward Omey

A multi-type branching process is defined as a random tree with labeled vertices, where each vertex produces offspring independently according to the same multivariate probability distribution. We demonstrate that in realizations of the…

Probability · Mathematics 2025-03-31 Jochem Hoogendijk , Ivan Kryven , Rik Versendaal

A Galton-Watson process in varying environment is a discrete time branching process where the offspring distributions vary among generations. Based on a two-spine decomposition technique, we provide a probabilistic argument of a Yaglom-type…

Probability · Mathematics 2020-10-16 Natalia Cardona-Tobón , Sandra Palau

For each $n\geq 1$, let $ {X_{in}, \quad i \geq 1} $ be independent copies of a nonnegative continuous stochastic process $X_{n}=(X_n(t))_{t\in T}$ indexed by a compact metric space $T$. We are interested in the process of partial maxima…

Probability · Mathematics 2011-10-07 Clément Dombry , Frédéric Eyi-Minko

We study the limiting behavior of continuous time trawl processes which are defined using an infinitely divisible random measure of a time dependent set. In this way one is able to define separately the marginal distribution and the…

Probability · Mathematics 2017-08-10 Danijel Grahovac , Nikolai N. Leonenko , Murad S. Taqqu

Piecewise Deterministic Markov Processes (PDMPs) are studied in a general framework. First, different constructions are proven to be equivalent. Second, we introduce a coupling between two PDMPs following the same differential flow which…

Probability · Mathematics 2021-08-03 Alain Durmus , Arnaud Guillin , Pierre Monmarché

In order to give quantitative estimates for approximating the ergodic limit, we investigate probabilistic limit behaviors of time-averaging estimators of numerical discretizations for a class of time-homogeneous Markov processes, by…

Probability · Mathematics 2023-10-13 Chuchu Chen , Tonghe Dang , Jialin Hong , Guoting Song

Given a growth rule which sequentially constructs random permutations of increasing degree, the stochastic process version of the rencontre problem asks what is the limiting proportion of time that the permutation has no fixed points…

Probability · Mathematics 2022-09-27 Alexander Gnedin , Dudley Stark

Markov branching systems form a fundamental class of stochastic models that are extensively applied in biology, physics, finance, and other domains. These systems are distinguished by their continuous-time evolution and inherent branching…

We investigate the random permutation matrices induced by the Chinese restaurant processes with $(\alpha,\theta)$-seating. When $\alpha=0,\theta>0$, the permutations are those following Ewens measures on symmetric groups, and have been…

Probability · Mathematics 2024-12-20 Jaime Garza , Yizao Wang

We consider collections of $N$ chordal random curves obtained from a critical lattice model on a planar graph, in the limit when a fine-mesh graph approximates a simply-connected domain. We define and study candidates for such limits in…

Mathematical Physics · Physics 2019-03-26 Alex Karrila