Tales of Transition Paths: Policy Uncertainty and Random Walks
نویسندگان
چکیده
منابع مشابه
Lattice paths and random walks
Lattice paths are ubiquitous in combinatorics and algorithmics, where they are either studied per se, or as a convenient encoding of other structures. Logically, they play an important role in Philippe’s papers. For instance, they are central in his combinatorial theory of continued fractions, to which Chapter 3 of this volume is devoted. In this chapter, we present a collection of seven papers...
متن کاملMultiple Random Walks on Paths and Grids
We derive several new results on multiple random walks on “low dimensional” graphs. First, inspired by an example of a weighted random walk on a path of three vertices given by Efremenko and Reingold [7], we prove the following dichotomy: as the path length n tends to infinity, we have a super-linear speed-up w.r.t. the cover time if and only if the number of walks k is equal to 2. An important...
متن کاملRandom walks and the Hagedorn transition
We study details of the approach to the Hagedorn temperature in string theory in various static spacetime backgrounds. We show that the partition function for a single string at finite temperature is the torus amplitude restricted to unit winding around Euclidean time. We use worldsheet path integral to derive the statement that the the sum over random walks of the thermal scalar near the Haged...
متن کاملOn Shortest Random Walks under Adversarial Uncertainty
Finding shortest feasible paths in a weighted graph has numerous applications including admission and routing in communication networks. This paper discusses a game theoretic framework intended to incorporate a concept of path stability into the process of shortest path selection. Route stability is an important issue in a wire-line and especially in wireless network due to node mobility as wel...
متن کاملLocalization transition of biased random walks on random networks.
We study random walks on large random graphs that are biased towards a randomly chosen but fixed target node. We show that a critical bias strength bc exists such that most walks find the target within a finite time when b > bc. For b < bc, a finite fraction of walks drift off to infinity before hitting the target. The phase transition at b=bc is a critical point in the sense that quantities su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2015
ISSN: 1556-5068
DOI: 10.2139/ssrn.2665119