English
Related papers

Related papers: A Class of Multi-particle Reinforced Interacting R…

200 papers

Random walks on graphs are widely used in all sciences to describe a great variety of phenomena where dynamical random processes are affected by topology. In recent years, relevant mathematical results have been obtained in this field, and…

Statistical Mechanics · Physics 2009-11-11 R. Burioni , D. Cassi

We prove new results on lazy random walks on finite graphs. To start, we obtain new estimates on return probabilities $P^t(x,x)$ and the maximum expected hitting time $t_{\rm hit}$, both in terms of the relaxation time. We also prove a…

Probability · Mathematics 2018-07-19 Roberto I. Oliveira , Yuval Peres

Many seemingly disparate Markov chains are unified when viewed as random walks on the set of chambers of a hyperplane arrangement. These include the Tsetlin library of theoretical computer science and various shuffling schemes. If only…

Combinatorics · Mathematics 2010-02-08 Christos A. Athanasiadis , Persi Diaconis

We consider a new model of a branching random walk on a multidimensional lattice with continuous time and one source of particle reproduction and death, as well as an infinite number of sources in which, in addition to the walk, only…

Probability · Mathematics 2023-02-14 E. Filichkina , E. Yarovaya

We reinvestigate the validity of mapping the problem of two onsite interacting particles in a random potential onto an effective random matrix model. To this end we first study numerically how the non-interacting basis is coupled by the…

Disordered Systems and Neural Networks · Physics 2015-06-25 Thomas Vojta , Rudolf A. Roemer , Michael Schreiber

In this paper we introduce the notion of Random Walk in Changing Environment - a random walk in which each step is performed in a different graph on the same set of vertices, or more generally, a weighted random walk on the same vertex and…

Probability · Mathematics 2017-07-05 Gideon Amir , Itai Benjamini , Ori Gurel-Gurevich , Gady Kozma

We study the long-time behavior of two run-and-tumble particles on the real line subjected to an attractive interaction potential and jamming interactions, which prevent the particles from crossing. We provide the explicit invariant…

Probability · Mathematics 2025-01-22 Leo Hahn

Given a random walk $(S_n)$ with typical step distributed according to some fixed law and a fixed parameter $p \in (0,1)$, the associated positively step-reinforced random walk is a discrete-time process which performs at each step, with…

Probability · Mathematics 2022-10-19 Marco Bertenghi , Alejandro Rosales-Ortiz

Full control over the dynamics of interacting, indistinguishable quantum particles is an important prerequisite for the experimental study of strongly correlated quantum matter and the implementation of high-fidelity quantum information…

A simple model for the nonlinear collective transport of interacting particles in a random medium with strong disorder is introduced and analyzed. A finite threshold for the driving force divides the behavior into two regimes characterized…

Condensed Matter · Physics 2009-10-28 Joe Watson , Daniel S. Fisher

We study dynamic random conductance models on $\mathbb{Z}^2$ in which the environment evolves as a reversible Markov process that is stationary under space-time shifts. We prove under a second moment assumption that two conditionally…

Probability · Mathematics 2020-09-30 Noah Halberstam , Tom Hutchcroft

The position density of a "particle" performing a continuous-time quantum walk on the integer lattice, viewed on length scales inversely proportional to the time t, converges (as t tends to infinity) to a probability distribution that…

Quantum Physics · Physics 2013-05-29 Alex D. Gottlieb

Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…

Probability · Mathematics 2018-10-09 Ruojun Huang

We prove that any vertex-reinforced random walk on the integer lattice with non-decreasing reinforcement sequence $w$ satisfying $w(k) = o(k^{\alpha})$ for some $\alpha < 1/2$ is recurrent. This improves on previous results of Volkov (2006)…

Probability · Mathematics 2014-01-07 Arvind Singh

Multifractal properties of the distribution of topological invariants for a model of trajectories randomly entangled with a nonsymmetric lattice of obstacles are investigated. Using the equivalence of the model to random walks on a locally…

Statistical Mechanics · Physics 2009-10-31 R. Voituriez , S. Nechaev

We consider a self-propelled particle system which has been used to describe certain types of collective motion of animals, such as fish schools and bird flocks. Interactions between particles are specified by means of a pairwise potential,…

Analysis of PDEs · Mathematics 2013-03-05 J. A. Carrillo , S. Martin , V. Panferov

We consider a random walker in a dynamic random environment given by a system of independent simple symmetric random walks. We obtain ballisticity results under two types of perturbations: low particle density, and strong local drift on…

* ACTIVATED RANDOM WALK MODEL * This is a conservative particle system on the lattice, with a Markovian continuous-time evolution. Active particles perform random walks without interaction, and they may as well change their state to…

Probability · Mathematics 2011-03-15 Leonardo T. Rolla

In this work we prove a shape theorem for a growing set of Simple Random Walks (SRWs), known as frog model. The dynamics of this process is described as follows: There are some active particles, which perform independent SRWs, and sleeping…

Probability · Mathematics 2007-05-23 O. S. M. Alves , S. Yu. Popov , F. P. Machado

We consider a modified random walk which uses unvisited edges whenever possible, and makes a simple random walk otherwise. We call such a walk an edge-process. We assume there is a rule A, which tells the walk which unvisited edge to use…

Data Structures and Algorithms · Computer Science 2015-03-20 Petra Berenbrink , Colin Cooper , Tom Friedetzky
‹ Prev 1 8 9 10 Next ›