Cover Image

Information-Theoretic Thresholds for Bipartite Latent-Space Graphs under Noisy Observations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Göbel, Andreas, Pappik, Marcus, Schiller, Leon
Format:	Preprint
Published:	2026
Subjects:	Probability Information Theory Statistics Theory 68Q87 G.3
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Testing Thresholds and Spectral Properties of High-Dimensional Random Toroidal Graphs via Edgeworth-Style Expansions
by: Baguley, Samuel, et al.
Published: (2025)

The Algorithmic Phase Transition in Correlated Spiked Models
by: Li, Zhangsong
Published: (2025)

Improved Computational Lower Bound of Estimation for Multi-Frequency Group Synchronization
by: Li, Zhangsong
Published: (2026)

Computational Lower Bounds for Correlated Random Graphs via Algorithmic Contiguity
by: Li, Zhangsong
Published: (2025)

A Proof of The Changepoint Detection Threshold Conjecture in Preferential Attachment Models
by: Du, Hang, et al.
Published: (2025)

Stochastic gradient descent in high dimensions for multi-spiked tensor PCA
by: Arous, Gérard Ben, et al.
Published: (2024)

Deterministic algorithms for inhomogeneous Bernoulli trials: Shapley value of network devices
by: Wei, Jesse D, et al.
Published: (2025)

Low-temperature Sampling on Sparse Random Graphs
by: Galanis, Andreas, et al.
Published: (2025)

Low-Degree Hardness of Detection for Correlated Erdős-Rényi Graphs
by: Ding, Jian, et al.
Published: (2023)

Planting and MCMC Sampling from the Potts model
by: Galanis, Andreas, et al.
Published: (2024)

Information-Theoretic Thresholds for Planted Dense Cycles
by: Mao, Cheng, et al.
Published: (2024)

Langevin dynamics for high-dimensional optimization: the case of multi-spiked tensor PCA
by: Arous, Gérard Ben, et al.
Published: (2024)

Robust Algorithms for Finding Cliques in Random Intersection Graphs via Sum-of-Squares
by: Göbel, Andreas, et al.
Published: (2025)

A Smooth Computational Transition in Tensor PCA
by: Li, Zhangsong
Published: (2025)

A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation
by: Ding, Jian, et al.
Published: (2023)

Robust random graph matching in Gaussian models via vector approximate message passing
by: Li, Zhangsong
Published: (2024)

A computational transition for detecting correlated stochastic block models by low-degree polynomials
by: Chen, Guanyi, et al.
Published: (2024)

Fundamental Limits of Community Detection in Contextual Multi-Layer Stochastic Block Models
by: Gong, Shuyang, et al.
Published: (2026)

Algebras of Information. An Axiomatic Foundation
by: Kohlas, Juerg
Published: (2017)

Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms
by: Bhamidi, Shankar, et al.
Published: (2025)

Minimum Hellinger Distance Estimators for Complex Survey Designs
by: Kepplinger, David, et al.
Published: (2025)

The Umeyama algorithm for matching correlated Gaussian geometric models in the low-dimensional regime
by: Gong, Shuyang, et al.
Published: (2024)

Counterexample to majority optimality in NICD with erasures
by: Ivanisvili, Paata, et al.
Published: (2025)

Transient Acceleration and Cross-Dissipation Interference in Fisher-Regularized Wasserstein Gradient Flows
by: Farmer, Michael, et al.
Published: (2026)

Private Evolution Converges
by: González, Tomás, et al.
Published: (2025)

Generalized Entropy Power Inequalities and Monotonicity Properties of Information
by: Madiman, Mokshay, et al.
Published: (2006)

Geometric Characteristics and Stable Guarantees for Phaseless Operators and Structured Matrix Restoration
by: Huang, Gao, et al.
Published: (2024)

Analysis of multivariate symbol statistics in primitive rational models
by: Goldwurm, Massimiliano, et al.
Published: (2026)

On Channel Simulation with Causal Rejection Samplers
by: Goc, Daniel, et al.
Published: (2024)

Exact Thresholds for Noisy Non-Adaptive Group Testing
by: Chen, Junren, et al.
Published: (2024)

Information-theoretic Limits of Learning and Estimation
by: Gamal, Abbas El, et al.
Published: (2026)

Leakage-Resilient Hardness Equivalence to Logspace Derandomization
by: Shalunov, Yakov
Published: (2023)

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

Foundations of algorithmic thermodynamics
by: Ebtekar, Aram, et al.
Published: (2023)

Kolmogorov complexity as a combinatorial tool
by: Shen, Alexander
Published: (2024)

Optimal rolling of fair dice using fair coins
by: Huber, Mark, et al.
Published: (2024)

Algorithmic Contiguity from Low-Degree Heuristic II: Predicting Detection-Recovery Gaps
by: Li, Zhangsong
Published: (2026)

Sharp threshold for network recovery from voter model dynamics
by: Du, Hang, et al.
Published: (2025)

Realizable Bayes-Consistency for General Metric Losses
by: Cohen, Dan Tsir, et al.
Published: (2026)

The Kikuchi Hierarchy and Tensor PCA
by: Wein, Alexander S., et al.
Published: (2019)