Related papers: A Note on Walking Versus Waiting
We investigate simple strategies that embody the decisions that one faces when trying to park near a popular destination. Should one park far from the target (destination), where finding a spot is easy, but then be faced with a long walk,…
A natural extension of a right-continuous integer-valued random walk is one which can jump to the right by one or two units. First passage times above a given fixed level then admit a tractable Laplace transform (probability generating…
A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…
Travel time prediction is a well-renowned topic of research. It is primarily influenced by traffic congestion, road conditions and route geometry. Among them route geometry at any point is not investigated enough to find a sound spatial…
This paper considers trajectory planning for a mobile robot which persistently relays data between pairs of far-away communication nodes. Data accumulates stochastically at each source, and the robot must move to appropriate positions to…
The increased availability of large-scale trajectory data around the world provides rich information for the study of urban dynamics. For example, New York City Taxi Limousine Commission regularly releases source-destination information…
In this paper, we revisit the problem of classical \textit{meeting times} of random walks in graphs. In the process that two tokens (called agents) perform random walks on an undirected graph, the meeting times are defined as the expected…
This research considers Bayesian decision-analytic approaches toward the traversal of an uncertain graph. Namely, a traveler progresses over a graph in which rewards are gained upon a node's first visit and costs are incurred for every edge…
Random walks serve as important tools for studying complex network structures, yet their dynamics in cases where transition probabilities are not static remain under explored and poorly understood. Here we study nonlinear random walks that…
Project promoters, forecasters, and managers sometimes object to two things in measuring inaccuracy in travel demand forecasting: (1) using the forecast made at the time of making the decision to build as the basis for measuring inaccuracy…
We study the biased random walk where at each step of a random walk a "controller" can, with a certain small probability, move the walk to an arbitrary neighbour. This model was introduced by Azar et al. [STOC'1992]; we extend their work to…
The remaining travel time of a plane shortens with every minute that passes from its departure, and a flame diminishes a candle with every second it burns. Such everyday occurrences bias us to think that processes which have already begun…
Building upon the knowledge of the distribution of the first positive position reached by a random walker starting from the origin, one can derive new results on the statistics of the gap between the largest and second-largest positions of…
Expected urban population doubling calls for a compelling theory of the city. Random walks and diffusions defined on spatial city graphs spot hidden areas of geographical isolation in the urban landscape going downhill. First--passage time…
In vehicular traffic planning it is a long standing problem how to assign demand such on the available model of a road network that an equilibrium with regard to travel time or generalized costs is realized. For pedestrian traffic this…
Random walks with memory typically involve rules where a preference for either revisiting or avoiding those sites visited in the past are introduced somehow. Such effects have a direct consequence on the statistics of first-passage and…
We present experimental results obtained for a one-dimensional flow using high precision motion capture. The full pedestrians' trajectories are obtained. In this paper, we focus on the fundamental diagram, and on the relation between the…
Motion prediction for intelligent vehicles typically focuses on estimating the most probable future evolutions of a traffic scenario. Estimating the gap acceptance, i.e., whether a vehicle merges or crosses before another vehicle with the…
Standard algorithms for reachability analysis of timed automata are sensitive to the order in which the transitions of the automata are taken. To tackle this problem, we propose a ranking system and a waiting strategy. This paper discusses…
In two intersecting many-particle streams, one can often find the emergence of oscillatory patterns. Here, we investigate the interaction of pedestrians with vehicles, when they try to cross a road. A numerical study of this coupled…