English
Related papers

Related papers: A product of invariant random permutations has the…

200 papers

It is shown that for any positive integer k and positive parameter lambda less than 2/k(k+1), the Poisson distribution of order k with parameter lambda has a unique mode, 0. In addition, the Poisson distribution of order 2 has a unique…

Probability · Mathematics 2013-12-30 Andreas N. Philippou

We consider consistent particle systems, which include independent random walkers, the symmetric exclusion and inclusion processes, as well as the dual of the KMP model. Consistent systems are such that the distribution obtained by first…

Probability · Mathematics 2019-12-24 Gioia Carinci , Cristian Giardinà , Frank Redig

The time evolution of a bounded quantum system is considered in the framework of the orthogonal, unitary and symplectic circular ensembles of random matrix theory. For an $N$ dimensional Hilbert space we prove that in the large $N$ limit…

Mesoscale and Nanoscale Physics · Physics 2008-02-03 P. Leboeuf , G. Iacomelli

A permutation is defined to be cycle-up-down if it is a product of cycles that, when written starting with their smallest element, have an up-down pattern. We prove bijectively and analytically that these permutations are enumerated by the…

Combinatorics · Mathematics 2009-09-30 Emeric Deutsch , Sergi Elizalde

We present some Markovian approaches to prove universality results for some functions on the symmetric group. Some of those statistics are already studied in [Kammoun, 2018, 2020] but not the general case. We prove, in particular, that the…

Probability · Mathematics 2020-12-11 Mohamed Slim Kammoun

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

We consider uniform random permutations in classes having a finite combinatorial specification for the substitution decomposition. These classes include (but are not limited to) all permutation classes with a finite number of simple…

We introduce the notion of a weighted inversion statistic on the symmetric group, and examine its distribution on each conjugacy class. Our work generalizes the study of several common permutation statistics, including the number of…

Combinatorics · Mathematics 2023-05-18 Jesse Campion Loth , Michael Levet , Kevin Liu , Eric Nathan Stucky , Sheila Sundaram , Mei Yin

It is known that if X is uniformly distributed modulo 1 and Y is an arbitrary random variable independent of X then Y+X is also uniformly distributed modulo 1. We prove a converse for any continuous random variable Y (or a reasonable…

Probability · Mathematics 2013-07-16 Michał Ryszard Wójcik

Exponential averages that appear in integral fluctuation theorems can be recast as a sum over moments of thermodynamic observables. We use two examples to show that such moment series can exhibit non-uniform convergence in certain singular…

Statistical Mechanics · Physics 2022-05-31 Hila Katznelson , Saar Rahav

The distribution of the number of points of the closed simple random walk, visited a given number of times (the k-multiple point range) is analysed by a graph based approach. A general expression for the moments is derived. In this paper…

Probability · Mathematics 2013-12-03 Daniel Hoef

A single permutation, seen as union of disjoint cycles, represents a regular graph of degree two. Consider $d$ many independent random permutations and superimpose their graph structures. It is a common model of a random regular (multi-)…

Probability · Mathematics 2014-12-30 Shirshendu Ganguly , Soumik Pal

For a variety of pattern-avoiding classes, we describe the limiting distribution for the number of fixed points for involutions chosen uniformly at random from that class. In particular we consider monotone patterns of arbitrary length as…

Combinatorics · Mathematics 2023-06-22 Samuel Miner , Douglas Rizzolo , Erik Slivken

We study the rate of convergence of the Markov chain on $S_n$ which starts with a random $(n-k)$-cycle for a fixed $k \geq 1$, followed by random transpositions. The convergence to the stationary distribution turns out to be of order $n$.…

Probability · Mathematics 2018-03-26 Alperen Y. Özdemir

In this note we present a series expansion of inverse moments of a non-negative discrete random variate in terms of its factorial cumulants, based on the Poisson-Charlier expansion of a discrete distribution. We apply the general method to…

Statistics Theory · Mathematics 2008-09-25 Koenraad M. R. Audenaert

In this paper we study the quenched distributions of hitting times for a class of random dynamical systems. We prove that hitting times to dynamically defined cylinders converge to a Poisson point process under the law of random equivariant…

Dynamical Systems · Mathematics 2020-11-30 Harry Crimmins , Benoît Saussol

We obtain an explicit formula for the variance of the number of $k$-peaks in a uniformly random permutation. This is then used to obtain an asymptotic formula for the variance of the length of longest $k$-alternating subsequence in random…

Probability · Mathematics 2026-04-15 Recep Altar Çiçeksiz , Yunus Emre Demirci , Ümit Işlak

The general relationship between an arbitrary frequency distribution and the expectation value of the frequency distributions of its samples is discussed. A wide set of measurable quantities ("invariant moments") whose expectation value…

Data Analysis, Statistics and Probability · Physics 2015-06-15 Paolo Rossi

Consider the process of random transpositions on the complete graph. We use representation theory to give an exact, simple formula for the expected number of cycles of size k at time t, in terms of an incomplete Beta function. Using this we…

Probability · Mathematics 2012-05-23 Nathanaël Berestycki , Gady Kozma

We give several results showing that different discrete structures typically gain certain spanning substructures (in particular, Hamilton cycles) after a modest random perturbation. First, we prove that adding linearly many random edges to…

Combinatorics · Mathematics 2018-03-23 Michael Krivelevich , Matthew Kwan , Benny Sudakov