Dynamic Complexity of Expansion

08/13/2020
by   Samir Datta, et al.
0

Dynamic Complexity was introduced by Immerman and Patnaik <cit.> (see also <cit.>). It has seen a resurgence of interest in the recent past, see <cit.> for some representative examples. Use of linear algebra has been a notable feature of some of these papers. We extend this theme to show that the gap version of spectral expansion in bounded degree graphs can be maintained in the class (also known as , for domain independent queries) under batch changes (insertions and deletions) of O(logn/loglogn) many edges. The spectral graph theoretic material of this work is based on the paper by Kale-Seshadri <cit.>. Our primary technical contribution is to maintain up to logarithmic powers of the transition matrix of a bounded degree undirected graph in .

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/21/2020

Near-Additive Spanners and Near-Exact Hopsets, A Unified View

Given an unweighted undirected graph G = (V,E), and a pair of parameter...
research
08/21/2020

Quantum LDPC codes with Ω(√(n)log^kn) distance, for any k

In this work we construct quantum LDPC codes of distance √(n)log^k n for...
research
03/22/2021

From Coupling to Spectral Independence and Blackbox Comparison with the Down-Up Walk

We show that the existence of a “good” coupling w.r.t. Hamming distance ...
research
10/02/2020

A Weight-scaling Algorithm for f-factors of Multigraphs

We discuss combinatorial algorithms for finding a maximum weight f-facto...
research
08/09/2021

The mysteries of the best approximation and Chebyshev expansion for the function with logarithmic regularities

The best polynomial approximation and Chebyshev approximation are both i...
research
03/30/2023

A Characterization of Online Multiclass Learnability

We consider the problem of online multiclass learning when the number of...
research
09/03/2019

Starting CLuP with polytope relaxation

The Controlled Loosening-up (CLuP) mechanism that we recently introduced...

Please sign up or login with your details

Forgot password? Click here to reset