More Like this

1. Explicit Abelian Lifts and Quantum LDPC Codes

   https://doi.org/10.4230/LIPIcs.ITCS.2022.88  

   Jeronimo, Fernando Granha (January 2022, Leibniz international proceedings in informatics)

   Braverman, Mark (Ed.)

   For an abelian group H acting on the set [𝓁], an (H,𝓁)-lift of a graph G₀ is a graph obtained by replacing each vertex by 𝓁 copies, and each edge by a matching corresponding to the action of an element of H. Expanding graphs obtained via abelian lifts, form a key ingredient in the recent breakthrough constructions of quantum LDPC codes, (implicitly) in the fiber bundle codes by Hastings, Haah and O'Donnell [STOC 2021] achieving distance Ω̃(N^{3/5}), and in those by Panteleev and Kalachev [IEEE Trans. Inf. Theory 2021] of distance Ω(N/log(N)). However, both these constructions are non-explicit. In particular, the latter relies on a randomized construction of expander graphs via abelian lifts by Agarwal et al. [SIAM J. Discrete Math 2019]. In this work, we show the following explicit constructions of expanders obtained via abelian lifts. For every (transitive) abelian group H ⩽ Sym(𝓁), constant degree d ≥ 3 and ε > 0, we construct explicit d-regular expander graphs G obtained from an (H,𝓁)-lift of a (suitable) base n-vertex expander G₀ with the following parameters: ii) λ(G) ≤ 2√{d-1} + ε, for any lift size 𝓁 ≤ 2^{n^{δ}} where δ = δ(d,ε), iii) λ(G) ≤ ε ⋅ d, for any lift size 𝓁 ≤ 2^{n^{δ₀}} for a fixed δ₀ > 0, when d ≥ d₀(ε), or iv) λ(G) ≤ Õ(√d), for lift size "exactly" 𝓁 = 2^{Θ(n)}. As corollaries, we obtain explicit quantum lifted product codes of Panteleev and Kalachev of almost linear distance (and also in a wide range of parameters) and explicit classical quasi-cyclic LDPC codes with wide range of circulant sizes. Items (i) and (ii) above are obtained by extending the techniques of Mohanty, O'Donnell and Paredes [STOC 2020] for 2-lifts to much larger abelian lift sizes (as a byproduct simplifying their construction). This is done by providing a new encoding of special walks arising in the trace power method, carefully "compressing" depth-first search traversals. Result (iii) is via a simpler proof of Agarwal et al. [SIAM J. Discrete Math 2019] at the expense of polylog factors in the expansion. 

   more » « less
2. On Light Spanners, Low-treewidth Embeddings and Efficient Traversing in Minor-free Graphs

   Cohen-Addad, Vincent; Filtser, Arnold; Klein, Philip N; Le, Hung (October 2020, Proceedings of the 61st Annual IEEE Symposium on Foundations of Computer Science)

   null (Ed.)

   Understanding the structure of minor-free metrics, namely shortest path metrics obtained over a weighted graph excluding a fixed minor, has been an important research direction since the fundamental work of Robertson and Seymour. A fundamental idea that helps both to understand the structural properties of these metrics and lead to strong algorithmic results is to construct a “small-complexity” graph that approximately preserves distances between pairs of points of the metric. We show the two following structural results for minor-free metrics: 1) Construction of a light subset spanner. Given a subset of vertices called terminals, and ϵ, in polynomial time we construct a sub graph that preserves all pairwise distances between terminals up to a multiplicative 1+ϵ factor, of total weight at most Oϵ(1) times the weight of the minimal Steiner tree spanning the terminals. 2) Construction of a stochastic metric embedding into low treewidth graphs with expected additive distortion ϵD. Namely, given a minor-free graph G=(V,E,w) of diameter D, and parameter ϵ, we construct a distribution D over dominating metric embeddings into treewidth-Oϵ(log n) graphs such that ∀u,v∈V, Ef∼D[dH(f(u),f(v))]≤dG(u,v)+ϵD. Our results have the following algorithmic consequences: (1) the first efficient approximation scheme for subset TSP in minor-free metrics; (2) the first approximation scheme for bounded-capacity vehicle routing in minor-free metrics; (3) the first efficient approximation scheme for bounded-capacity vehicle routing on bounded genus metrics. En route to the latter result, we design the first FPT approximation scheme for bounded-capacity vehicle routing on bounded-treewidth graphs (parameterized by the treewidth). 

   more » « less
