English
Related papers

Related papers: On a limiting point process related to modified pe…

200 papers

Permutons are probability measures on the unit square with uniform marginals that provide a natural way to describe limits of permutations. We are interested in the permuton limits for permutations sampled uniformly from certain…

Probability · Mathematics 2026-02-25 Kaitlyn Hohmeier , Erik Slivken

A family of random matrix ensembles interpolating between the GUE and the Ginibre ensemble of $n\times n$ matrices with iid centered complex Gaussian entries is considered. The asymptotic spectral distribution in these models is uniform in…

Probability · Mathematics 2010-03-23 Martin Bender

We extend Stanley's work on alternating permutations with extremal number of fixed points in two directions: first, alternating permutations are replaced by permutations with a prescribed descent set; second, instead of simply counting…

Combinatorics · Mathematics 2007-06-22 Guo-Niu Han , Guoce Xin

Assume a finite set of complex random variables form a determinantal point process, we obtain a theorem on the limit of the empirical distribution of these random variables. The result is applied to %We study the limits of the empirical…

Probability · Mathematics 2017-11-29 Tiefeng Jiang , Yongcheng Qi

We prove a central limit theorem (CLT) for the number of joint orbits of random tuples of commuting permutations. In the uniform sampling case this generalizes the classic CLT of Goncharov for the number of cycles of a single random…

Probability · Mathematics 2026-02-20 Abdelmalek Abdesselam , Shannon Starr

We study existence and universality of scaling limits for the eigenvalues of a random normal matrix, in particular at points on the boundary of the spectrum. Our approach uses Ward's equation, which is an identity satisfied by the 1-point…

Probability · Mathematics 2015-10-30 Yacin Ameur , Nam-Gyu Kang , Nikolai Makarov

An involution is a bijection that is its own inverse. Given a permutation $\sigma$ of $[n],$ let $\mathsf{invol}(\sigma)$ denote the number of ways $\sigma$ can be expressed as a composition of two involutions of $[n].$ We prove that the…

Combinatorics · Mathematics 2025-08-22 Charles Burnette

Random permutations with distribution conditionally uniform given the set of record values can be generated in a unified way, coherently for all values of $n$. Our central example is a two-parameter family of random permutations that are…

Probability · Mathematics 2007-05-23 Alexander Gnedin

We consider uniform random permutations of length $n$ conditioned to have no cycle longer than $n^\beta$ with $0<\beta<1$, in the limit of large $n$. Since in unconstrained uniform random permutations most of the indices are in cycles of…

Probability · Mathematics 2018-12-21 Volker Betz , Helge Schäfer , Dirk Zeindler

We consider the point process \begin{align*} \frac{1}{Z_{n}}\prod_{1 \leq j < k \leq n} |e^{i\theta_{j}}-e^{-i\theta_{k}}|^{\beta}\prod_{j=1}^{n} d\theta_{j}, \qquad \theta_{1},\ldots,\theta_{n} \in (-\pi,\pi], \quad \beta > 0, \end{align*}…

Probability · Mathematics 2026-04-08 Christophe Charlier

For a large class of symmetric random matrices with correlated entries, selected from stationary random fields of centered and square integrable variables, we show that the limiting distribution of eigenvalue counting measure always exists…

Probability · Mathematics 2016-03-08 Costel Peligrad , Magda Peligrad

We explore the asymptotic distributions of sequences of integer-valued additive functions defined on the symmetric group endowed with the Ewens probability measure as the order of the group increases. Applying the method of factorial…

Combinatorics · Mathematics 2013-04-10 Tatjana Bakšajeva , Eugenijus Manstavičius

Normal approximations for descents and inversions of permutations of the set $\{1,2,...,n\}$ are well known. A number of sequences that occur in practice, such as the human genome and other genomes, contain many repeated elements. Motivated…

Probability · Mathematics 2014-08-28 Mark Conger , D. Viswanath

In this work we are considering the behavior of the limit shape of Young diagrams associated to random permutations on the set $\{1,\dots,n\}$ under a particular class of multiplicative measures. Our method is based on generating functions…

Probability · Mathematics 2014-07-10 Alessandra Cipriani , Dirk Zeindler

In this article, we study the extremal processes of branching Brownian motions conditioned on having an unusually large maximum. The limiting point measures form a one-parameter family and are the decoration point measures in the extremal…

Probability · Mathematics 2020-09-01 Julien Berestycki , Éric Brunet , Aser Cortines , Bastien Mallein

Continuous-time Mallows processes are processes of random permutations of the set $\{1, \ldots, n\}$ whose marginal at time $t$ is the Mallows distribution with parameter $t$. Recently Corsini showed that there exists a unique Markov…

Probability · Mathematics 2024-04-15 Radosław Adamczak , Michał Kotowski

We continue the study of the Hermitian random matrix ensemble with external source $\frac{1}{Z_n} e^{-n \Tr({1/2}M^2 -AM)} dM$ where $A$ has two distinct eigenvalues $\pm a$ of equal multiplicity. This model exhibits a phase transition for…

Mathematical Physics · Physics 2010-07-29 Alexander I. Aptekarev , Pavel M. Bleher , Arno B. J. Kuijlaars

We study the eigenvalue distribution of a random matrix, at a transition where a new connected component of the eigenvalue density support appears away from other connected components. Unlike previously studied critical points, which…

Mathematical Physics · Physics 2007-05-23 Bertrand Eynard

We study how the inversion statistic is influenced by fixed points in a permutation. %The expected number of inversions in a uniformly random permutation in $S_n$ is $\frac{n(n-1)}4$. For each $n\in\mathbb{N}$, and each $k\in\{0,1,\cdots,…

Probability · Mathematics 2025-05-06 Ross G. Pinsky

An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.

Discrete Mathematics · Computer Science 2011-08-19 Alexander Valyuzhenich