On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

count % of corpus

3 results for “chandeliers”

Random graph matching at Otter's threshold via counting chandelierscs.DS

Algorithm matches vertices of correlated Erdős-Rényi graphs efficiently.

problem Graph matching in correlated Erdős-Rényi graphs.

method Counting chandeliers to extract graph correlation.

result Correctly matches all but a vanishing fraction of vertices with high probability.

graph matching Erdős-Rényi graphs latent correspondence Otter's constant chandeliers

2022-09-25abs ↗pdf ↗

Efficient Graph Matching for Correlated Stochastic Block Modelscs.DS

Efficient algorithm for graph matching in correlated stochastic block models.

problem Graph matching in correlated stochastic block models with balanced communities.

method Extends previous work on centered subgraph counts to handle estimation errors and edge correlation.

result First efficient algorithm for graph matching in the logarithmic average degree regime, matching all but a vanishing fraction of vertices with high probability.

graph matching stochastic block models community detection correlated graphs estimation errors

2024-12-03abs ↗pdf ↗

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Testscs.DS

New algorithm achieves almost exact graph matching in almost quadratic time.

problem Graph matching under correlated Erdős-Rényi models.

method Rank-based graph matching using local tree correlation tests.

result Achieves almost exact recovery in almost quadratic time complexity.

graph matching ER graph model rank-based algorithm local tree correlation tests almost exact recovery

2026-07-10abs ↗pdf ↗