相关论文: The spectrum and convergence rates of exclusion an…
We consider the symmetric inclusion process on a general finite graph. Our main result establishes universal upper and lower bounds for the spectral gap of this interacting particle system in terms of the spectral gap of the random walk on…
We consider an extension of the interchange process on the complete graph, in which a fraction of the transpositions are replaced by `reversals'. The model is motivated by statistical physics, where it plays a role in stochastic…
Exclusion processes became paradigmatic models of nonequilibrium interacting particle systems of wide range applicability both across the natural and the applied, social and technological sciences. Usually they are defined as a…
Consider the interchange process on a connected graph $G=(V,E)$ on $n$ vertices. I.e.\ shuffle a deck of cards by first placing one card at each vertex of $G$ in a fixed order and then at each tick of the clock, picking an edge uniformly at…
The interchange process on a finite graph is obtained by placing a particle on each vertex of the graph, then at rate 1, selecting an edge uniformly at random and swapping the two particles at either end of this edge. In this paper we…
We study the time that the simple exclusion process on the complete graph needs to reach equilibrium in terms of total variation distance. For the graph with n vertices and 1<<k<n/2 particles we show that the mixing time is of order…
The most general exclusion single species reaction-diffusion models with nearest-neighbor interactions one a one dimensional lattice are investigated, for which the evolution of full intervals are closed. Using a generating function method,…
We find the total variation mixing time of the interchange process on the dumbbell graph (two complete graphs, $K_n$ and $K_m$, connected by a single edge), and show that this sequence of chains exhibits the cutoff phenomenon precisely when…
Interaction between vehicles and pedestrians is seen in many areas such as crosswalks and intersections. In this paper, we study a totally asymmetric simple exclusion process with a bottleneck at a boundary caused by an interaction. Due to…
We introduce the mathematical theory of the particle systems that interact via permutations, where the transition rates are assigned not to the jumps from a site to a site, but to the permutations themselves. This permutation processes can…
We consider the averaging process on a graph, that is the evolution of a mass distribution undergoing repeated averages along the edges of the graph at the arrival times of independent Poisson processes. We establish cutoff phenomena for…
We completely determine the spectrum of an $I$-graph, that is, the eigenvalues of its adjacency matrix. We apply our result to prove known characterizations of connectedness and bipartiteness in $I$-graphs by using an spectral approach.…
We prove a general theorem on cutoffs for symmetric exclusion and interchange processes on finite graphs $G_N=(V_N,E_N)$, under the assumption that either the graphs converge geometrically and spectrally to a compact metric measure space,…
We prove a general theorem on cutoffs for symmetric simple exclusion processes on graphs with open boundaries, under the natural assumption that the graphs converge geometrically and spectrally to a compact metric measure space with…
As a solvable and broadly applicable model system, the totally asymmetric exclusion process enjoys iconic status in the theory of non-equilibrium phase transitions. Here, we focus on the time dependence of the total number of particles on a…
A comparison technique for finite random walks on finite graphs is introduced, using the well-known interlacing method. It yields improved return probability bounds. A key feature is the incorporation of parts of the spectrum of the…
We use the asymmetric simple exclusion process for describing vehicular traffic flow at the intersection of two streets. No traffic lights control the traffic flow. The approaching cars to the intersection point yield to each other to avoid…
In the present paper, we determine the full spectrum of the simple random walk on finite, complete $d$-ary trees. We also find an eigenbasis for the transition matrix. As an application, we apply our results to get a lower bound for the…
To mimic the complex transport-like collective phenomena in a man-made or natural system, we study an open network junction model of totally asymmetric simple exclusion process with bulk particle attachment and detachment. The stationary…
We propose a novel statistical model for sparse networks with overlapping community structure. The model is based on representing the graph as an exchangeable point process, and naturally generalizes existing probabilistic models with…