activity
20122022
most citedInformation-theoretic thresholds for community detection in sparse networks

44 citations · 61 across the 7 of their papers we have counts for

collaborators

8 papers

math.SP2020

Point Spectrum of Periodic Operators on Universal Covering Trees

Jess Banks, Jorge Garza-Vargas, Satyaki Mukherjee

For any multi-graph with edge weights and vertex potential, and its universal covering tree , we completely characterize the point spectrum of operators $A_{\mathc…

cs.CC202013 cited

Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs

Afonso S. Bandeira, Jess Banks, Dmitriy Kunisky +2

We study the problem of efficiently refuting the k-colorability of a graph, or equivalently certifying a lower bound on its chromatic number. We give formal evidence of average-cas…

math.PR20202 cited

Overlaps, Eigenvalue Gaps, and Pseudospectrum under real Ginibre and Absolutely Continuous Perturbations

Jess Banks, Jorge Garza Vargas, Archit Kulkarni +1

Let be an matrix with real i.i.d. entries, let be a real matrix with , and let . We show that with p…

cs.DS2019

Local Statistics, Semidefinite Programming, and Community Detection

Jess Banks, Sidhanth Mohanty, Prasad Raghavendra

We propose a new hierarchy of semidefinite programming relaxations for inference problems. As test cases, we consider the problem of community detection in block models. The vertic…

cs.CC20191 cited

Vector Colorings of Random, Ramanujan, and Large-Girth Irregular Graphs

Jess Banks, Luca Trevisan

We prove that in sparse Erdős-Rényi graphs of average degree , the vector chromatic number (the relaxation of chromatic number coming from the Lovàsz theta function) is typicall…

math.FA2019

Gaussian Regularization of the Pseudospectrum and Davies' Conjecture

Jess Banks, Archit Kulkarni, Satyaki Mukherjee +1

A matrix is diagonalizable if it has a basis of linearly independent eigenvectors. Since the set of nondiagonalizable matrices has measure zero, every…