SearcharxivSearch

arXiv · 2602.10857

Factorised stationary states for a long range misanthrope process

Abstract

The misanthrope process is an interacting particle system where particles move between neighbouring sites with hop rates depending only on the number of particles at the departure and arrival sites. Motivated by a discretised version of the Hammersley--Aldous--Diaconis process, we introduce a partially asymmetric long range misanthrope process (PALRMP) on a finite one-dimensional lattice with periodic boundary conditions where particles can move between sites that are not necessarily neighbours, as long as there are no particles in between the departure and arrival sites. In this model, each site $\ell$ has an inhomogeneous rate parameter $x_\ell$ associated to it, and the hop rate of a particle moving from site $k$ to site $\ell$ depends upon the parameter associated to the target site $x_\ell$, the direction the particle moves, and the number of particles at sites $k$ and $\ell$. We also consider the homogeneous PALRMP, where all the $x_\ell$'s are 1. We find necessary and sufficient conditions on the hop rates under which the stationary distribution is of factorised form for both the PALRMP and the homogeneous PALRMP, as well as the extreme variants, namely the ones where the particle motion is totally asymmetric (TALRMP) and symmetric (SLRMP). As an illustrative example, we study in detail the discrete Hammersley--Aldous--Diaconis process.

Explore related subjects

Keep this discovery

BibTeXRIS

Arvind Ayyer, Saham Sil. 2026-02-11. Factorised stationary states for a long range misanthrope process. https://arxiv.org/abs/2602.10857

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR