Fully Dynamic Spectral Vertex Sparsifiers and Applications Article Swipe

MAKE IMPACT

David Durfee , Yu Gao , Gramoz Goranci , Richard Peng · YOU? · · 2019 · Open Access · · DOI: https://doi.org/10.48550/arxiv.1906.10530

We study \emph{dynamic} algorithms for maintaining spectral vertex sparsifiers of graphs with respect to a set of terminals $T$ of our choice. Such objects preserve pairwise resistances, solutions to systems of linear equations, and energy of electrical flows between the terminals in $T$. We give a data structure that supports insertions and deletions of edges, and terminal additions, all in sublinear time. Our result is then applied to the following problems. (1) A data structure for maintaining solutions to Laplacian systems $\mathbf{L} \mathbf{x} = \mathbf{b}$, where $\mathbf{L}$ is the Laplacian matrix and $\mathbf{b}$ is a demand vector. For a bounded degree, unweighted graph, we support modifications to both $\mathbf{L}$ and $\mathbf{b}$ while providing access to $ε$-approximations to the energy of routing an electrical flow with demand $\mathbf{b}$, as well as query access to entries of a vector $\tilde{\mathbf{x}}$ such that $\left\lVert \tilde{\mathbf{x}}-\mathbf{L}^{\dagger} \mathbf{b} \right\rVert_{\mathbf{L}} \leq ε\left\lVert \mathbf{L}^{\dagger} \mathbf{b} \right\rVert_{\mathbf{L}}$ in $\tilde{O}(n^{11/12}ε^{-5})$ expected amortized update and query time. (2) A data structure for maintaining All-Pairs Effective Resistance. For an intermixed sequence of edge insertions, deletions, and resistance queries, our data structure returns $(1 \pm ε)$-approximation to all the resistance queries against an oblivious adversary with high probability. Its expected amortized update and query times are $\tilde{O}(\min(m^{3/4},n^{5/6} ε^{-2}) ε^{-4})$ on an unweighted graph, and $\tilde{O}(n^{5/6}ε^{-6})$ on weighted graphs. These results represent the first data structures for maintaining key primitives from the Laplacian paradigm for graph algorithms in sublinear time without assumptions on the underlying graph topologies.

Type

preprint

Language

en

Landing Page

http://arxiv.org/abs/1906.10530

PDF

https://arxiv.org/pdf/1906.10530

OA Status

green

References

70

Related Works

10

OpenAlex ID

https://openalex.org/W2950470682

Raw OpenAlex JSON

OpenAlex ID

https://openalex.org/W2950470682

Canonical identifier for this work in OpenAlex

DOI

https://doi.org/10.48550/arxiv.1906.10530

Digital Object Identifier

Title

Fully Dynamic Spectral Vertex Sparsifiers and Applications

Work title

Type

preprint

OpenAlex work type

Language

en

Primary language

Publication year

2019

Year of publication

Publication date

2019-06-24

Full publication date if available

Authors

David Durfee, Yu Gao, Gramoz Goranci, Richard Peng

List of authors in order

Landing page

https://arxiv.org/abs/1906.10530

Publisher landing page

PDF URL

https://arxiv.org/pdf/1906.10530

Direct link to full text PDF

Open access

Yes

Whether a free full text is available

OA status

green

Open access status per OpenAlex

OA URL

https://arxiv.org/pdf/1906.10530

Direct OA link when available

Concepts

Combinatorics, Vertex (graph theory), Sublinear function, Bounded function, Energy (signal processing), Physics, Discrete mathematics, Graph, Mathematics, Mathematical analysis, Quantum mechanics

Top concepts (fields/topics) attached by OpenAlex

Cited by

0

Total citation count in OpenAlex

References (count)

70

Number of works referenced by this work

Related works (count)

10

Other works algorithmically related by OpenAlex

Full payload