Related papers: Walkers on the circle
This article deals with the experimental study of pedestrian behaviours in some situations of one-dimensional traffic. Participants were pre-organized in a line, and asked to walk either in a straight line with a fast or slow leader, or to…
We study the Ergodic Properties of Random Walks in stationary ergodic environments without uniform ellipticity under a minimal assumption. There are two main components in our work. The first step is to adopt the arguments of Lawler to…
We propose a random walks based model to generate complex networks. Many authors studied and developed different methods and tools to analyze complex networks by random walk processes. Just to cite a few, random walks have been adopted to…
Strongly non-Markovian random walks offer a promising modeling framework for understanding animal and human mobility, yet, few analytical results are available for these processes. Here we solve exactly a model with long range memory where…
In the past decade, the use of ordinal patterns in the analysis of time series and dynamical systems has become an important and rich tool. Ordinal patterns (otherwise known as a permutation patterns) are found in time series by taking $n$…
This work is motivated by the study of some two-dimensional random walks in random environment (RWRE) with transition probabilities independent of one coordinate of the walk. These are non-reversible models and can not be treated by…
The probability distributions of discrete-time quantum walks have been often investigated, and many interesting properties of them have been discovered. The probability that the walker can be find at a position is defined by diagonal…
We examine the question of whether a collection of random walks on a graph can be coupled so that they never collide. In particular, we show that on the complete graph on n vertices, with or without loops, there is a Markovian coupling…
In this paper, controlled experiments have been conducted to make deep analysis on the obstacle evading behavior of individual pedestrians affected by one obstacle. Results of Fourier Transform show that with the increase of obstacle width,…
In this paper we study a random walk in a one-dimensional dynamic random environment consisting of a collection of independent particles performing simple symmetric random walks in a Poisson equilibrium with density $\rho \in (0,\infty)$.…
We present a new approach of topology biased random walks for undirected networks. We focus on a one parameter family of biases and by using a formal analogy with perturbation theory in quantum mechanics we investigate the features of…
This study presents an initial framework for distinguishing group and single pedestrians based on real-world trajectory data, with the aim of analyzing their differences in space utilization and emergent behavioral patterns. By segmenting…
A one-dimensional confined Nonlinear Random Walk is a tuple of $N$ diffeomorphisms of the unit interval driven by a probabilistic Markov chain. For generic such walks, we obtain a geometric characterization of their ergodic stationary…
Walks in a directed graph can be given a partially ordered structure that extends to possibly unconnected objects, called hikes. Studying the incidence algebra on this poset reveals unsuspected relations between walks and self-avoiding…
Quantum walks exhibit many unique characteristics compared to classical random walks. In the classical setting, self-avoiding random walks have been studied as a variation on the usual classical random walk. Classical self-avoiding random…
We consider two or more simple symmetric walks on some graphs, e.g. the real line, the plane or the two dimensional comb lattice, and investigate the properties of the distance among the walkers.
Consider a discrete-time quantum walk on the $N$-cycle subject to decoherence both on the coin and the position degrees of freedom. By examining the evolution of the density matrix of the system, we derive some new conclusions about the…
We study a one-dimensional random walk among random conductances, with unbounded jumps. Assuming the ergodicity of the collection of conductances and a few other technical conditions (uniform ellipticity and polynomial bounds on the tails…
We introduce a novel operator to describe a random walk process on a simplicial complex. Walkers are allowed to wonder across simplices of various dimensions, bridging nodes to edges, and edges to triangles, via a nested organization that…
We introduce a general approach for the study of the collective dynamics of non-interacting random walkers on connected networks. We analyze the movement of $R$ independent (Markovian) walkers, each defined by its own transition matrix. By…