English
Related papers

Related papers: A note on the rightmost particle in a Fleming-Viot…

200 papers

The random walk with choice is a well known variation to the random walk that first selects a subset of $d$ neighbours nodes and then decides to move to the node which maximizes the value of a certain metric; this metric captures the number…

Data Structures and Algorithms · Computer Science 2010-07-20 John Alexandris , Gregory Karagiorgos 'and' Ioannis Stavrakakis

We consider a dynamical process in a network which distributes all particles (tokens) located at a node among its neighbors, in a round-robin manner. We show that in the recurrent state of this dynamics (i.e., disregarding a polynomially…

Data Structures and Algorithms · Computer Science 2017-11-07 Adrian Kosowski , Przemysław Uznański

Entropic forces result from an increase of the entropy of a thermodynamical physical system. It has been proposed that gravity is such a phenomenon and many articles have appeared on the literature concerning this problem. Loop quantum…

General Relativity and Quantum Cosmology · Physics 2015-02-20 J. Manuel Garcia-Islas

We propose a picture of the fluctuations in branching random walks, which leads to predictions for the distribution of a random variable that characterizes the position of the bulk of the particles. We also interpret the $1/\sqrt{t}$…

Disordered Systems and Neural Networks · Physics 2014-11-05 A. H. Mueller , S. Munier

We analyze a system of stochastic differential equations describing the joint motion of a massive (inert) particle in a viscous fluid in the presence of a gravitational field and a Brownian particle impinging on it from below, which…

Probability · Mathematics 2020-01-07 Sayan Banerjee , Brendan Brown

We study variants of one-dimensional q-color voter models in discrete time. In addition to the usual voter model transitions in which a color is chosen from the left or right neighbor of a site there are two types of noisy transitions. One…

Probability · Mathematics 2013-04-25 Y. Mohylevskyy , C. M. Newman , K. Ravishankar

In this paper we create a model of particle motion on a three-dimensional lattice using discrete random walk with small steps. We rigorously construct a probability space of the particle trajectories. Unlike deterministic approach in…

Probability · Mathematics 2022-03-04 Farida Kachapova , Ilias Kachapov

We define a random walk of a particle in $\mathbb{R}^3$ where the space is rotating. The particle is not glued to the space and will collide with it at random times, resulting in changes in its velocity and direction. After many collisions,…

Probability · Mathematics 2023-12-06 Alberto M. Campos , Tarcísio P. R. Campos

The random walk with hyperbolic probabilities that we are introducing is an example of stochastic diffusion in a one-dimensional heterogeneous media. Although driven by site-dependent one-step transition probabilities, the process retains…

Statistical Mechanics · Physics 2021-06-03 Miquel Montero

Surprisingly the looking natural random walk leading to Brownian motion occurs to be often biased in a very subtle way: usually refers to only approximate fulfillment of thermodynamical principles like maximizing uncertainty. Recently, a…

Quantum Physics · Physics 2015-06-03 Jarek Duda

A particle moves among the vertices of an $(m+1)$-gon which are labeled clockwise as $0,1,...,m$. The particle starts at 0 and thereafter at each step it moves to the adjacent vertex, going clockwise with a known probability $p$, or…

Probability · Mathematics 2007-06-13 Jyotirmoy Sarkar

We study a simple stochastic differential equation that models the dispersion of close heavy particles moving in a turbulent flow. In one and two dimensions, the model is closely related to the one-dimensional stationary Schroedinger…

Mathematical Physics · Physics 2014-07-16 Krzysztof Gawedzki , David P. Herzog , Jan Wehr

We construct the conditional version of $k$ independent and identically distributed random walks on $\R$ given that they stay in strict order at all times. This is a generalisation of so-called non-colliding or non-intersecting random…

Probability · Mathematics 2007-05-23 Peter Eichelsbacher , Wolfgang Konig

We investigate a tight binding quantum walk on a graph. Repeated stroboscopic measurements of the position of the particle yield a measured "trajectory", and a combination of classical and quantum mechanical properties for the walk are…

Statistical Mechanics · Physics 2022-05-18 A. Didi , E. Barkai

We consider a system of independent one-dimensional random walks in a common random environment under the condition that the random walks are transient with positive speed $v_P$. We give upper bounds on the quenched probability that at…

Probability · Mathematics 2016-06-14 Jonathon Peterson

In this paper we propose a self-organized particle moving model on scale free network with the algorithm of the shortest path and preferential walk. The over-capacity property of the vertices in this particle moving system on complex…

Adaptation and Self-Organizing Systems · Physics 2007-05-23 YunFeng Chang , Long Guo , Xu Cai

In this paper, we study branching Brownian motion with absorption, in which particles undergo Brownian motions with drift and are killed upon reaching the origin. We prove that the extremal process of this branching Brownian motion with…

Probability · Mathematics 2023-10-10 Fan Yang , Yaping Zhu

We study the dynamical aspects of the top rank statistics of particles, performing Brownian motions on a half-line, which are ranked by their distance from the origin. For this purpose, we introduce an observable that we call the overlap…

Statistical Mechanics · Physics 2026-03-24 Zdzislaw Burda , Mario Kieburg

We study conservative particle systems on W^S, where S is countable and W = {0, ..., N} or the natural numbers. The rate of a particle moving from site x to site y is given by p(x,y) b(eta_x, eta_y), where eta_z is the number of particles…

Probability · Mathematics 2013-12-24 Richard Kraaij

We consider the motion of a particle on a Galton Watson tree, when the probabilities of jumping from a vertex to any one of its neighbours is determined by a random process. Given the tree, positive weights are assigned to the edges in such…

Probability · Mathematics 2016-05-02 A. D. Barbour , A. Collevecchio
‹ Prev 1 4 5 6 7 8 10 Next ›