English
Related papers

Related papers: Chase-escape on the configuration model

200 papers

We present a study of exclusion process on a peculiar topology of network with two intersected lanes, competing for the particles in a reservoir with finite capacity. To provide a theoretical ground for our findings, we exploit mean-field…

Statistical Mechanics · Physics 2021-08-04 Akriti Jindal , Arvind Kumar Gupta

We consider a specific random graph which serves as a disordered medium for a particle performing biased random walk. Take a two-sided infinite horizontal ladder and pick a random spanning tree with a certain edge weight $c$ for the…

Probability · Mathematics 2023-04-19 Nina Gantert , Achim Klenke

We give a general existence and convergence result for interacting particle systems on locally finite graphs with possibly unbounded degrees or jump rates. We allow the local state space to be Polish, and the jumps at a site to affect the…

Probability · Mathematics 2026-01-15 Kuldeep Guha Mazumder

Consider branching Brownian motion in which we begin with one particle at the origin, particles independently move according to Brownian motion, and particles split into two at rate one. It is well-known that the right-most particle at time…

Probability · Mathematics 2024-06-10 Julien Berestycki , Jiaqi Liu , Bastien Mallein , Jason Schweinsberg

We study the joint components in a random `double graph' that is obtained by superposing red and blue binomial random graphs on $n$~vertices. A joint component is a maximal set of vertices, which contains both a red and a blue spanning…

Combinatorics · Mathematics 2021-02-08 Mark Jerrum , Tamás Makai

A simple model of cyclically competing species on a directed graph with quenched disorder is proposed as an extension of the rock-paper-scissors model. By assuming that the effects of loops in a directed random graph can be ignored in the…

Statistical Mechanics · Physics 2014-02-27 Hiroki Ohta , Namiko Mitarai

We discuss a non-equilibrium statistical system on a graph or network. Identical particles are injected, interact with each other, traverse, and leave the graph in a stochastic manner described in terms of Poisson rates, possibly dependent…

Statistical Mechanics · Physics 2015-05-19 V. Y. Chernyak , M. Chertkov , N. A. Sinitsyn

An asymmetric exclusion model on an open chain with random rates for hopping particles, where overtaking is also possible, is studied numerically and by computer simulation. The phase structure of the model and the density profiles near the…

Statistical Mechanics · Physics 2007-05-23 A. Tonddast-Navaei , V. Karimipour , M. R. Ejtehadi

We study semi-infinite particle systems on the one-dimensional integer lattice, where each particle performs a continuous-time nearest-neighbour random walk, with jump rates intrinsic to each particle, subject to an exclusion interaction…

Probability · Mathematics 2024-12-20 Mikhail Menshikov , Serguei Popov , Andrew Wade

Networks of channels conveying particles are often subject to blockages due to the limited carrying capacity of the individual channels. If the channels are coupled, blockage of one causes an increase in the flux entering the remaining open…

Statistical Mechanics · Physics 2019-06-28 Chloé Barré , Gregory Page , Julian Talbot , Pascal Viot

We propose a bond-percolation model intended to describe the consumption, and eventual exhaustion, of resources in transport networks. Edges forming minimum-length paths connecting demanded origin-destination nodes are removed if below a…

Physics and Society · Physics 2024-07-31 Minsuk Kim , Filippo Radicchi

The partially asymmetric exclusion process (PASEP) is an important model from statistical mechanics which describes a system of interacting particles hopping left and right on a one-dimensional lattice of N sites. It is partially asymmetric…

Combinatorics · Mathematics 2007-05-23 Sylvie Corteel , Lauren K. Williams

The online increasing subsequence problem is a stochastic optimisation task with the objective to maximise the expected length of subsequence chosen from a random series by means of a nonanticipating decision strategy. We study the…

Probability · Mathematics 2020-01-09 Alexander Gnedin , Amirlan Seksenbayev

We study phase transitions of a system of particles on the one-dimensional integer lattice moving with constant acceleration, with a collision law respecting slower particles. This simple deterministic ``particle-hopping'' traffic flow…

Dynamical Systems · Mathematics 2009-11-10 Michael Blank

Rotor walk is deterministic counterpart of random walk on graphs. We study that under a certain initial configuration in Z^d, n particles perform rotor walks from the origin consecutively. They would stop if they hit the origin or infinity.…

Probability · Mathematics 2014-05-16 Daiwei He

We show that the optimal decision policy for several types of Bayesian sequential detection problems has a threshold switching curve structure on the space of posterior distributions. This is established by using lattice programming and…

Information Theory · Computer Science 2015-03-17 Vikram Krishnamurthy

Let $(G,\mu)$ be a uniformly elliptic random conductance graph on $\mathbb{Z}^d$ with a Poisson point process of particles at time $t=0$ that perform independent simple random walks. We show that inside a cube $Q_K$ of side length $K$, if…

Probability · Mathematics 2019-04-02 Peter Gracar , Alexandre Stauffer

Transitions between multiple stable states of nonlinear systems are ubiquitous in physics, chemistry, and beyond. Two types of behaviors are usually seen as mutually exclusive: unpredictable noise-induced transitions and predictable…

Statistical Mechanics · Physics 2017-10-03 Corentin Herbert , Freddy Bouchet

We consider two-dimensional L\'evy processes reflected to stay in the positive quadrant. Our focus is on the non-standard regime when the mean of the free process is negative but the reflection vectors point away from the origin, so that…

Probability · Mathematics 2024-03-25 Vladimir Fomichov , Sandro Franceschi , Jevgenijs Ivanovs

In a circuit-switched network, traffic can be characterized by several factors that define how communication resources are allocated and utilized during a connection. The amount of traffic basically determines how frequently connection…

Networking and Internet Architecture · Computer Science 2025-03-19 Paresh Upadhyay , Yatindra Nath Singh