3. Borel and Volume Classes for Dense Representations of Discrete Groups

   https://doi.org/10.1093/imrn/rnab078  

   Farre, James (April 2021, International Mathematics Research Notices)

   Abstract We show that the bounded Borel class of any dense representation $$\rho : G\to{\operatorname{PSL}}_n{\mathbb{C}}$$ is non-zero in degree three bounded cohomology and has maximal semi-norm, for any discrete group $$G$$. When $n=2$, the Borel class is equal to the three-dimensional hyperbolic volume class. Using tools from the theory of Kleinian groups, we show that the volume class of a dense representation $$\rho : G\to{\operatorname{PSL}}_2{\mathbb{C}}$$ is uniformly separated in semi-norm from any other representation $$\rho ^{\prime}: G\to{\operatorname{PSL}}_2 {\mathbb{C}}$$ for which there is a subgroup $$H\le G$$ on which $$\rho $$ is still dense but $$\rho ^{\prime}$$ is discrete or indiscrete but stabilizes a point, line, or plane in $${\mathbb{H}}^3\cup \partial{\mathbb{H}}^3$$. We exhibit a family of dense representations of a non-abelian free group on two letters and a family of discontinuous dense representations of $${\operatorname{PSL}}_2{\mathbb{R}}$$, whose volume classes are linearly independent and satisfy some additional properties; the cardinality of these families is that of the continuum. We explain how the strategy employed may be used to produce non-trivial volume classes in higher dimensions, contingent on the existence of a family of hyperbolic manifolds with certain topological and geometric properties. 

   more » « less
4. Local Access to Random Walks , January 2022

   Biswas, A.S.; Pyne, E.; Rubinfeld, R. (January 2022, Innovations in Theoretical Computer Science (ITCS 2022))

   For a graph G on n vertices, naively sampling the position of a random walk of at time t requires work Ω(t). We desire local access algorithms supporting positionG(t) queries, which return the position of a random walk from some fixed start vertex s at time t, where the joint distribution of returned positions is 1/ poly(n) close to those of a uniformly random walk in ℓ1 distance. We first give an algorithm for local access to random walks on a given undirected d-regular graph with eO( 1 1−λ √ n) runtime per query, where λ is the second-largest eigenvalue of the random walk matrix of the graph in absolute value. Since random d-regular graphs G(n, d) are expanders with high probability, this gives an eO(√ n) algorithm for a graph drawn from G(n, d) whp, which improves on the naive method for small numbers of queries. We then prove that no algorithm with subconstant error given probe access to an input d-regular graph can have runtime better than Ω(√ n/ log(n)) per query in expectation when the input graph is drawn from G(n, d), obtaining a nearly matching lower bound. We further show an Ω(n1/4) runtime per query lower bound even with an oblivious adversary (i.e. when the query sequence is fixed in advance). We then show that for families of graphs with additional group theoretic structure, dramatically better results can be achieved. We give local access to walks on small-degree abelian Cayley graphs, including cycles and hypercubes, with runtime polylog(n) per query. This also allows for efficient local access to walks on polylog degree expanders. We show that our techniques apply to graphs with high degree by extending or results to graphs constructed using the tensor product (giving fast local access to walks on degree nϵ graphs for any ϵ ∈ (0, 1]) and Cartesian product. 

   more » « less
5. Random quantum graphs

   https://doi.org/10.1090/tran/8584  

   Chirvasitu, Alexandru; Wasilewski, Mateusz (April 2022, Transactions of the American Mathematical Society)

   We prove a number of results to the effect that generic quantum graphs (defined via operator systems as in the work of Duan-Severini-Winter / Weaver) have few symmetries: for a Zariski-dense open set of tuples ( X 1 , ⋯ , X d ) (X_1,\cdots ,X_d) of traceless self-adjoint operators in the n × n n\times n matrix algebra the corresponding operator system has trivial automorphism group, in the largest possible range for the parameters: 2 ≤ d ≤ n 2 − 3 2\le d\le n^2-3 . Moreover, the automorphism group is generically abelian in the larger parameter range 1 ≤ d ≤ n 2 − 2 1\le d\le n^2-2 . This then implies that for those respective parameters the corresponding random-quantum-graph model built on the GUE ensembles of X i X_i ’s (mimicking the Erdős-Rényi G ( n , p ) G(n,p) model) has trivial/abelian automorphism group almost surely. 

   more » « less