English
Related papers

Related papers: Cycles of random permutations with restricted cycl…

200 papers

We study the distribution of the number of permutations with a given periodic up-down sequence w.r.t. the last entry, find exponential generating functions and prove asymptotic formulas for this distribution.

Combinatorics · Mathematics 2007-05-23 B. Shapiro , M. Shapiro , A. Vainshtein

In this article we consider transient random walks on free products of graphs. We prove that the asymptotic range of these random walks exists and is strictly positive. In particular, we show that the range varies real-analytically in terms…

Probability · Mathematics 2022-12-05 Lorenz A. Gilch

This paper initiates the study of shortening universal cycles (u-cycles) and universal words (u-words) for permutations either by using incomparable elements, or by using non-deterministic symbols. The latter approach is similar in nature…

Combinatorics · Mathematics 2018-11-01 Sergey Kitaev , Vladimir N. Potapov , Vincent Vajnovszki

We show that for all $\psi$-mixing shifts distributions of the numbers of multiple recurrencies to shrinking cylindrical neighborhoods of all points are close either to Poisson or to compound Poisson distributions. We also describe…

Probability · Mathematics 2012-12-11 Yuri Kifer , Ariel Rapaport

We study p-adic counterparts of stable distributions, that is limit distributions for sequences of normalized sums of independent identically distributed p-adic-valued random variables. In contrast to the classical case, non-degenerate…

Probability · Mathematics 2007-05-23 Anatoly N. Kochubei

Fix a word $w$ in a free group $F$ on $r$ generators. A $w$-random permutation in the symmetric group $S_N$ is obtained by sampling $r$ independent uniformly random permutations $\sigma_{1},\ldots,\sigma_{r}\in S_{N}$ and evaluating…

Group Theory · Mathematics 2026-02-03 Liam Hanany , Doron Puder

Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…

Discrete Mathematics · Computer Science 2024-06-25 Atli Fannar Franklín , Anders Claesson , Christian Bean , Henning Úlfarsson , Jay Pantone

We explore how the asymptotic structure of a random permutation of $[n]$ with $m$ inversions evolves, as $m$ increases, establishing thresholds for the appearance and disappearance of any classical, consecutive or vincular pattern. The…

Combinatorics · Mathematics 2024-08-13 David Bevan , Dan Threlfall

We count the number of occurrences of restricted patterns of length 3 in permutations with respect to length and the number of cycles. The main tool is a bijection between permutations in standard cycle form and weighted Motzkin paths.

Combinatorics · Mathematics 2007-05-23 Robert Parviainen

We consider the random evolution described by the motion of a particle moving on a circle alternating the angular velocities $ \pm c $ and changing rotation at Poisson random times, resulting in a telegraph process over the circle. We study…

Probability · Mathematics 2020-11-25 Alessandro De Gregorio , Francesco Iafrate

Words are sequences of letters over a finite alphabet. We study two intimately related topics for this object: quasi-randomness and limit theory. With respect to the first topic we investigate the notion of uniform distribution of letters…

Combinatorics · Mathematics 2021-09-01 Hiêp Hàn , Marcos Kiwi , Matías Pavez-Signé

Consider a random permutation of $\{1, \ldots, \lfloor n^{t_2}\rfloor\}$ drawn according to the Ewens measure with parameter $t_1$ and let $K(n, t)$ denote the number of its cycles, where $t\equiv (t_1, t_2)\in\mathbb [0, 1]^2$. Next,…

Probability · Mathematics 2019-06-18 Helmut H. Pitters , Philip Weissmann

We examine a random model consisting of objects with positive weights and evolving in discrete time steps, which generalizes certain random graph models. We prove almost sure convergence for the weight distribution and show scale-free…

Probability · Mathematics 2014-11-10 Ágnes Backhausz , Tamás F. Móri

We analyse the asymptotic behaviour of the probability of observing the expected number of successes at each stage of a sequence of nested Bernoulli trials. Our motivation is the attempt to give a genuinely frequentist interpretation to the…

Probability · Mathematics 2015-05-19 Eckhard Schlemm

We prove a conjecture dating back to a 1978 paper of D.R.\ Musser~\cite{musserirred}, namely that four random permutations in the symmetric group $\mathcal{S}_n$ generate a transitive subgroup with probability $p_n > \epsilon$ for some…

Probability · Mathematics 2014-12-12 Robin Pemantle , Yuval Peres , Igor Rivin

In this paper, we discuss long-time behavior of sample paths for a wide range of regime-switching diffusions. Firstly, almost sure asymptotic stability is concerned (i) for regime-switching diffusions with finite state spaces by the…

Probability · Mathematics 2014-10-29 Junhao Hu , Jianhai Bao , Chenggui Yuan

This paper gives a comprehensive treatment of local uniqueness, asymptotics and numerics for intrinsic means on the circle. It turns out that local uniqueness as well as rates of convergence are governed by the distribution near the…

Methodology · Statistics 2011-08-11 Thomas Hotz , Stephan Huckemann

Asymptotics deviation probabilities of the sum S n = X 1 + $\times$ $\times$ $\times$ + X n of independent and identically distributed real-valued random variables have been extensively investigated , in particular when X 1 is not…

Probability · Mathematics 2020-10-20 Thierry Klein , Agnès Lagnoux , Pierre Petit

Specimens are collected from $N$ different sources. Each specimen has probability $p$ of being contaminated, independently of the other specimens. We assume group testing is applicable, namely one can take small portions from several…

Probability · Mathematics 2024-09-24 Vassilis G. Papanicolaou

Let $m, n$ be positive integers such that $m>1$ divides $n$. In this paper, we introduce a special class of piecewise-affine permutations of the finite set $[1, n]:=\{1, \ldots, n\}$ with the property that the reduction $\pmod m$ of $m$…

Number Theory · Mathematics 2020-03-13 Lucas Reis , Sávio Ribas