111 citations · 111 across the 2 of their papers we have counts for
5 papers · 1 filter
Explicit Abelian Lifts and Quantum LDPC Codes
Fernando Granha Jeronimo, Tushant Mittal, Ryan O'Donnell +2
For an abelian group acting on the set , an -lift of a graph is a graph obtained by replacing each vertex by copies, and each edge by a matching…
Spectrum preserving short cycle removal on regular graphs
Pedro Paredes
We describe a new method to remove short cycles on regular graphs while maintaining spectral bounds (the nontrivial eigenvalues of the adjacency matrix), as long as the graphs have…
A Survey on Subgraph Counting: Concepts, Algorithms and Applications to Network Motifs and Graphlets
Pedro Ribeiro, Pedro Paredes, Miguel E. P. Silva +2
Computing subgraph frequencies is a fundamental task that lies at the core of several network analysis methodologies, such as network motifs and graphlet-based metrics, which have…
Explicit near-Ramanujan graphs of every degree
Sidhanth Mohanty, Ryan O'Donnell, Pedro Paredes
For every constant and , we give a deterministic -time algorithm that outputs a -regular graph on vertices that is -near-Ramanujan;…
The SDP value for random two-eigenvalue CSPs
Sidhanth Mohanty, Ryan O'Donnell, Pedro Paredes
We precisely determine the SDP value (equivalently, quantum value) of large random instances of certain kinds of constraint satisfaction problems, ``two-eigenvalue 2CSPs''. We show…