Regenerative random permutations of integers

DOI10.1214/18-AOP1286zbMath1414.05019arXiv1704.01166OpenAlexW2963947360WikidataQ127928610 ScholiaQ127928610MaRDI QIDQ2421818

Wenpin Tang, Jim W. Pitman

Publication date: 18 June 2019

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1704.01166

zbMATH Keywords

renewal processescycle structureregenerative processessize biasingBernoulli sieveindecomposable permutationsMallows permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial probability (60C05) Renewal theory (60K05)

Related Items (17)

On intermediate levels of a nested occupancy scheme in a random environment generated by stick-breaking II ⋮ A central limit theorem for descents of a Mallows permutation and its inverse ⋮ Renewal theory for iterated perturbed random walks on a general branching process tree: intermediate generations ⋮ Cycles in Mallows random permutations ⋮ The height of record‐biased trees ⋮ Finite Automata, Probabilistic Method, and Occurrence Enumeration of a Pattern in Words and Permutations ⋮ Comparing the inversion statistic for distribution-biased and distribution-shifted permutations with the geometric and the GEM distributions ⋮ Multivariable versions of a lemma of Kaluza's ⋮ Unnamed Item ⋮ Poisson percolation on the square lattice ⋮ Renewal sequences and record chains related to multiple zeta sums ⋮ On intermediate levels of nested occupancy scheme in random environment generated by stick-breaking I ⋮ The Infinite limit of random permutations avoiding patterns of length three ⋮ Clustering of consecutive numbers in permutations under Mallows distributions and super-clustering under general \(p\)-shifted distributions ⋮ On nested infinite occupancy scheme in random environment ⋮ Arcsine laws for random walks generated from random permutations with applications to genomics ⋮ Late levels of nested occupancy scheme in random environment

Uses Software

• OEIS

Cites Work

• The length of the longest increasing subsequence of a random Mallows permutation
• On the connected components of a random permutation graph with a given number of edges
• The two-sided infinite extension of the Mallows model for random permutations
• On the number of indecomposable permutations with a given number of cycles
• On the number of empty boxes in the Bernoulli sieve. II.
• \(q\)-exchangeability via quasi-invariance
• Coherent random permutations with biased record statistics
• Absorption processes: Models for \(q\)-identities
• Sum of the reciprocals of the binomial coefficients
• Harmonic analysis on the infinite symmetric group
• Random permutations of countable sets
• Size-biased permutation of a finite sequence with independent and identically distributed terms
• Feature allocations, probability functions, and paintboxes
• Regeneration in random combinatorial structures
• Hypermaps and indecomposable permutations
• Indecomposable permutations, hypermaps and labeled Dyck paths
• Successive sampling in large finite populations
• Metric methods for analyzing partially ranked data
• Pascal processes and their characterization
• Size-biased sampling of Poisson point processes and excursions
• A variational problem for random Young tableaux
• On time- and cycle-stationarity
• The two-parameter Poisson-Dirichlet distribution derived from a stable subordinator
• Stick breaking process generated by virtual permutations with Ewens distribution
• Subordinators and the actions of permutations with quasi-invariant measure
• The Bernoulli sieve
• Limit theorems for longest monotone subsequences in random Mallows permutations
• On the cycle structure of Mallows permutations
• Regenerative composition structures
• Riffle shuffles, cycles, and descents
• Exchangeable and partially exchangeable random partitions
• Hammersley's interacting particle process and longest increasing subsequences
• A microscopic model for the Burgers equation and longest increasing subsequences
• Cycle structure of riffle shuffles
• Gaps and interleaving of point processes in sampling from a residual allocation model
• Gibbs measures on permutations over one-dimensional discrete point sets
• Lengths of monotone subsequences in a Mallows permutation
• Generating indecomposable permutations
• Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
• Spatial random permutations and infinite cycles
• On moment sequences and renewal sequences
• The sampling theory of selectively neutral alleles
• Weak convergence of random p-mappings and the exploration process of inhomogeneous continuum random trees
• Extremes and gaps in sampling from a GEM random discrete distribution
• Beta processes, stick-breaking and power laws
• Number of Right Ideals and a q-analogue of Indecomposable Permutations
• The Surprising Mathematics of Longest Increasing Subsequences
• Small parts in the Bernoulli sieve
• The Bernoulli sieve: an overview
• ITERATED PRIMITIVES OF LOGARITHMIC POWERS
• Characterizations of exchangeable partitions and random discrete distributions by deletion properties
• NON-NULL RANKING MODELS. I
• The heaps process, libraries, and size-biased permutations
• The model of interacting spatial permutations and its relation to the Bose gas
• Coloured Loop-Erased Random Walk on the Complete Graph
• Limit Measures Arising in the Asymptotic Theory of Symmetric Groups, II
• On Renewal Sequences
• Limit Measures Arising in the Asympyotic Theory of Symmetric Groups. I.
• On the characterization of point processes with the order statistic property
• Absorption sampling and the absorption distribution
• On the distribution of the length of the longest increasing subsequence of random permutations
• Renewal sequences and record chains related to multiple zeta sums
• Applied Probability and Queues
• Size-biased filtering of Poisson–Dirichlet samples with an application to partition structures in genetics
• Sums of Powers of Integers
• Unveiling turbo codes: some results on parallel concatenated coding schemes
• Spherically symmetric random permutations
• Record‐dependent measures on the symmetric groups
• On the number of empty boxes in the Bernoulli sieve I
• Coherent permutations with descent statistic and the boundary problem for the graph of zigzag diagrams
• Branching Processes Since 1873
• Ordered Cycle Lengths in a Random Permutation
• Asymptotic Theory for Successive Sampling with Varying Probabilities Without Replacement, I
• Probability
• Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Regenerative random permutations of integers