Cover Image

Equal Requests are Asymptotically Hardest for Data Recovery

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lember, Jüri, Riet, Ago-Erik
Format:	Preprint
Published:	2024
Subjects:	Information Theory Combinatorics Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

PIR Codes, Unequal-Data-Demand Codes, and the Griesmer Bound
by: Hollmann, Henk D. L., et al.
Published: (2024)

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

Sample Complexity of Low-rank Tensor Recovery from Uniformly Random Entries
by: Hamaguchi, Hiroki, et al.
Published: (2024)

Information Inequalities for Joint Distributions, with Interpretations and Applications
by: Madiman, Mokshay, et al.
Published: (2008)

Individual testing is optimal for nonadaptive group testing in the linear regime
by: Aldridge, Matthew
Published: (2018)

The Sharma-Mittal Entropy is Subadditive and Supermodular on the Majorization Lattice
by: Bruno, Roberto, et al.
Published: (2026)

Bernoulli sums and Rényi entropy inequalities
by: Madiman, Mokshay, et al.
Published: (2021)

Geometry of Rényi Entropy on the Majorization Lattice
by: Yadav, Anuj Kumar, et al.
Published: (2026)

Branch-and-bound method for calculating Viterbi path in triplet Markov models
by: Soop, Oskar, et al.
Published: (2025)

Quantifying Multivariate Graph Dependencies: Theory and Estimation for Multiplex Graphs
by: Skeja, Anda, et al.
Published: (2024)

Weak recovery, hypothesis testing, and mutual information in stochastic block models and planted factor graphs
by: Mossel, Elchanan, et al.
Published: (2024)

Resilience of Rademacher chaos of low degree
by: Aigner-Horev, Elad, et al.
Published: (2024)

Graphs of Joint Types, Noninteractive Simulation, and Stronger Hypercontractivity
by: Yu, Lei, et al.
Published: (2021)

Parsings of Stationary Processes, Stopping Times and the Fundamental Pointwise Convergence Theorems of Ergodic Theory
by: Tal, Matan
Published: (2025)

Smoothed Analysis of the Komlós Conjecture: Rademacher Noise
by: Aigner-Horev, Elad, et al.
Published: (2023)

Rényi--Sobolev Inequalities and Connections to Spectral Graph Theory
by: Yu, Lei, et al.
Published: (2023)

The maximal hard-core model as a recoverable system: Gibbs measures and phase coexistence
by: Wang, Geyang, et al.
Published: (2025)

Recoverable systems and the maximal hard-core model on the triangular lattice
by: Wang, Geyang, et al.
Published: (2026)

Randomstrasse101: Open Problems of 2024
by: Bandeira, Afonso S., et al.
Published: (2025)

The Fundamental Limits of Recovering Planted Subgraphs
by: Lee, Daniel, et al.
Published: (2025)

Randomstrasse101: Open Problems of 2025
by: Bandeira, Afonso S., et al.
Published: (2026)

Detecting Arbitrary Planted Subgraphs in Random Graphs
by: Elimelech, Dor, et al.
Published: (2025)

On Duplication-Free Codes for Disjoint or Equal-Length Errors
by: Yu, Wenjun, et al.
Published: (2024)

Spectral Estimators for Multi-Index Models: Precise Asymptotics and Optimal Weak Recovery
by: Kovačević, Filip, et al.
Published: (2025)

The Random Subsequence Model and Uniform Codes for the Deletion Channel
by: Jeong, Ryan, et al.
Published: (2026)

Asymptotics of Parking Search in Hyperfractal Networks
by: Deperle, Geoffrey, et al.
Published: (2026)

Recovery Algorithms for Linear Batch Codes
by: Düzgün, Baran, et al.
Published: (2026)

A Method for Generating Connected Erdos-Renyi Random Graphs
by: Chinyaev, Boris
Published: (2025)

Multiplexons: Limits of Multiplex Networks
by: Ganguly, Ankan, et al.
Published: (2025)

New constructions of unbalanced $\{C_4,θ_{3, t}\}$-free bipartite graphs
by: Düzgün, Baran, et al.
Published: (2025)

Asymptotic probability for connectedness
by: Monteil, Thierry, et al.
Published: (2024)

Near-Optimal List-Recovery of Linear Code Families
by: Li, Ray, et al.
Published: (2025)

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

Robust Sparse Recovery with Sparse Bernoulli matrices via Expanders
by: Abdalla, Pedro
Published: (2021)

Asymptotics of the partial $n$-fold dimer model
by: Meng, Christina
Published: (2024)

On the Asymptotics of the Connectivity Probability of Erdos-Renyi Graphs
by: Chinyaev, B., et al.
Published: (2025)

Asymptotic normality of pattern counts in conjugacy classes
by: Féray, Valentin, et al.
Published: (2023)

Balanced Bidirectional Breadth-First Search on Scale-Free Networks
by: Cerf, Sacha, et al.
Published: (2024)

Asymptotics of Symmetric Polynomials: A Dynamical Point of view
by: Guionnet, Alice, et al.
Published: (2024)

Asymptotic properties of some minor-closed classes of graphs
by: Bousquet-Mélou, Mireille, et al.
Published: (2013)