Pedro Paredes

activity

20192023

most citedA Survey on Subgraph Counting: Concepts, Algorithms and Applications to Network Motifs and Graphlets

111 citations · 111 across the 2 of their papers we have counts for

collaborators

6 papers

cs.CC2023

Explicit orthogonal and unitary designs

Ryan O'Donnell, Rocco A. Servedio, Pedro Paredes

We give a strongly explicit construction of $ε$ -approximate $k$ -designs for the orthogonal group $O (N)$ and the unitary group $U (N)$ , for $N = 2^{n}$ . Our d…

cs.DS2021

Explicit Abelian Lifts and Quantum LDPC Codes

Fernando Granha Jeronimo, Tushant Mittal, Ryan O'Donnell +2

For an abelian group $H$ acting on the set $[ℓ]$ , an $(H, ℓ)$ -lift of a graph $G_{0}$ is a graph obtained by replacing each vertex by $ℓ$ copies, and each edge by a matching…

cs.DS2020

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…

cs.DS2019★ 111 cited

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…

cs.DS2019

Explicit near-Ramanujan graphs of every degree

Sidhanth Mohanty, Ryan O'Donnell, Pedro Paredes

For every constant $d \geq 3$ and $ε > 0$ , we give a deterministic $poly (n)$ -time algorithm that outputs a $d$ -regular graph on $Θ (n)$ vertices that is $ε$ -near-Ramanujan;…

cs.DS2019

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…