Random walks and local cuts in graphs
DOI10.1016/J.LAA.2006.07.018zbMATH Open1115.05054OpenAlexW2032336879MaRDI QIDQ876299FDOQ876299
Publication date: 18 April 2007
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2006.07.018
Recommendations
- scientific article; zbMATH DE number 4197088
- Cutoff phenomena for random walks on random regular graphs
- scientific article; zbMATH DE number 4007384
- Random walks and bisections in random circulant graphs
- Random walks on graphs: ideas, techniques and results
- Random walks on the random graph
- Random walks on dense graphs and graphons
- Cutpoints for simple random walks on quasi-transitive graphs
- scientific article; zbMATH DE number 878897
- scientific article; zbMATH DE number 909704
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Statistical mechanics of complex networks
- Title not available (Why is that?)
- Collective dynamics of ‘small-world’ networks
- Random walks in a convex body and an improved volume algorithm
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- A random graph model for massive graphs
Cited In (16)
- Title not available (Why is that?)
- Variational perspective on local graph clustering
- Title not available (Why is that?)
- A Cheeger-type inequality on simplicial complexes
- Polynomial-time algorithms for submodular Laplacian systems
- Eigenvalues of 2-edge-coverings
- Dirichlet Eigenvalues, Local Random Walks, and Analyzing Clusters in Graphs
- Improved Cheeger's Inequality and Analysis of Local Graph Partitioning using Vertex Expansion and Expansion Profile
- Random walks on simplicial complexes and harmonics
- Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
- Compressive Sensing for Cut Improvement and Local Clustering
- Stochastic forms of non-negative matrices and Perron-regularity
- Graph clustering
- The cut metric, random graphs, and branching processes
- Harmonic analysis on graphs via Bratteli diagrams and path-space measures
- Random walks associated with symmetric \(M\)-matrices
This page was built for publication: Random walks and local cuts in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876299)
