Related papers: Universality for random permutations and some othe…

Universality in unitary invariant random matrix ensembles with complex matrix elements is considered. We treat two general ensembles which have a determinant factor in the weight. These ensembles are relevant, e.g., for spectra of the Dirac…

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$.…

The results of the renormalization group are commonly advertised as the existence of power law singularities near critical points. The classic predictions are often violated and logarithmic and exponential corrections are treated on a…

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…

We discuss various universality aspects of numerical computations using standard algorithms. These aspects include empirical observations and rigorous results. We also make various speculations about computation in a broader sense.

In this paper we study the inverse of so-called unfair permutations, and explore various properties of them. Our investigation begins with comparing this class of permutations with uniformly random permutations, and showing that they behave…

We present an alternative procedure to eliminate irregular contributions in the perturbation expansion of c=0-matrix models representing the sum over triangulations of random surfaces, thereby reproducing the results of Tutte [1] and Brezin…

We present a new approach to the problem of enumerating permutations of length n that avoid a fixed consecutive pattern of length m. We use this idea to give explicit upper and lower bounds on the number of permutations avoiding a pattern…

We give a proof of universality in the bulk of spectrum of unitary matrix models, assuming that the potential is globally $C^{2}$ and locally $C^{3}$ function. The proof is based on the determinant formulas for correlation functions in…

We consider 1d random Hermitian $N\times N$ block band matrices consisting of $W\times W$ random Gaussian blocks (parametrized by $j,k \in\Lambda=[1,n]\cap \mathbb{Z}$, $N=nW$) with a fixed entry's variance…

In this paper we introduce generalised Markov numbers and extend the classical Markov theory for the discrete Markov spectrum to the case of generalised Markov numbers. In particular we show recursive properties for these numbers and find…

The classes of tree permutations and forest permutations were defined by Acan and Hitczenko (2016). We study random permutations of a given length from these classes, and in particular the number of occurrences of a fixed pattern in one of…

We describe the limit (for two topologies) of large uniform random square permutations, i.e., permutations where every point is a record. The starting point for all our results is a sampling procedure for asymptotically uniform square…

We consider an ensemble of non-Hermitian matrices with independent identically distributed real entries that have finite moments. We show that its $k$-point correlation function in the bulk away from the real line converges to a universal…

Clustering is a central approach for unsupervised learning. After clustering is applied, the most fundamental analysis is to quantitatively compare clusterings. Such comparisons are crucial for the evaluation of clustering methods as well…

Symmetry is a cornerstone of much of mathematics, and many probability distributions possess symmetries characterized by their invariance to a collection of group actions. Thus, many mathematical and statistical methods rely on such…

We apply ideas from the cluster method to q-count the permutations of a multiset according to the number of occurrences of certain generalized patterns, as defined by Babson and Steingrimsson. In particular, we consider those patterns with…

We use various combinatorial and probabilistic techniques to study growth rates for the probability that a random permutation from the Mallows distribution avoids consecutive patterns. The Mallows distribution behaves like a $q$-analogue of…

In parallel to the classical theory of central extensions of groups, we develop a version for extensions that preserve commutativity. It is shown that the Bogomolov multiplier is a universal object parametrising such extensions of a given…

Representation theory and the theory of symmetric functions have played a central role in Random Matrix Theory in the computation of quantities such as joint moments of traces and joint moments of characteristic polynomials of matrices…