arXiv subjects

Arvind Ayyer

Publications and source records attributed to Arvind Ayyer.

At least 73 records · Page 4Linked to original sources

arXiv2015

Directed nonabelian sandpile models on trees

We define two general classes of nonabelian sandpile models on directed trees (or arborescences) as models of nonequilibrium statistical phenomena. These models have the property that sand grains can enter only through specified reservoirs, unlike the well-known abelian sandpile model. In the Trickle-down sandpile model, sand grains are allowed to move one at a time. For this model, we show that the stationary distribution is of product form. In the Landslide sandpile model, all the grains at a vertex topple at once, and here we prove formulas for all eigenvalues, their multiplicities, and the rate of convergence to stationarity. The proofs use wreath products and the representation theory of monoids.

math.PR↗

arXiv2015

Multivariate Juggling Probabilities

We consider refined versions of Markov chains related to juggling introduced by Warrington. We further generalize the construction to juggling with arbitrary heights as well as infinitely many balls, which are expressed more succinctly in terms of Markov chains on integer partitions. In all cases, we give explicit product formulas for the stationary probabilities. The normalization factor in one case can be explicitly written as a homogeneous symmetric polynomial. We also refine and generalize enriched Markov chains on set partitions. Lastly, we prove that in one case, the stationary distribution is attained in bounded time.

math.PR↗

arXiv2014

Two-point correlation function of an exclusion process with hole-dependent rates

We consider an exclusion process on a ring in which a particle hops to an empty neighbouring site with a rate that depends on the number of vacancies $n$ in front of it. In the steady state, using the well known mapping of this model to the zero range process, we write down an exact formula for the partition function and the particle-particle correlation function in the canonical ensemble. In the thermodynamic limit, we find a simple analytical expression for the generating function of the correlation function. This result is applied to the hop rate $u(n)=1+(b/n)$ for which a phase transition between high-density laminar phase and low-density jammed phase occurs for $b > 2$. For these rates, we find that at the critical density, the correlation function decays algebraically with a continuously varying exponent $b-2$. We also calculate the two-point correlation function above the critical density, and find that the correlation length diverges with a critical exponent $ν=1/(b-2)$ for $b < 3$ and $1$ for $b > 3$. These results are compared with those obtained using an exact series expansion for finite systems.

cond-mat.stat-mech↗

arXiv2014

Markov chains, $\mathscr R$-trivial monoids and representation theory

We develop a general theory of Markov chains realizable as random walks on $\mathscr R$-trivial monoids. It provides explicit and simple formulas for the eigenvalues of the transition matrix, for multiplicities of the eigenvalues via Möbius inversion along a lattice, a condition for diagonalizability of the transition matrix and some techniques for bounding the mixing time. In addition, we discuss several examples, such as Toom-Tsetlin models, an exchange walk for finite Coxeter groups, as well as examples previously studied by the authors, such as nonabelian sandpile models and the promotion Markov chain on posets. Many of these examples can be viewed as random walks on quotients of free tree monoids, a new class of monoids whose combinatorics we develop.

math.CO↗

arXiv2014

Correlations in the Multispecies TASEP and a Conjecture by Lam

We study correlations in the multispecies TASEP on a ring. Results on correlation of two adjacent points prove two conjectures by Thomas Lam on (a) the limiting direction of a reduced random walk in $\tilde A_{n-1}$ and (b) the asymptotic shape of a random integer partition with no hooks of length $n$, a so called $n$-core. We further investigate two-point correlations far apart and three-point nearest neighbour correlations and prove explicit formulas in almost all cases. These results can be seen as a finite strengthening of correlations in the TASEP speed process by Amir, Angel and Valkó. We also give conjectures for certain higher order nearest neighbour correlations. We find an unexplained independence property (provably for two points, conjecturally for more points) between points that are closer in position than in value that deserves more study.

math.PR↗

arXiv2014

An Inhomogeneous Multispecies TASEP on a Ring

We reinterpret and generalize conjectures of Lam and Williams as statements about the stationary distribution of a multispecies exclusion process on the ring. The central objects in our study are the multiline queues of Ferrari and Martin. We make some progress on some of the conjectures in different directions. First, we prove their conjectures in two special cases by generalizing the rates of the Ferrari-Martin transitions. Secondly, we define a new process on multiline queues, which have a certain minimality property. This gives another proof for one of the special cases; namely arbitrary jump rates for three species.

math.PR↗

arXiv2013

