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,742 papers · 148 categories

Trend · papers per month

count % of corpus

6 results for “subhypergraph”

Information Limits for Detecting a Subhypergraphcs.IT

Study sets limits for detecting a subhypergraph in uniform hypergraphs.

problem Recovering a subhypergraph from a uniform hypergraph with different edge probabilities.

method Information-theoretic analysis for weak and exact recovery.

result Sharp conditions for weak or exact recovery of the subhypergraph.

subhypergraph uniform hypergraph information limits recovery probability distribution

2021-05-05abs ↗pdf ↗

Heterogeneous Dense Subhypergraph Detectionstat.ML

Detects dense subhypergraphs in heterogeneous random hypergraphs.

problem Testing for the existence of a dense subhypergraph in heterogeneous random hypergraphs.

method Established detection boundaries and constructed asymptotically powerful and adaptive tests.

result Developed tests for distinguishing between null and alternative hypotheses.

Heterogeneous hypergraphs Dense subhypergraphs Detection boundaries Asymptotically powerful test Adaptive test

2021-04-08abs ↗pdf ↗

Sharp detection boundaries on testing dense subhypergraphmath.ST

Sharp boundaries for detecting dense subhypergraphs established.

problem Detecting dense subhypergraphs in random hypergraphs.

method Established sharp detection boundaries for known and unknown edge probabilities.

result Sharp detectable regions differ significantly from graph counterparts.

hypergraph dense subhypergraph testing sharp detection powerful tests

2021-01-12abs ↗pdf ↗

Detection of Dense Subhypergraphs by Low-Degree Polynomialscs.DS

Detects dense subhypergraphs in random hypergraphs using low-degree polynomials.

problem Detecting a planted dense subhypergraph in a random hypergraph model.

method Degree-n^o(1) polynomials of adjacency tensor entries.

result Thresholds for detection in different density regimes.

hypergraphs dense subgraph random graph low-degree polynomials statistical detection

2023-04-17abs ↗pdf ↗

Expressive Higher-Order Link Prediction through Hypergraph Symmetry Breakingcs.LG

Improves hypergraph link prediction by breaking symmetry.

problem Limited expressivity of GWL-1 algorithm in hypergraph link prediction.

method Preprocessing algorithm to identify and replace symmetry-inducing subhypergraphs with covering hyperedges.

result Improves expressivity of GWL-1, leading to better link prediction.

hypergraph link prediction symmetry breaking higher-order graph

2024-02-17abs ↗pdf ↗

Exact Partitioning of High-order Planted Models with a Tensor Nuclear Norm Constraintcs.LG

Exact partitioning of high-order planted models achieved through convex optimization.

problem Efficiently partitioning hypergraphs generated by high-order planted models.

method Solving a computationally efficient convex optimization problem with a tensor nuclear norm constraint.

result Exact recovery of true underlying cluster structures with high probability.

hypergraphs planted models tensor nuclear norm convex optimization cluster structures

2020-06-20abs ↗pdf ↗