1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.CO2023★ 1 cited
Pseudorandom Linear Codes are List Decodable to Capacity
Aaron L Putterman, Edward Pyne
We introduce a novel family of expander-based error correcting codes. These codes can be sampled with randomness linear in the block-length, and achieve list-decoding capacity (amo…
cs.DS2023
Singular Value Approximation and Sparsifying Random Walks on Directed Graphs
AmirMahdi Ahmadinejad, John Peebles, Edward Pyne +2
In this paper, we introduce a new, spectral notion of approximation between directed graphs, which we call singular value (SV) approximation. SV-approximation is stronger than prev…
cs.CC2021
Deterministic Approximation of Random Walks via Queries in Graphs of Unbounded Size
Edward Pyne, Salil Vadhan
Consider the following computational problem: given a regular digraph , two vertices , and a walk length , estimate the probability that a rand…