Cover Image

Planted clique detection and recovery from the hypergraph adjacency matrix

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Alaluusua, Kalle, Kumar, B. R. Vinay
Format:	Preprint
Published:	2026
Subjects:	Statistics Theory Computational Complexity Probability 05C80, 05C65, 05C69, 60B20, 62F03
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Consistent line clustering using geometric hypergraphs
by: Alaluusua, Kalle, et al.
Published: (2025)

Normal approximation for subgraph count in random hypergraphs
by: Michalczuk, Wojciech, et al.
Published: (2024)

First Betti number of the path homology of random directed graphs
by: Chaplin, Thomas
Published: (2021)

Two-Point Concentration of the Domination Number of Random Graphs
by: Bohman, Tom, et al.
Published: (2024)

On the thresholds of degenerate hypergraphs
by: Chen, Yu, et al.
Published: (2024)

Isomorphisms between random $d$-hypergraphs
by: Lenoir, Théo
Published: (2024)

Higher-Order Graphon Theory: Fluctuations, Degeneracies, and Inference
by: Chatterjee, Anirban, et al.
Published: (2024)

Asymptotics for cliques in scale-free random graphs
by: Daly, Fraser, et al.
Published: (2020)

Perfect Clustering in Nonuniform Hypergraphs
by: Chan, Ga-Ming Angus, et al.
Published: (2025)

Semicircle laws with combined variance for non-uniform Erdős-Rényi hypergraphs
by: Avena, Luca, et al.
Published: (2026)

Clique and cycle frequencies in a sparse random graph model with overlapping communities
by: Gröhn, Tommi, et al.
Published: (2019)

Star decompositions via orientations
by: Harangi, Viktor
Published: (2025)

Upper tails for homomorphism counts in sparse random hypergraphs
by: Cook, Nicholas A., et al.
Published: (2025)

Explosive appearance of cores and bootstrap percolation on lattices
by: Hartarsky, Ivailo, et al.
Published: (2025)

Accelerate Langevin Sampling with Birth-Death Process and Exploration Component
by: Tan, Lezhi, et al.
Published: (2023)

Dependencies in Multiplex Networks: A Motif Count Approach
by: Sawaya, Karl, et al.
Published: (2026)

Averages of hypergraphs and higher arity stability
by: Chernikov, Artem, et al.
Published: (2025)

Random cliques in random graphs revisited
by: Morris, Robert, et al.
Published: (2025)

Tame sparse exponential random graphs
by: Chakraborty, Suman, et al.
Published: (2024)

Star-collision in random hypergraphs
by: Adhikari, Kartick, et al.
Published: (2026)

Record-based transmuted unit omega distribution: different methods of estimation and applications
by: Pathak, Ashok Kumar, et al.
Published: (2024)

On tail inference in scale-free inhomogeneous random graphs
by: Cirkovic, Daniel, et al.
Published: (2024)

Monochromatic Subgraphs in Randomly Colored Dense Multiplex Networks
by: Andrade, Mauricio Daros, et al.
Published: (2025)

Maximising homomorphism counts between digraphs
by: Lüchtrath, Lukas, et al.
Published: (2026)

On the Size of the Largest Distinct Extreme Score Set in Random Round-Robin Tournaments
by: Malinovsky, Yaakov
Published: (2026)

Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs
by: Diaconis, Persi, et al.
Published: (2019)

Extreme Score Distributions in Countable-Outcome Round-Robin Tournaments of Equally Strong Players
by: Malinovsky, Yaakov
Published: (2026)

Central Limit Theorem for the $σ$-antithetic multilevel Monte Carlo method
by: Alaya, Mohamed Ben, et al.
Published: (2020)

Self-Reinforced Preferential Attachment
by: Dahiya, Yogesh, et al.
Published: (2025)

The scaling limit of planar maps with large faces
by: Curien, Nicolas, et al.
Published: (2025)

Normal approximation for exponential random graphs
by: Fang, Xiao, et al.
Published: (2024)

Conditional central limit theorems for exponential random graphs
by: Fang, Xiao, et al.
Published: (2025)

A standard CLT for triangles in a class of ERGs
by: Magnanini, Elena, et al.
Published: (2025)

On theoretical guarantees and a blessing of dimensionality for nonconvex sampling
by: Chak, Martin
Published: (2024)

Optimal root recovery for uniform attachment trees and $d$-regular growing trees
by: Addario-Berry, Louigi, et al.
Published: (2024)

Solution to a problem on isolation of cliques in uniform hypergraphs
by: Borg, Peter
Published: (2025)

Lecture Notes on Edge Universality for Random Regular Graphs
by: Huang, Jiaoyang, et al.
Published: (2026)

Random Connection Hypergraphs
by: Brun, Morten, et al.
Published: (2024)

Turán density of cliques of order five in $3$-uniform hypergraphs with quasirandom links
by: Berger, Sören, et al.
Published: (2022)

Upper tails of subgraph counts in directed random graphs
by: Park, Jiyun
Published: (2024)