相关论文: The Rotor-Router Model
The rotor-router model is a deterministic analogue of random walk invented by Jim Propp. It can be used to define a deterministic aggregation model analogous to internal diffusion limited aggregation. We prove an isoperimetric inequality…
The rotor-router model is a deterministic analogue of random walk. It can be used to define a deterministic growth model analogous to internal DLA. We show that the set of occupied sites for this model on an infinite regular tree is a…
We study a rotor-router version of the internal diffusion-limited aggregation introduced by J.Propp. The existing estimations of boundary fluctuations of the aggregation cluster show that they grow not faster than $O(\log r)$ with the…
The rotor-router model is a deterministic analogue of random walk. It can be used to define a deterministic growth model analogous to internal DLA. We prove that the asymptotic shape of this model is a Euclidean ball, in a sense which is…
In this paper I propose to approach the Rotor-router problem by considering it as one example of a big family of many other similar models. The study of some specific samples of them may contribute, in my opinion, at a more understanding of…
The rotor-router model on a graph describes a discrete-time walk accompanied by the deterministic evolution of configurations of rotors randomly placed on vertices of the graph. We prove the following property: if at some moment of time,…
The Internal Diffusion Limited Aggregation has been introduced by Diaconis and Fulton in 1991. It is a growth model defined on an infinite set and associated to a Markov chain on this set. We focus here on sets which are finitely generated…
We present a study of dynamical scaling and front motion in a one dimensional system that describes Rayleigh-Benard convection in a rotating cell. We use a model of three competing modes proposed by Busse and Heikes to which spatial…
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed order. Cooper and Spencer (Comb. Probab. Comput. (2006)) show a…
We study the rotor router model and two deterministic sandpile models. For the rotor router model in $\mathbb{Z}^d$, Levine and Peres proved that the limiting shape of the growth cluster is a sphere. For the other two models, only bounds in…
We study the growing patterns in the rotor-router model formed by adding $N$ walkers at the center of a $L \times L$ two-dimensional square lattice, starting with a periodic background of arrows, and relaxing to a stable configuration. The…
The Becker-D\"oring equations are an infinite dimensional system of ordinary differntial equations describing coagulation/fragmentation processes of species of integer sizes. Formal Taylor expansions motivate that its solution should be…
We consider the classical problem of particle diffusion in $d$-dimensional radially-symmetric systems with absorbing boundaries. A key quantity to characterise such diffusive transport is the evolution of the proportion of particles…
Rotor Router models were first introduced by James Propp in 2002. A recurrent Rotor configuration is the one in which every state is visited infinitely often. In this project we investigated whether there is a recurrent Rotor configuration…
The rotor-router model, also called the Propp machine, was introduced as a deterministic alternative to the random walk. In this model, a group of identical tokens are initially placed at nodes of the graph. Each node maintains a cyclic…
The dynamics of the kicked-rotor, that is a paradigm for a mixed system, where the motion in some parts of phase space is chaotic and in other parts is regular is studied statistically. The evolution (Frobenius-Perron) operator of phase…
A finite dimensional abstract approximation and convergence theory is developed for estimation of the distribution of random parameters in infinite dimensional discrete time linear systems with dynamics described by regularly dissipative…
The rotor-router model is a deterministic process analogous to a simple random walk on a graph. This paper is concerned with a generalized model, functional-router model, which imitates a Markov chain possibly containing irrational…
The combinatorial theory of rotor-routers has connections with problems of statistical mechanics, graph theory, chaos theory, and computer science. A rotor-router network defines a deterministic walk on a digraph G in which a particle walks…
We propose a simple mathematical model that describes the time evolution of a self-propelled object on a liquid surface using such variables as the object location, the surface concentration of active molecules and the hydrodynamic surface…