Combinatorial Markov chains on linear extensions

We consider generalizations of Schuetzenberger's promotion operator on the set L of linear extensions of a finite poset of size n. This gives rise to a strongly connected graph on L. By assigning weights to the edges of the graph in two different ways, we study two Markov chains, both of which are irreducible. The stationary state of one gives rise to the uniform distribution, whereas the weights of the stationary state of the other has a nice product formula. This generalizes results by Hendricks on the Tsetlin library, which corresponds to the case when the poset is the anti-chain and hence L=S_n is the full symmetric group. We also provide explicit eigenvalues of the transition matrix in general when the poset is a rooted forest. This is shown by proving that the associated monoid is R-trivial and then using Steinberg's extension of Brown's theory for Markov chains on left regular bands to R-trivial monoids.

math.CO↗

arXiv2013

Markov chains for promotion operators

We consider generalizations of Schuetzenberger's promotion operator on the set L of linear extensions of a finite poset. This gives rise to a strongly connected graph on L. In earlier work (arXiv:1205.7074), we studied promotion-based Markov chains on these linear extensions which generalizes results on the Tsetlin library. We used the theory of R-trivial monoids in an essential way to obtain explicitly the eigenvalues of the transition matrix in general when the poset is a rooted forest. We first survey these results and then present explicit bounds on the mixing time and conjecture eigenvalue formulas for more general posets. We also present a generalization of promotion to arbitrary subsets of the symmetric group.

math.PR↗

arXiv2012

New enumeration formulas for alternating sign matrices and square ice partition functions

The refined enumeration of alternating sign matrices (ASMs) of given order having prescribed behavior near one or more of their boundary edges has been the subject of extensive study, starting with the Refined Alternating Sign Matrix Conjecture of Mills-Robbins-Rumsey, its proof by Zeilberger, and more recent work on doubly-refined and triply-refined enumeration by several authors. In this paper we extend the previously known results on this problem by deriving explicit enumeration formulas for the "top-left-bottom" (triply-refined) and "top-left-bottom-right" (quadruply-refined) enumerations. The latter case solves the problem of computing the full boundary correlation function for ASMs. The enumeration formulas are proved by deriving new representations, which are of independent interest, for the partition function of the square ice model with domain wall boundary conditions at the "combinatorial point" 2π/3.

math.CO↗

arXiv2012

Generalized matrix Ansatz in the multispecies exclusion process - partially asymmetric case

We investigate one of the simplest multispecies generalization of the asymmetric simple exclusion process on a ring. This process has a rich combinatorial spectral structure and a matrix product form for the stationary state. In the totally asymmetric case operators that conjugate the dynamics of systems with different numbers of species were obtained by the authors and reported recently. The existence of such nontrivial operators was reformulated as a representation problem for a specific quadratic algebra (generalized matrix Ansatz). In the present work, we construct the family of representations explicitly for the partially asymmetric case. This solution cannot be obtained by a simple deformation of the totally asymmetric case.

cond-mat.stat-mech↗

arXiv2012

Determinants and Perfect Matchings

We give a combinatorial interpretation of the determinant of a matrix as a generating function over Brauer diagrams in two different but related ways. The sign of a permutation associated to its number of inversions in the Leibniz formula for the determinant is replaced by the number of crossings in the Brauer diagram. This interpretation naturally explains why the determinant of an even antisymmetric matrix is the square of a Pfaffian.

math.CO↗

arXiv2011

Stationary Distribution and Eigenvalues for a de Bruijn Process

We define a de Bruijn process with parameters n and L as a certain continuous-time Markov chain on the de Bruijn graph with words of length L over an n-letter alphabet as vertices. We determine explicitly its steady state distribution and its characteristic polynomial, which turns out to decompose into linear factors. In addition, we examine the stationary state of two specializations in detail. In the first one, the de Bruijn-Bernoulli process, this is a product measure. In the second one, the Skin-deep de Bruin process, the distribution has constant density but nontrivial correlation functions. The two point correlation function is determined using generating function techniques.

math.PR↗

arXiv2011

Recursive structures in the multispecies TASEP

