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

44 citations · 165 across the 21 of their papers we have counts for

collaborators

24 papers

math.NA2022

Global Convergence of Hessenberg Shifted QR II: Numerical Stability

Jess Banks, Jorge Garza-Vargas, Nikhil Srivastava

We develop a framework for proving rapid convergence of shifted QR algorithms which use Ritz values as shifts, in finite arithmetic. Our key contribution is a dichotomy result whic…

math.NA2022★ 1 cited

Global Convergence of Hessenberg Shifted QR III: Approximate Ritz Values via Shifted Inverse Iteration

Jess Banks, Jorge Garza-Vargas, Nikhil Srivastava

We give a self-contained randomized algorithm based on shifted inverse iteration which provably computes the eigenvalues of an arbitrary matrix up to b…

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.CC2020★ 13 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.PR2020★ 2 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★ 2 cited

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.CC2019★ 1 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…

cs.CC2017

The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime

Jess Banks, Robert Kleinberg, Cristopher Moore

We derive upper and lower bounds on the degree for which the Lovász function, or equivalently sum-of-squares proofs with degree two, can refute the existence of a $…

stat.ML2016★ 21 cited

Phase transitions and optimal algorithms in high-dimensional Gaussian mixture clustering

Thibault Lesieur, Caterina De Bacco, Jess Banks +3

We consider the problem of Gaussian mixture clustering in the high-dimensional limit where the data consists of points in dimensions, and …

math.PR2016★ 44 cited

Information-theoretic thresholds for community detection in sparse networks

Jess Banks, Cristopher Moore, Joe Neeman +1

We give upper and lower bounds on the information-theoretic threshold for community detection in the stochastic block model. Specifically, consider the symmetric stochastic block m…

math.ST2016★ 11 cited

Information-theoretic bounds and phase transitions in clustering, sparse PCA, and submatrix localization

Jess Banks, Cristopher Moore, Nicolas Verzelen +2

We study the problem of detecting a structured, low-rank signal matrix corrupted with additive Gaussian noise. This includes clustering in a Gaussian mixture model, sparse PCA, and…

math.GT2016

The quasi-isomorphism class of the Kakimizu complex

Jessica E. Banks

It has been shown that the Kakimizu complex of a knot is quasi-isomorphic to for some . We give a lower bound on , matching the upper bound previously g…

math.PR2016★ 38 cited

Information-theoretic thresholds for community detection in sparse networks

Jess Banks, Cristopher Moore

We give upper and lower bounds on the information-theoretic threshold for community detection in the stochastic block model. Specifically, let be the number of groups, be t…

math.GT2014

Genus and fibredness of certain three-bridge links

Jessica E. Banks

For each three-bridge link of a certain form, we construct a taut Seifert surface for the link and establish whether the link is fibred. Using this, we also give the genus and fibr…

math.GT2014★ 3 cited

The Birman exact sequence for 3-manifolds

Jessica E. Banks

We study the Birman exact sequence for compact --manifolds, obtaining a complete picture of the relationship between the mapping class group of the manifold and the mapping clas…

math.GT2013★ 1 cited

Monodromy action on unknotting tunnels in fiber surfaces

Jessica E. Banks, Matt Rathbun

In "Tunnel one, fibered links", the second author showed that the tunnel of a tunnel number one, fibered link can be isotoped to lie as a properly embedded arc in the fiber surface…

math.GT2013★ 1 cited

Point-pushing in 3-manifolds

Jessica E. Banks

We study the Birman exact sequence for compact 3-manifolds.

math.GT2013★ 2 cited

Knots with many minimal genus Seifert surfaces

Jessica E. Banks

Roberts proved that a family of alternating, arborescent, prime knots each have at least distinct minimal genus Seifert surfaces, where is the genus of the knot in q…

math.GT2012

The Kakimizu complex of a split link

Jessica E. Banks

We study the Kakimizu complex of a split link. As part of this, we also study Seifert surfaces and the Kakimizu complex for a non-split link in a 3-ball. In addition, we show that…

math.GT2011★ 6 cited

The Kakimizu complex of a connected sum of links

Jessica E. Banks

We show that $|MS(L_1 # L_2)|=|MS(L_1)|\times|MS(L_2)|\times\mathbb{R}$ when and are any non-split and non-fibred links. Here denotes the Kakimizu complex of a…

math.GT2011★ 10 cited

Minimal genus Seifert surfaces for alternating links

Jessica E. Banks

We give a complete proof of results announced by Hirasawa and Sakuma describing explicitly the Kakimizu complex of a non-split, prime, special, alternating link.

math.GT2011★ 3 cited

Homogeneous links, Seifert surfaces, digraphs and the reduced Alexander polynomial

Jessica E. Banks

We give a geometric proof of the following result of Juhasz. \emph{Let be the leading coefficient of the Alexander polynomial of an alternating knot . If then $K…

math.GT2010★ 6 cited

On links with locally infinite {K}akimizu complexes

Jessica E. Banks

We show that the Kakimizu complex of a knot may be locally infinite, answering a question of Przytycki--Schultens. We then prove that if a link only has connected Seifert surfa…