Related papers: The limit shape of random permutations with polyno…
The second author had previously obtained explicit generating functions for moments of characteristic polynomials of permutation matrices (n points). In this paper, we generalize many aspects of this situation. We introduce random shifts of…
We investigate fluctuation phenomena for the graph distance and the number of cut points associated with random media arising from the range of a random walk. Our results demonstrate a sequence of dimension-dependent phase transitions in…
Following Barany et al., who proved that large random lattice zonotopes converge to a deterministic shape in any dimension after rescaling, we establish a central limit theorem for finite-dimensional marginals of the boundary of the…
We consider an evolving preferential attachment random graph model where at discrete times a new node is attached to an old node, selected with probability proportional to a superlinear function of its degree. For such schemes, it is known…
The long-term behavior of a supercritical branching random walk can be described and analyzed with the help of Biggins' martingales, parametrized by real or complex numbers. The study of these martingales with complex parameters is a rather…
Consider an $n\times k$ matrix of i.i.d. Bernoulli random numbers with $p=1/2$. Dual RSK algorithm gives a bijection of this matrix to a pair of Young tableaux of conjugate shape, which is manifestation of skew Howe $GL_{n}\times…
The bead model is a random point field on $\mathbb{Z}\times\mathbb{R}$ which can be viewed as a scaling limit of dimer model. We prove that, in the scaling limit, the normalized height function of a uniformly chosen random bead…
We investigate the fluctuations of cumulative density of particles in the asymmetric simple exclusion process with respect to the stationary distribution (also known as the steady state), as a stochastic process indexed by $[0,1]$. In three…
We prove a number of results, new and old, about the cycle type of a random permutation on S_n. Underlying our analysis is the idea that the number of cycles of size k is roughly Poisson distributed with parameter 1/k. In particular, we…
The large scale fluctuations of the ordered state in active matter systems are usually characterised by studying the "giant number fluctuations" of particles in any finite volume, as compared to the expectations from the central limit…
We study spatial permutations with cycle weights that are bounded or slowly diverging. We show that a phase transition occurs at an explicit critical density. The long cycles are macroscopic and their cycle lengths satisfy a…
This paper considers limit theorems associated with subgraph counts in the age-dependent random connection model. First, we identify regimes where the count of sub-trees converges weakly to a stable random variable under suitable…
We prove limit theorems for the number of fixed points occurring in a random pattern-avoiding permutation distributed according to a one-parameter family of biased distributions. The bias parameter exponentially tilts the distribution…
The goal of this paper is to analyse the asymptotic behavior of the cycle process and the total number of cycles of weighted and generalized weighted random permutations which are relevant models in physics and which extend the Ewens…
We study proportions of consecutive occurrences of permutations of a given size. Specifically, the limit of such proportions on large permutations forms a region, called \emph{feasible region}. We show that this feasible region is a…
We consider uniform random permutations in proper substitution-closed classes and study their limiting behavior in the sense of permutons. The limit depends on the generating series of the simple permutations in the class. Under a mild…
The graph of zigzag diagrams is a close relative of Young's lattice. The boundary problem for this graph amounts to describing coherent random permutations with descent-set statistic, and is also related to certain positive characters on…
We study directed last passage percolation on the first quadrant of the planar square lattice whose weights have general distributions, or equivalently, ./G/1 queues in series. The service time distributions of the servers vary randomly…
We consider a class of graph-valued stochastic processes in which each vertex has a type that fluctuates randomly over time. Collectively, the paths of the vertex types up to a given time determine the probabilities that the edges are…
In this paper we study a mapping from permutations to Dyck paths. A Dyck path gives rise to a (Young) diagram and we give relationships between statistics on permutations and statistics on their corresponding diagrams. The distribution of…