Related papers: A Note on Walking Versus Waiting
Random walks have been proposed as a simple method of efficiently searching, or disseminating information throughout, communication and sensor networks. In nature, animals (such as ants) tend to follow correlated random walks, i.e., random…
We propose local-biased random walks on general networks where a Markovian walker can choose between different types of biases in each node to define transitions to its neighbors depending on their degrees. For this ergodic dynamics, we…
Mobile social network applications constitute an important platform for traffic information sharing, helping users collect and share sensor information about the driving conditions they experience on the traveled path in real time. In this…
It is tested in this contribution if and to which extend a method of a pedestrian simulation tool that attempts to make pedestrians walk into the direction of estimated earliest arrival can help to automatically distribute pedestrians - who…
A new proof is given for the formula for the expected return time of a random walk on a graph. This proof makes use of known relationships between electric resistance and random walks.
Increasing popularity of mobile route planning applications based on GPS technology provides opportunities for collecting traffic data in urban environments. One of the main challenges for travel time estimation and prediction in such a…
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 consider several variants of a class of random walks whose increment distributions depend on the average value of the process over its most recent $N$ steps. We investigate the speed of the process, and in particular, the limiting speed…
Modern mobile applications such as navigation services and ride-sharing platforms rely heavily on geospatial technologies, most critically predictions of the time required for a vehicle to traverse a particular route, or the so-called…
We consider a continuous-time random walk which is the generalization, by means of the introduction of waiting periods on sites, of the one-dimensional nonhomogeneous random walk with a position-dependent drift known in the mathematical…
We consider the distribution of the duration time, the time elapsed since it began, of a diffusion process given its present position, under the assumption that the process began at the origin. For unbiased diffusion, the distribution does…
This paper presents an event-driven way finding algorithm for pedestrians in an evacuation scenario, which operates on a graph-based structure. The motivation of each pedestrian is to leave the facility. The events used to redirect…
Random walks find applications in many areas of science and are the heart of essential network analytic tools. When defined on temporal networks, even basic random walk models may exhibit a rich spectrum of behaviours, due to the…
This paper studies online shortest path routing over multi-hop networks. Link costs or delays are time-varying and modeled by independent and identically distributed random processes, whose parameters are initially unknown. The parameters,…
We study an exactly solvable random walk model with long-range memory on arbitrary networks. The walker performs unbiased random steps to nearest-neighbor nodes and intermittently resets to previously visited nodes in a preferential way,…
Topology of urban environments can be represented by means of graphs. We explore the graph representations of several compact urban patterns by random walks. The expected time of recurrence and the expected first passage time to a node…
In this paper, a new methodology, journey-based equity analysis, is presented for measuring the equity of transit convenience between income groups. Two data sources are combined in the proposed transit equity analysis: on-board ridership…
Individuals working towards a goal often exhibit time inconsistent behavior, making plans and then failing to follow through. One well-known model of such behavioral anomalies is present-bias discounting: individuals over-weight present…
Recommending routes by their probability of having a rider has long been the goal of conventional route recommendation systems. While this maximizes the platform-specific criteria of efficiency, it results in sub-optimal outcomes with the…
We investigate a class of optimal stopping problems arising in, for example, studies considering the timing of an irreversible investment when the underlying follows a skew Brownian motion. Our results indicate that the local directional…