We consider a multi-species generalization of the totally asymmetric simple exclusion process (TASEP) with the simple hopping rule: for x and yth-class particles (x yx occurs with a rate independent from the values x and y. P. A. Ferrari and J. Martin (2007) obtained the stationary state of this model thanks to a combinatorial algorithm, which was subsequently interpreted as a matrix product representation by Evans et al. (2009). This `matrix ansatz' shows that the stationary state of the multi-species TASEP with N classes of particles (N-TASEP) can be constructed algebraically by the action of an operator on the (N-1)-TASEP stationary state. Besides, Arita et al. (2009) analyzed the spectral structure of the Markov matrix: they showed that the set of eigenvalues of the N-TASEP contains those of the (N-1)-TASEP and that the various spectral inclusions can be encoded in a hierarchical set-theoretic structure known as the Hasse diagram. Inspired by these works, we define nontrivial operators that allow us to construct eigenvectors of the N-TASEP by lifting the eigenvectors of the (N-1)-TASEP. This goal is achieved by generalizing the matrix product representation and the Ferrari-Martin algorithm. In particular, we show that the matrix ansatz is not only a convenient tool to write the stationary state but in fact intertwines Markov matrices of different values of N.

cond-mat.stat-mech↗

arXiv2011

Monotone triangles and 312 Pattern Avoidance

We demonstrate a natural bijection between a subclass of alternating sign matrices (ASMs) defined by a condition on the corresponding monotone triangle which we call the gapless condition and a subclass of totally symmetric self-complementary plane partitions defined by a similar condition on the corresponding fundamental domains or Magog triangles. We prove that, when restricted to permutations, this class of ASMs reduces to 312-avoiding permutations. This leads us to generalize pattern avoidance on permutations to a family of words associated to ASMs, which we call Gog words. We translate the gapless condition on monotone trangles into a pattern avoidance-like condition on Gog words associated. We estimate the number of gapless monotone triangles using a bijection with p-branchings.

math.CO↗

arXiv2010

Algebraic Properties of a Disordered Asymmetric Glauber Model

We consider a variant of Glauber dynamics of Ising spins on a one-dimensional lattice, where each spin flips according to the relative state of the spin to its left. Moreover, each bond allows for two rates; flips which equalize nearest neighbor spins, and flips which "unequalize" them. In addition, the leftmost spin flips depending on the spin at that site. We explicitly calculate all eigenvalues of the transition matrix for all system sizes and conjecture a formula for the normalization factor of the model. We then analyze two limits of this model, which are analogous to ferromagnetic and antiferromagnetic behavior in the Ising model for which we are able to prove an analogous formula for the normalization factor.

math-ph↗

arXiv2010

On Some Classes of Open Two-Species Exclusion Processes

We investigate some properties of the nonequilibrium stationary state (NESS) of a one dimensional open system consisting of first and second class (type 1 and type 2) particles. The dynamics are totally asymmetric but the rates for the different permitted exchanges (10 -> 01, 12 -> 21, and 20 -> 02) need not be equal. The entrance and exit rates of the different species can also be different. We show that for certain classes of rates one can compute the currents and phase diagram, or at least obtain some monotonicity properties. For other classes one can obtain a matrix representation of the NESS; this generalizes previous work in which second class particles can neither enter nor leave the system. We analyze a simple example of this type and establish the existence of a randomly located shock at which the typical density profiles of all three species are discontinuous.

cond-mat.stat-mech↗

arXiv2010

The spectrum of an asymmetric annihilation process

In recent work on nonequilibrium statistical physics, a certain Markovian exclusion model called an asymmetric annihilation process was studied by Ayyer and Mallick. In it they gave a precise conjecture for the eigenvalues (along with the multiplicities) of the transition matrix. They further conjectured that to each eigenvalue, there corresponds only one eigenvector. We prove the first of these conjectures by generalizing the original Markov matrix by introducing extra parameters, explicitly calculating its eigenvalues, and showing that the new matrix reduces to the original one by a suitable specialization. In addition, we outline a derivation of the partition function in the generalized model, which also reduces to the one obtained by Ayyer and Mallick in the original model.

math.CO↗

arXiv2010

A Natural Bijection between Permutations and a Family of Descending Plane Partitions

We construct a direct natural bijection between descending plane partitions without any special part and permutations. The directness is in the sense that the bijection avoids any reference to nonintersecting lattice paths. The advantage of the bijection is that it provides an interpretation for the seemingly long list of conditions needed to define descending plane partitions. Unfortunately, the bijection does not relate the number of parts of the descending plane partition with the number of inversions of the permutation as one might have expected from the conjecture of Mills, Robbins and Rumsey, although there is a simple expression for the number of inversions of a permutation in terms of the corresponding descending plane partition.

math.CO↗