Related papers: On random shifted standard Young tableaux and 132-…
The spectral decomposition of the path space of the vertex model associated to the level $l$ representation of the quantized affine algebra $U_q(\hat{sl}_n)$ is studied. The spectrum and its degeneracy are parametrized by skew Young…
In this paper, we study the asymptotic behavior of the first, second, and so on rows of stochastically decaying partitions. We establish that, with appropriate scaling in time and length, the sequence of rows converges to the Airy$_2$ line…
For a finite poset $P=(X,\prec)$, let $\mathcal{L}_P$ denote the set of linear extensions of $P$. The sorting probability $\delta(P)$ is defined as \[\delta(P) \, := \, \min_{x,y\in X} \, \bigl| \mathbf{P} \, [L(x)\leq L(y) ] \ - \…
We consider uniformly random lozenge tilings of simply connected polygons subject to a technical assumption on their limit shape. We show that the edge statistics around any point on the arctic boundary, that is not a cusp or tangency…
We consider a random walk on a multidimensional integer lattice with random bounds on local times, conditioned on the event that it hits a high level before its death. We introduce an auxiliary "core" process that has a regenerative…
Monotonic surfaces spanning finite regions of $Z^d$ arise in many contexts, including DNA-based self-assembly, card-shuffling and lozenge tilings. One method that has been used to uniformly generate these surfaces is a Markov chain that…
We consider the geometric random (GR) graph on the $d-$dimensional torus with the $L_\sigma$ distance measure ($1 \leq \sigma \leq \infty$). Our main result is an exact characterization of the probability that a particular labeled cycle…
A sorting network is a shortest path from $12 \cdots n$ to $n \cdots 2 1$ in the Cayley graph of the symmetric group generated by adjacent transpositions. For a uniform random sorting network, we prove that in the global limit, particle…
We study the number of 231-avoiding permutations with $j$-descents and maximum drop is less than or equal to $k$ which we denote by $a_{n,231,j}^{(k)}$. We show that $a_{n,231,j}^{(k)}$ also counts the number of Dyck paths of length $2n$…
In this paper, we show that there is a close relation between consistency in a constraint network and set intersection. A proof schema is provided as a generic way to obtain consistency properties from properties on set intersection. This…
Rooted phylogenetic networks allow biologists to represent evolutionary relationships between present-day species by revealing ancestral speciation and hybridization events. A convenient and well-studied class of such networks are…
This paper analyzes a random walk model for the level lines appearing in the entropic repulsion phenomena of three-dimensional discrete random interfaces above a hard wall; we are particularly motivated by the low-temperature (2+1)D…
The betweenness centrality of graphs using random walk paths instead of geodesics is studied. A scaling collapse with no adjustable parameters is obtained as the graph size $N$ is varied; the scaling curve depends on the graph model. A…
In this paper, we introduce the dotted pattern-avoiding map $s_{\dot{\tau}}$, which avoids the dotted pattern $\dot{\tau}$ instead of descents as West's stack-sorting map $s$ does. We also extend the pattern-avoiding machine, which is…
We study the structure of a uniformly randomly chosen partial order of width 2 on n elements. We show that under the appropriate scaling, the number of incomparable elements converges to the height of a one dimensional Brownian excursion at…
Consider the d-dimensional lattice Z^d where each vertex is ``open'' or ``closed'' with probability p or 1-p, respectively. An open vertex v is connected by an edge to the closest open vertex w such that the dth co-ordinates of v and w…
In this paper we study symmetrizable intersection matrices, namely generalized intersection matrices introduced by P. Slodowy such that they are symmetrizable. Every such matrix can be naturally associated with a root basis and a Weyl root…
In this paper, we consider the random plane forest uniformly drawn from all possible plane forests with a given degree sequence. Under suitable conditions on the degree sequences, we consider the limit of a sequence of such forests with the…
The pattern-avoiding fillings of Young diagrams we study arose from Postnikov's work on positive Grassman cells. They are called Le-diagrams, and are in bijection with decorated permutations. Other closely-related diagrams are interpreted…
We introduce consecutive-pattern-avoiding stack-sorting maps $\text{SC}_\sigma$, which are natural generalizations of West's stack-sorting map $s$ and natural analogues of the classical-pattern-avoiding stack-sorting maps $s_\sigma$…