Related papers: Random Permutations -- A geometric point of view

Recently, Hammond and Sheffield introduced a model of correlated random walks that scale to fractional Brownian motions with long-range dependence. In this paper, we consider a natural generalization of this model to dimension $d\geq 2$. We…

This is a review of the Riemann-Hilbert approach to the large $N$ asymptotics in random matrix models and its applications. We discuss the following topics: random matrix models and orthogonal polynomials, the Riemann-Hilbert approach to…

We study the scaling limits of looptrees associated with Bienaym\'e--Galton--Watson (BGW) trees, that are obtained by replacing every vertex of the tree by a "cycle" whose size is its degree. First, we consider BGW trees whose offspring…

We study Mallows random permutations conditioned to avoid a given pattern $\alpha$ of length~$3$. When the bias parameter is of the form $e^{\beta/n}$, we prove that these permutations converge to a non-trivial explicit deterministic…

We consider the problem of enumerating permutations in the symmetric group on $n$ elements which avoid a given set of consecutive pattern $S$, and in particular computing asymptotics as $n$ tends to infinity. We develop a general method…

In this paper, we introduce plane permutations, i.e. pairs $\mathfrak{p}=(s,\pi)$ where $s$ is an $n$-cycle and $\pi$ is an arbitrary permutation, represented as a two-row array. Accordingly a plane permutation gives rise to three distinct…

The Random Permutation Set (RPS) is a new type of set proposed recently, which can be regarded as the generalization of evidence theory. To measure the uncertainty of RPS, the entropy of RPS and its corresponding maximum entropy have been…

We study fixed point biased involutions that avoid a pattern. For every pattern of length three we obtain limit theorems for the asymptotic distribution of the (appropriately centered and scaled) number of fixed points of a random fixed…

We take on a Random Matrix theory viewpoint to study the spectrum of certain reversible Markov chains in random environment. As the number of states tends to infinity, we consider the global behavior of the spectrum, and the local behavior…

We consider a 2-dimensional model of random walk in random environment known as line model. The environment is described by two independent families of i.i.d. random variables dictating rates of jumps in vertical, respectively horizontal…

We investigate the number of permutations that occur in random labellings of trees. This is a generalisation of the number of subpermutations occurring in a random permutation. It also generalises some recent results on the number of…

For $\tau\in S_3$, let $\mu_n^{\tau}$ denote the uniformly random probability measure on the set of $\tau$-avoiding permutations in $S_n$. Let $\mathbb{N}^*=\mathbb{N}\cup\{\infty\}$ with an appropriate metric and denote by…

We discuss asymptotics for the boundary of critical Boltzmann planar maps under the assumption that the distribution of the degree of a typical face is in the domain of attraction of a stable distribution with parameter $\alpha \in (1,2)$.…

This paper discusses the asymptotic behaviour of the number of descents in a random signed permutation and its inverse, which was posed as an open problem by Chatterjee and Diaconis in a recent publication. For that purpose, we generalize…

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.

We introduce the notion of Benjamini-Schramm convergence for quantum graphs. This notion of convergence, intended to play the role of the already existing notion for discrete graphs, means that the restriction of the quantum graph to a…

We study continuous-time (variable speed) random walks in random environments on $\mathbb{Z}^d$, $d\ge2$, where, at time $t$, the walk at $x$ jumps across edge $(x,y)$ at time-dependent rate $a_t(x,y)$. The rates, which we assume stationary…

In this paper, we introduce a convergence notion for ordered selections. Our convergence notion is based on subpermutation densities and convergences of the marginal distributions. A particular case of this convergence is the well-known…

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…

Sparse graphs with bounded average degree form a rich class of discrete structures where local geometry strongly influences global behavior. The Benjamini-Schramm (BS) convergence offers a natural framework to describe their asymptotic…