Image de couverture de livre

Planted clique detection and recovery from the hypergraph adjacency matrix

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Alaluusua, Kalle, Kumar, B. R. Vinay
Format:	Preprint
Publié:	2026
Sujets:	Statistics Theory Computational Complexity Probability 05C80, 05C65, 05C69, 60B20, 62F03
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Consistent line clustering using geometric hypergraphs
par: Alaluusua, Kalle, et autres
Publié: (2025)

Normal approximation for subgraph count in random hypergraphs
par: Michalczuk, Wojciech, et autres
Publié: (2024)

First Betti number of the path homology of random directed graphs
par: Chaplin, Thomas
Publié: (2021)

Two-Point Concentration of the Domination Number of Random Graphs
par: Bohman, Tom, et autres
Publié: (2024)

On the thresholds of degenerate hypergraphs
par: Chen, Yu, et autres
Publié: (2024)

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

Higher-Order Graphon Theory: Fluctuations, Degeneracies, and Inference
par: Chatterjee, Anirban, et autres
Publié: (2024)

Asymptotics for cliques in scale-free random graphs
par: Daly, Fraser, et autres
Publié: (2020)

Perfect Clustering in Nonuniform Hypergraphs
par: Chan, Ga-Ming Angus, et autres
Publié: (2025)

Semicircle laws with combined variance for non-uniform Erdős-Rényi hypergraphs
par: Avena, Luca, et autres
Publié: (2026)

Star decompositions via orientations
par: Harangi, Viktor
Publié: (2025)

Clique and cycle frequencies in a sparse random graph model with overlapping communities
par: Gröhn, Tommi, et autres
Publié: (2019)

Upper tails for homomorphism counts in sparse random hypergraphs
par: Cook, Nicholas A., et autres
Publié: (2025)

Explosive appearance of cores and bootstrap percolation on lattices
par: Hartarsky, Ivailo, et autres
Publié: (2025)

Accelerate Langevin Sampling with Birth-Death Process and Exploration Component
par: Tan, Lezhi, et autres
Publié: (2023)

Dependencies in Multiplex Networks: A Motif Count Approach
par: Sawaya, Karl, et autres
Publié: (2026)

Averages of hypergraphs and higher arity stability
par: Chernikov, Artem, et autres
Publié: (2025)

Random cliques in random graphs revisited
par: Morris, Robert, et autres
Publié: (2025)

Tame sparse exponential random graphs
par: Chakraborty, Suman, et autres
Publié: (2024)

Star-collision in random hypergraphs
par: Adhikari, Kartick, et autres
Publié: (2026)

Record-based transmuted unit omega distribution: different methods of estimation and applications
par: Pathak, Ashok Kumar, et autres
Publié: (2024)

On tail inference in scale-free inhomogeneous random graphs
par: Cirkovic, Daniel, et autres
Publié: (2024)

Monochromatic Subgraphs in Randomly Colored Dense Multiplex Networks
par: Andrade, Mauricio Daros, et autres
Publié: (2025)

Maximising homomorphism counts between digraphs
par: Lüchtrath, Lukas, et autres
Publié: (2026)

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

Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs
par: Diaconis, Persi, et autres
Publié: (2019)

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

Central Limit Theorem for the $σ$-antithetic multilevel Monte Carlo method
par: Alaya, Mohamed Ben, et autres
Publié: (2020)

Self-Reinforced Preferential Attachment
par: Dahiya, Yogesh, et autres
Publié: (2025)

The scaling limit of planar maps with large faces
par: Curien, Nicolas, et autres
Publié: (2025)

Normal approximation for exponential random graphs
par: Fang, Xiao, et autres
Publié: (2024)

Conditional central limit theorems for exponential random graphs
par: Fang, Xiao, et autres
Publié: (2025)

A standard CLT for triangles in a class of ERGs
par: Magnanini, Elena, et autres
Publié: (2025)

On theoretical guarantees and a blessing of dimensionality for nonconvex sampling
par: Chak, Martin
Publié: (2024)

Optimal root recovery for uniform attachment trees and $d$-regular growing trees
par: Addario-Berry, Louigi, et autres
Publié: (2024)

Solution to a problem on isolation of cliques in uniform hypergraphs
par: Borg, Peter
Publié: (2025)

Lecture Notes on Edge Universality for Random Regular Graphs
par: Huang, Jiaoyang, et autres
Publié: (2026)

Random Connection Hypergraphs
par: Brun, Morten, et autres
Publié: (2024)

Turán density of cliques of order five in $3$-uniform hypergraphs with quasirandom links
par: Berger, Sören, et autres
Publié: (2022)

Upper tails of subgraph counts in directed random graphs
par: Park, Jiyun
Publié: (2024)