F. Gobel and A. Jagers. Random walks on graphs. Stochastic Processes and their Applications, 2:311--336, 1974. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The Electrical Resistance Of A Graph Captures Its.. - Chandra.. (1989) (61 citations) (Correct)
....equality (like the equalities of Doyle and Snell) reiterates the fact that the electrical properties of the network underlying a graph are innately tied to the random walk. Prior work in the study of the cover time of graphs has used techniques from Markov chain theory (Aleliunas et al. 1979, Gobel Jagers 1974), from combinatorics (Kahn et al. 1989) from linear algebra (Broder Karlin 1989) and from graph theory (Jerrum Sinclair 1989) The electrical approach used here provides an intuitive basis for understanding a variety of phenomena about random walks that had hitherto seemed counterintuitive. ....
.... mesh of size p n Theta p n has resistance Theta(log n) whereas d dimensional meshes for 3 d log 2 n have resistance Theta(1=d) Random walks on meshes have been previously considered by many authors, including some studies of cover times by Aldous (1983, 1993) Cox (1989) and Gobel Jagers (1974) (the later only for d = log 2 n, i.e. hypercubes) Although our conclusions about cover times of meshes were previously known, our approach is novel and potentially illuminating. For example, the resistance of a graph will generally not be changed significantly by the insertion or removal of a ....
[Article contains additional citation context not shown here]
F. G obel and A. A. Jagers, Random walks on graphs. Stochastic Processes and their Applications 2 (1974), 311--336.
Average-Case Analysis of Graph-Searching Algorithms - Kapidakis (1990) (2 citations) (Correct)
.... one path joining any two nodes, have many applications too [AS] OSW] Ya78] and have been studied a lot [Br] KP] EP] Ke] MM] Pro] Problems similar to graph searching have been studied too, like the s t connectivity, that decides if a node t is accessible from a node s [BKRU] random walks [GJ], traversal sequences [AKLLR] or parallel searching [KUW] In undirected graphs, when we count the number of edges used, we count the edges we use in both directions twice. The total number of edges counted may be up to twice the number of existing edges, but the same expression will be ....
....the number of nodes and the number of edges, but most of our results are expressed more easily using the G p (n) model. 2. 1 Known properties and algorithms Random graphs were introduced and initially studied by Erdos and R enyi [ER59] and [ER60] and have been studied extensively thereafter [EP] [GJ] [Kar o] BT] A collection of interesting and useful results on random graphs can be found in Reference [Bo85] To better understand random graphs, we summarize some of those results below. In most cases, the properties of random graphs that have been studied in the literature assume an undirected ....
F. Gobel and A.A. Jagers. Random Walks on Graphs, Stochastic Processes and their Applications, Vol. 2 (1974), 311-336.
Fast, Randomized Join-Order Selection - Why Use.. - Galindo-Legaria.. (1994) (1 citation) (Correct)
....to the technique used in section 3 to generate plans exhaustively. Here, instead of considering all possible graph splittings, we split the graphs by randomly selecting an edge at each step, which results in a random plan. Random walks in graphs have been widely studied see, for example, [GJ74, Ald89, Rag90]. In particular, if all nodes in a graph have equal degree, as is the case in the search space for acyclic queries [Kan91] then we are equally likely to be at any node of the graph after n steps, for a sufficiently large n, regardless of the starting point. In practice, however, the length of the ....
F. Gobel and A.A. Jagers. Random walks on graphs. Stochastic Processes and their Applications, 2(1):311--336, 1974.
Mitsubishi Electric Research Laboratories - Http Www Merl (2005) (Correct)
No context found.
F. Gobel and A. Jagers. Random walks on graphs. Stochastic Processes and their Applications, 2:311--336, 1974.
Clustering Using a Random Walk Based Distance Measure - Yen, Vanvyve, Wouters.. (2005) (2 citations) (Correct)
No context found.
F. Gobel and A. Jagers. Random walks on graphs. Stochastic Processes and their Applications, 2:311--336, 1974.
The Principal Components Analysis of a Graph, and its.. - Saerens, Fouss, Yen.. (2004) (2 citations) (Correct)
No context found.
F. Gobel and A. Jagers. Random walks on graphs. Stochastic Processes and their Applications, 2:311--336, 1974.
A Novel Way of Computing Dissimilarities between.. - Fouss, Pirotte.. (2004) (1 citation) (Correct)
No context found.
F. Gobel and A. Jagers. Random walks on graphs. Stochastic Processes and their Applications, 2:311--336, 1974.
The Application of New Concepts of Dissimilarities.. - Fouss, Pirotte, Saerens (2004) (Correct)
No context found.
F. Gobel and A. Jagers. Random walks on graphs. Stochastic Processes and their Applications, 2:311--336, 1974.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC