Cover Image

Achievability of Heterogeneous Hypergraph Recovery from its Graph Projection

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Morgan, Alexander, Guo, Chenghao
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms Information Theory Probability Statistics Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An Instance-Based Approach to the Trace Reconstruction Problem
by: Mazooji, Kayvon, et al.
Published: (2024)

Partial and Exact Recovery of a Random Hypergraph from its Graph Projection
by: Bresler, Guy, et al.
Published: (2025)

Random Multi-Type Spanning Forests for Synchronization on Sparse Graphs
by: Jaquard, Hugo, et al.
Published: (2024)

Probability Tools for Sequential Random Projection
by: Li, Yingru
Published: (2024)

On Unbiased Low-Rank Approximation with Minimum Distortion
by: Barnes, Leighton Pate, et al.
Published: (2025)

Asymptotically Optimal Sequential Testing with Heterogeneous LLMs
by: Li, Guokai, et al.
Published: (2026)

Succinct Preferential Attachment Graphs
by: Alaoui, Ziad Ismaili, et al.
Published: (2025)

Bayesian inference of planted matchings: Local posterior approximation and infinite-volume limit
by: Fan, Zhou, et al.
Published: (2026)

Universal entrywise eigenvector fluctuations in delocalized spiked matrix models and asymptotics of rounded spectral algorithms
by: Chen, Shujing, et al.
Published: (2025)

On the Low-Temperature MCMC threshold: the cases of sparse tensor PCA, sparse regression, and a geometric rule
by: Chen, Zongchen, et al.
Published: (2024)

Finding planted cliques using gradient descent
by: Gheissari, Reza, et al.
Published: (2023)

On The MCMC Performance In Bernoulli Group Testing And The Random Max Set-Cover Problem
by: Lovig, Maxwell, et al.
Published: (2024)

Random Matrices, Intrinsic Freeness, and Sharp Non-Asymptotic Inequalities
by: Bandeira, Afonso S.
Published: (2025)

Detecting Correlation Efficiently in Stochastic Block Models: Breaking Otter's Threshold in the Entire Supercritical Regime
by: Chen, Guanyi, et al.
Published: (2025)

Efficient Graph Matching for Correlated Stochastic Block Models
by: Chai, Shuwen, et al.
Published: (2024)

Thresholds for Reconstruction of Random Hypergraphs From Graph Projections
by: Bresler, Guy, et al.
Published: (2025)

Modularity and partially observed graphs
by: McDiarmid, Colin, et al.
Published: (2021)

Sharp Phase Transitions in Estimation with Low-Degree Polynomials
by: Sohn, Youngtak, et al.
Published: (2025)

High-accuracy log-concave sampling with stochastic queries
by: Chen, Fan, et al.
Published: (2026)

Entropic independence via sparse localization
by: Jain, Vishesh, et al.
Published: (2026)

Composition of random functions and word reconstruction
by: Chapuy, Guillaume, et al.
Published: (2026)

Beyond Catoni: Sharper Rates for Heavy-Tailed and Robust Mean Estimation
by: Gupta, Shivam, et al.
Published: (2023)

Spectral clustering in the Gaussian mixture block model
by: Li, Shuangping, et al.
Published: (2023)

Planted Bipartite Graph Detection
by: Rotenberg, Asaf, et al.
Published: (2023)

Functional Stochastic Localization
by: Gu, Anming, et al.
Published: (2026)

Low-degree estimation thresholds in planted hypergraphs and tensor PCA
by: Fu, Daniel, et al.
Published: (2026)

Universality of first-order methods on random and deterministic matrices
by: Gorini, Nicola, et al.
Published: (2026)

A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation
by: Ding, Jian, et al.
Published: (2022)

Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling
by: Blanca, Antonio, et al.
Published: (2022)

Adversarially-Robust Inference on Trees via Belief Propagation
by: Hopkins, Samuel B., et al.
Published: (2024)

Learning bounded-degree polytrees with known skeleton
by: Choo, Davin, et al.
Published: (2023)

Nonlinear Laplacians: Tunable principal component analysis under directional prior information
by: Ma, Yuxin, et al.
Published: (2025)

Perspectives on Stochastic Localization
by: Shi, Bobby, et al.
Published: (2025)

Computational and statistical lower bounds for low-rank estimation under general inhomogeneous noise
by: De, Debsurya, et al.
Published: (2025)

Learning Mixtures of Gaussians Using Diffusion Models
by: Gatmiry, Khashayar, et al.
Published: (2024)

Low coordinate degree algorithms I: Universality of computational thresholds for hypothesis testing
by: Kunisky, Dmitriy
Published: (2024)

Online Differentially Private Synthetic Data Generation
by: He, Yiyun, et al.
Published: (2024)

Correlation detection in trees for planted graph alignment
by: Ganassali, Luca, et al.
Published: (2021)

Efficiently matching random inhomogeneous graphs via degree profiles
by: Ding, Jian, et al.
Published: (2023)

Large Average Subtensor Problem: Ground-State, Algorithms, and Algorithmic Barriers
by: R., Abhishek Hegade K., et al.
Published: (2025)