Fetching the paper…
Reading the bibliography…
We study the problem of constructing explicit sparse graphs that exhibit strong vertex expansion.
Probability inequalities for sums of bounded random variables
Wassily Hoeffding · 1963
Earlier work this paper cites.
On discrete subgroups of the two by two projective linear group over p-adic fields
Yasutaka Ihara · 1966
Earlier work this paper cites.
A recursive approach to low complexity codes
R Tanner · 1981
Earlier work this paper cites.
Explicit construction of linear sized tolerant networks
Noga Alon and Fan RK Chung · 1988
Earlier work this paper cites.
Ramanujan graphs
Alexander Lubotzky, Ralph Phillips, and Peter Sarnak · 1988
Earlier work this paper cites.
Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
Grigorii Aleksandrovich Margulis · 1988
Earlier work this paper cites.
Zeta functions of finite graphs and representations of p-adic groups
Ki-ichiro Hashimoto · 1989
Earlier work this paper cites.
The Ihara-Selberg zeta function of a tree lattice
Hyman Bass · 1992
Earlier work this paper cites.
Existence and explicit constructions of q+ 1 regular Ramanujan graphs for every prime power q
Moshe Morgenstern · 1994
Earlier work this paper cites.
Eigenvalues and expansion of regular graphs
Nabil Kahale · 1995
Earlier work this paper cites.
On-Line Algorithms for Path Selection in a Nonblocking Network
Sanjeev Arora, FT Leighton, and Bruce M Maggs · 1996
Earlier work this paper cites.
Expander codes
Michael Sipser and Daniel Spielman · 1996
Earlier work this paper cites.
Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors
Omer Reingold, Salil Vadhan, and Avi Wigderson · 2000
Earlier work this paper cites.
Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity
Dima Grigoriev · 2001
Earlier work this paper cites.
Explicit unique-neighbor expanders
Noga Alon and Michael Capalbo · 2002
Earlier work this paper cites.
The Moore bound for irregular graphs
Noga Alon, Shlomo Hoory, and Nathan Linial · 2002
Earlier work this paper cites.
Randomness conductors and constant-degree lossless expanders
Michael Capalbo, Omer Reingold, Salil Vadhan, and Avi Wigderson · 2002
Earlier work this paper cites.
Fault-tolerant quantum computation by anyons
A Yu Kitaev · 2003
Earlier work this paper cites.
Robust local testability of tensor products of LDPC codes
Irit Dinur, Madhu Sudan, and Avi Wigderson · 2006
Cited alongside, same era.
Expander graphs and their applications
Shlomo Hoory, Nathan Linial, and Avi Wigderson · 2006
Cited alongside, same era.
Lossless condensers, unbalanced expanders, and extractors
Amnon Ta-Shma, Christopher Umans, and David Zuckerman · 2007
Cited alongside, same era.
Combining geometry and combinatorics: A unified approach to sparse signal recovery
Radu Berinde, Anna C Gilbert, Piotr Indyk, Howard Karloff, and Martin J Strauss · 2008
Cited alongside, same era.
Linear level lasserre lower bounds for certain k-csps
Grant Schoenebeck · 2008
Cited alongside, same era.
Tensor products of weakly smooth codes are robust
Eli Ben-Sasson and Michael Viderman · 2009
Cited alongside, same era.
High-Girth Near-Ramanujan Graphs with Lossy Vertex Expansion
Theo McKenzie and Sidhanth Mohanty · 2021
Later among the works it cites.
Locally Testable Codes with constant rate, distance, and locality
Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky, and Shahar Mozes · 2022
Later among the works it cites.
Good Quantum LDPC Codes with Linear Time Decoders
Irit Dinur, Min-Hsiu Hsieh, Ting-Chun Lin, and Thomas Vidick · 2022
Later among the works it cites.
ℓ p \ell_{p} -Spread and Restricted Isometry Properties of Sparse Random Matrices
Venkatesan Guruswami, Peter Manohar, and Jonathan Mosheiff · 2022
Later among the works it cites.
An efficient decoder for a linear distance quantum LDPC code
Shouzhen Gu, Christopher A Pattison, and Eugene Tang · 2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Unbalanced expanders and randomness extractors from Parvaresh–Vardy codes
Venkatesan Guruswami, Christopher Umans, and Salil Vadhan · 2009
Cited alongside, same era.
Almost Euclidean subspaces of ℓ 1 N \ell_{1}^{N} via expander codes
Venkatesan Guruswami, James R Lee, and Alexander Razborov · 2010
Cited alongside, same era.
Deterministic construction of a high dimensional ℓ p \ell_{p} section in ℓ 1 n \ell_{1}^{n} for any p < 2 p<2
Zohar S Karnin · 2011
Cited alongside, same era.
Explicit construction of Ramanujan bigraphs
Cristina Ballantine, Brooke Feigon, Radhika Ganapathy, Janne Kool, Kathrin Maurischat, and Amy Wooding · 2015
Cited alongside, same era.
Symmetric unique neighbor expanders and good LDPC codes
Oren Becker · 2016
Cited alongside, same era.
Introduction to random graphs
Alan Frieze and Michał Karoński · 2016
Cited alongside, same era.
Explicit lower bounds against ω \omega (n)-rounds of sum-of-squares
Max Hopkins and Ting-Chun Lin · 2022
Later among the works it cites.
Combinatorics via closed orbits: number theoretic Ramanujan graphs are not unique neighbor expanders
Amitay Kamber and Tali Kaufman · 2022
Later among the works it cites.
Good quantum LDPC codes with linear time decoder from lossless expanders
Ting-Chun Lin and Min-Hsiu Hsieh · 2022
Later among the works it cites.
Quantum tanner codes
Anthony Leverrier and Gilles Zémor · 2022
Later among the works it cites.
Asymptotically good quantum and locally testable classical LDPC codes
Pavel Panteleev and Gleb Kalachev · 2022
Later among the works it cites.
NLTS Hamiltonians from good quantum codes
Anurag Anshu, Nikolas P Breuckmann, and Chinmay Nirkhe · 2023
Closest in time.
Bipartite unique-neighbour expanders via Ramanujan graphs
Ron Asherov and Irit Dinur · 2023
Closest in time.
HDX condensers
Itay Cohen, Roy Roth, and Amnon Ta-Shma · 2023
Closest in time.
New Explicit Constant-Degree Lossless Expanders
Louis Golowich · 2023
Closest in time.
A simple and sharper proof of the hypergraph Moore bound
Jun-Ting Hsieh, Pravesh K Kothari, and Sidhanth Mohanty · 2023
Closest in time.
Simple constructions of unique neighbor expanders from error-correcting codes
Swastik Kopparty, Noga Ron-Zewi, and Shubhangi Saraf · 2023
Closest in time.
Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes
Anthony Leverrier and Gilles Zémor · 2023
Closest in time.