Large deviations of random walks on random graphs
نویسندگان
چکیده
منابع مشابه
Random Walks on Random Graphs
The aim of this article is to discuss some of the notions and applications of random walks on finite graphs, especially as they apply to random graphs. In this section we give some basic definitions, in Section 2 we review applications of random walks in computer science, and in Section 3 we focus on walks in random graphs. Given a graphG = (V,E), let dG(v) denote the degree of vertex v for all...
متن کاملLarge Deviations for Random Walks in a Mixing Random Environment and Other (Non-Markov) Random Walks
We extend a recent work by S. R. S. Varadhan [8] on large deviations for random walks in a product random environment to include more general random walks on the lattice. In particular, some reinforced random walks and several classes of random walks in Gibbs fields are included. c © 2004 Wiley Periodicals, Inc.
متن کاملRandom walks on graphs
Let G = (V,E) be a connected, undirected graph. We shall consider the following model of a random walk on G. The walk starts out at time 0 in some initial distribution on the vertex set V ; the initial condition may be deterministic, which corresponds to the distribution assigning probability 1 to a single vertex. The random walk is constructed as follows. There are independent unit rate Poisso...
متن کاملLarge Deviations in Randomly Coloured Random Graphs
Models of random graphs are considered where the presence or absence of an edge depends on the random types (colours) of its vertices, so that whether or not edges are present can be dependent. The principal objective is to study large deviations in the number of edges. These graphs provide a natural example with two different non-degenerate large deviation regimes, one arising from large devia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2019
ISSN: 2470-0045,2470-0053
DOI: 10.1103/physreve.99.022137