• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Random Walks on Graphs: A Survey (1993)

Cached

  • Download as a PDF

Download Links

  • [msande337.stanford.edu]
  • [www.stanford.edu]
  • [www.cs.yale.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by L. Lovász
Citations:173 - 3 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Lovász93randomwalks,
    author = {L. Lovász},
    title = {Random Walks on Graphs: A Survey},
    year = {1993}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Citations

969 Geometric algorithms and combinatorial optimization - Grötschel, Lovász, et al. - 1993
289 Eigenvalues and expanders - Alon - 1986
257 Approximating the Permanent - Jerrum, Sinclair - 1989
253 A PolynomialTime Approximation Algorithm for the Permanent of a Matrix with Nonnegative Entries - Jerrum, Sinclair, et al.
250 Random Generation of Combinatorial Structures from a Uniform Distributions, Theoret. Computer Sci - Jerrum, Valiant, et al. - 1986
246 Group representations in Probability and Statistics - Diaconis - 1988
233 Geometric bounds for eigenvalues of Markov chains,” The Annals of Applied Probability - Diaconis, Stroock - 1991
222 An approximate max-flow mincut theorem for uniform multicommodity flow problems with applications to approximation algorithms - Leighton, Rao - 1988
161 Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks - Awerbuch, Leighton - 1994
137 λ1, isoperimetric inequalities for graphs, and superconcentrators - Alon, Milman - 1985
130 A random polynomial time algorithm for approximating the volume of a convex body - Dyer, Frieze, et al. - 1991
118 The electrical resistance of a graph captures its commute and cover times - Chandra, Raghavan, et al. - 1989
104 Random walks in a convex body and an improved volume algorithm. Random Structures Algorithms - Lovász, Simonovits - 1993
99 Generating random spanning trees - Broder - 1989
92 Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process. The Annals of Applied Probablity - Fill - 1991
82 Conductance and the rapid mixing property for markov chains: the approximation of permanent resolved - Jerrum, Sinclair - 1988
73 Balanced Matroids - Feder, Mihail - 1992
69 Sampling and Integration of Near Log-Concave functions, STOC - Applegate, Kannan - 1991
69 Markov Chain Models - Rarity and Exponentiality - Keilson - 1979
66 1, isoperimetric inequalities for graphs, and superconcentrators - Alon, Milman - 1985
62 How hard is to marry at random? (On the approximation of the permanent - Broder - 1986
61 Collisions among random walks on graphs - Coppersmith, Tetali, et al. - 1993
54 The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume, preprint - Lovász, Simonovits - 1990
52 Computing the volume of convex bodies: A case where randomness provably helps - Dyer, Frieze - 1991
47 Stationarity Detection in the Initial Transient Problem - Asmussen, Glynn, et al. - 1992
47 Random walks and the effective resistance of networks - Tetali - 1991
44 Approximation through multicommodity flow - Agrawal, Klein, et al. - 1990
44 Covering problems for brownian motion on spheres - Matthews - 1988
42 Large cliques elude the metropolis process, Random Structures and Algorithms - Jerrum - 1992
40 Computing the volume is difficult - Bárány, Füredi - 1987
31 A geometric inequality and the complexity of computing volume - Elekes - 1986
28 On the randomized complexity of volume and diameter - Lov'asz, Simonovits - 1992
26 Combinatorial Laplacians and isoperimetric inequality, From Local Times to Global Geometry - Dodziuk, Kendall - 1986
25 Eigen-analysis for some examples of the Metropolis algorithm, in Hypergeometric functions on domains of positivity, Jack polynomials, and applications - Diaconis, Hanlon - 1992
23 Szegedy: Local expansion of symmetrical graphs - Babai, M - 1992
23 Random walk and electric currents in networks - Nash-Williams - 1959
23 IJber eine Aufgabe der Wahrscheinlichkeitsrechnung betreffend die lrrfahrt im Strassennetz. MathematischeAnnalen - Polya - 1921
21 Lower bounds for covering times for reversible markov chains and random walks - Aldous - 1989
19 Monte Carlo algorithms in graph isomorphism testing - Babai - 1979
19 Efficient stopping rules for Markov chains - Lovász, Winkler - 1995
15 Simultaneous reversible Markov chains - Tetali, Winkler - 1993
14 Resistances and currents in infinite electrical networks - Thomassen - 1990
13 Complexity of polytope volume computation - Khachiyan - 1993
12 A randomised approximation algorithm for counting the number of forests - Annan - 1994
10 The random walk construction for spanning trees and uniform labeled trees - Aldous - 1990
9 A Tight Upper Bound for the Cover Time - Feige - 1995
9 How to compute the volume? Jber. d - Lovász - 1992
8 Maximum hitting time for random walks on graphs - Brightwell, Winkler - 1990
7 A note on the last new vertex visited by a random walk - Lovász, Winkler - 1993
6 A Tight Lower Bound for the Cover Time - Feige - 1995
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University