Graph sparsification by effective resistances
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Duality and nonlinear graph Laplacians
- An effective region force for some variational models for learning and clustering
- A note on using the resistance-distance matrix to solve Hamiltonian cycle problem
- Resistance distance in straight linear 2-trees
- Engineering a combinatorial Laplacian solver: lessons learned
- A queueing network-based distributed Laplacian solver
- On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms
- Approximate \(\ell_0\)-penalized estimation of piecewise-constant signals on graphs
- Several topological indices of two kinds of tetrahedral networks
- Electrical flows over spanning trees
- Graph coarsening: from scientific computing to machine learning
- Algorithmic techniques for finding resistance distances on structured graphs
- The controllability Gramian of lattice graphs
- A queueing network-based distributed Laplacian solver for directed graphs
- Near-optimal discrete optimization for experimental design: a regret minimization approach
- Polynomial-time algorithms for submodular Laplacian systems
- A generalized Lieb's theorem and its applications to spectrum estimates for a sum of random matrices
- Fast predictive multi-fidelity prediction with models of quantized fidelity levels
- A fast algorithm for manifold learning by posing it as a symmetric diagonally dominant linear system
- Expander spanning subgraphs with large girth
- Faster cut sparsification of weighted graphs
- Higher dimensional electrical circuits
- Spectral sparsification via random spanners
- Reducing parallel communication in algebraic multigrid through sparsification
- Spectral sparsification in dynamic graph streams
- Subgraph sparsification and nearly optimal ultrasparsifiers
- Ranking and sparsifying a connection graph
- Spectral sparsification and regret minimization beyond matrix multiplicative updates
- Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence
- Single pass spectral sparsification in dynamic streams
- Spectral sparsification of graphs
- Graphs, vectors, and matrices
- Approximating spectral clustering via sampling: a review
- Approximation algorithms for \(D\)-optimal design
- Constructing linear-sized spectral sparsification in almost-linear time
- Randomized algorithms in numerical linear algebra
- Effective Resistance Preserving Directed Graph Symmetrization
- On computationally tractable selection of experiments in measurement-constrained regression models
- Twice-Ramanujan sparsifiers
- An SDP-based algorithm for linear-sized spectral sparsification
- Sampling random spanning trees faster than matrix multiplication
- Graph Clustering using Effective Resistance
- Edge sampling using local network information
- Density independent algorithms for sparsifying k-step random walks
- Dynamic effective resistances and approximate Schur complement on separable graphs
- Graph powering and spectral robustness
- Rigidity of random subgraphs and eigenvalues of stiffness matrices
- Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem
- Shape simplification through graph sparsification
- Proportional volume sampling and approximation algorithms for \(A\)-optimal design
- Persistent Laplacians: properties, algorithms and implications
- Hamiltonian sparsification and gap-simulation
- On solving linear systems in sublinear time
- Sparsification of Binary CSPs
- A Spectral Approach to Network Design
- Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
- Derandomization beyond connectivity: undirected Laplacian systems in nearly logarithmic space
- The power of vertex sparsifiers in dynamic graph algorithms
- Determinant-preserving sparsification of SDDM matrices
- On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms
- A primal-dual optimization strategy for elliptic partial differential equations
- Twice-Ramanujan sparsifiers
- Twice-Ramanujan sparsifiers
- Fully dynamic spectral vertex sparsifiers and applications
- Graph reduction with spectral and cut guarantees
- Sparsification of binary CSPs
- A general framework for graph sparsification
- Spectral sparsification of hypergraphs
- Short cycles via low-diameter decompositions
- Randomized approximation schemes for cuts and flows in capacitated graphs
- Sparsification of two-variable valued constraint satisfaction problems
- Towards resistance sparsifiers
- A general framework for graph sparsification
- Minimizing Effective Resistance of a Graph
- Partitioning well-clustered graphs: spectral clustering works!
- Online row sampling
- Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis
- scientific article; zbMATH DE number 7650128 (Why is no real title available?)
- Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving
- Efficient Point-to-Point Resistance Distance Queries in Large Graphs
- Randomized numerical linear algebra: Foundations and algorithms
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
- Constructive subsampling of finite frames with applications in optimal function recovery
- Communication-efficient distributed graph clustering and sparsification under duplication models
- Network Design for s - t Effective Resistance
- Local2global: a distributed approach for scaling representation learning on graphs
- Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions
- Minimum cost flow in the CONGEST model
- Randomized least-squares with minimal oversampling and interpolation in general spaces
- Ranking edges by their impact on the spectral complexity of information diffusion over networks
- Random walks, conductance, and resistance for the connection graph Laplacian
- New seeding strategies for the influence maximization problem
- Cholesky-like preconditioner for Hodge Laplacians via heavy collapsible subcomplex
- Network Estimation by Mixing: Adaptivity and More
- Cover and hitting times of hyperbolic random graphs
- Spectral sparsification via bounded-independence sampling
- Monotonicity of resistance distance in linear 2-trees
- Quantum speedups for linear programming via interior point methods
- Better sparsifiers for directed Eulerian graphs
- Adaptive sparsification for matroid intersection
This page was built for publication: Graph sparsification by effective resistances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6032752)
