The cycle structure of random permutations

From MaRDI portal
Publication:1201189

DOI10.1214/aop/1176989707zbMath0759.60007OpenAlexW1972196995WikidataQ104775690 ScholiaQ104775690MaRDI QIDQ1201189

Richard Arratia, Simon Tavaré

Publication date: 17 January 1993

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

Full work available at URL: https://doi.org/10.1214/aop/1176989707




Related Items (57)

Eigenvalue distributions of random permutation matrices.The Chebotarev Invariant of a Finite GroupTail bounds on hitting times of randomized search heuristics using variable drift analysisFixed points and matching points in partitionsRecursive methods for some problems in coding and random permutationsConnections Between Bernoulli Strings and Random PermutationsPermutations without long or short cyclesEwens Sampling and Invariable GenerationRandom permutations without macroscopic cyclesFunctional limit theorems for random regular graphsLimit Theorems for Combinatorial Structures via Discrete Process ApproximationsProbabilistic divide-and-conquer: deterministic second halfLocal probabilities and total variation distance for random permutationsConcentrated Hitting Times of Randomized Search Heuristics with Variable DriftEqual sums in random sets and the concentration of divisorsCycles and eigenvalues of sequentially growing random regular graphsDerangements in subspace actions of finite classical groupsLong cycle of random permutations with polynomially growing cycle weightsOn the largest part size of low‐rank combinatorial assembliesCutoff for rewiring dynamics on perfect matchingsRandom permutations and queuesRandom permutations with cycle weightsStanley-Wilf limits for patterns in rooted labeled forestsThe expected genus of a random chord diagramMatching recovery threshold for correlated random graphsFrom Berry-Esseen to super-exponentialCharacter orthogonality for the partition algebra and fixed points of permutationsA central limit theorem for the determinant of a Wigner matrixUnnamed ItemUnnamed ItemUnnamed ItemMixing times for random \(k\)-cycles and coalescence-fragmentation chainsThe component counts of random injectionsIteration entropyPower-free values, large deviations, and integer points on irrational curvesRandom permutations with logarithmic cycle weightsOn Poisson approximations for the Ewens sampling formula when the mutation parameter grows with the sample sizeUnnamed ItemRandom \(A\)-permutations: convergence to a Poisson processSize bias for one and allThe number of cycles in random permutations without long cycles is asymptotically GaussianA pair of difference differential equations of Euler-Cauchy typePreserving the number of cycles of length \(k\) in a growing uniform permutationPrecise asymptotics of longest cycles in random permutations without macroscopic cyclesInvariable generation of finite classical groupsFixed points of a random restricted growth sequenceA study of counts of Bernoulli strings via conditional Poisson processesOn fixed points of permutations.Unnamed ItemFour random permutations conjugated by an adversary generateSnwith high probabilityThe law of the iterated logarithm for random permutationsUnnamed ItemA Random Permutation Model Arising in ChemistryOn fluctuations of eigenvalues of random permutation matricesCycle structure of random parking functionsCycle structure of random permutations with cycle weightsThe Bohnenblust-Spitzer algorithm and its applications




This page was built for publication: The cycle structure of random permutations