Copertina

Information-Theoretic Thresholds for Planted Dense Cycles

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Mao, Cheng, Wein, Alexander S., Zhang, Shenduo
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Statistics Theory Information Theory Social and Information Networks Machine Learning 94A15, 62B10, 68Q87, 05C80, 05C60
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

Abstract questionnaires and FS-decision digraphs
di: Chen, Jiaye, et al.
Pubblicazione: (2025)

Random $2$-SAT: The set of atoms of the limiting empirical marginal distribution
di: Müller, Noela, et al.
Pubblicazione: (2024)

On sequential structures in incompressible multidimensional networks
di: Abrahão, Felipe S., et al.
Pubblicazione: (2018)

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

The Optimality of a Nested Generalized Pairwise Group Testing Procedure
di: Malinovsky, Yaakov, et al.
Pubblicazione: (2025)

Higher-order Delsarte Dual LPs: Lifting, Constructions and Completeness
di: Coregliano, Leonardo Nagami, et al.
Pubblicazione: (2025)

Computational thresholds in high-dimensional statistics: the case of graph alignment
di: Massoulié, Laurent
Pubblicazione: (2025)

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

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

Noisy Linear Group Testing: Exact Thresholds and Efficient Algorithms
di: Hintze, Lukas, et al.
Pubblicazione: (2024)

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

Shared-Endpoint Correlations and Hierarchy in Random Flows on Graphs
di: Richland, Joshua, et al.
Pubblicazione: (2024)

Finite-sample confidence regions for spectral clustering and graph centrality
di: Gokavarapu, Chandrasekhar, et al.
Pubblicazione: (2026)

Bad local minima exist in the stochastic block model
di: Coja-Oghlan, Amin, et al.
Pubblicazione: (2024)

Anchored Likelihood-Ratio Geometry of Anonymous Shuffle Experiments: Exact Privacy Envelopes and Universal Low-Budget Design
di: Shvets, Alex
Pubblicazione: (2026)

Mixing and Merging Metric Spaces using Directed Graphs
di: Can, Mahir Bilen, et al.
Pubblicazione: (2025)

Tame sparse exponential random graphs
di: Chakraborty, Suman, et al.
Pubblicazione: (2024)

On the cumulative residual interval entropy of doubly truncated random variables
di: Chadjiconstantinidis, Stathis, et al.
Pubblicazione: (2026)

Stochastic comparisons, differential entropy and varentropy for distributions induced by probability density functions
di: Di Crescenzo, Antonio, et al.
Pubblicazione: (2021)

Computing the probability of intersection
di: Barvinok, Alexander
Pubblicazione: (2025)

Information-Theoretic Thresholds for Bipartite Latent-Space Graphs under Noisy Observations
di: Göbel, Andreas, et al.
Pubblicazione: (2026)

Construction of Minimal Binary Linear Codes of dimension $n+3$
di: Shaikh, Wajid M., et al.
Pubblicazione: (2024)

Pair-Matching: Links Prediction with Adaptive Queries
di: Giraud, Christophe, et al.
Pubblicazione: (2019)

Designing truncated priors for direct and inverse Bayesian problems
di: Agapiou, Sergios, et al.
Pubblicazione: (2021)

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

Optimal Hardness of Online Algorithms for Large Independent Sets
di: Gamarnik, David, et al.
Pubblicazione: (2025)

Asymptotic probability of irreducibles II: sequence
di: Monteil, Thierry, et al.
Pubblicazione: (2025)

The hard-core model in graph theory
di: Davies, Ewan, et al.
Pubblicazione: (2025)

Noisy group testing via spatial coupling
di: Coja-Oghlan, Amin, et al.
Pubblicazione: (2024)

Planted clique detection and recovery from the hypergraph adjacency matrix
di: Alaluusua, Kalle, et al.
Pubblicazione: (2026)

Universal Shuffle Asymptotics, Part II: Non-Gaussian Limits for Shuffle Privacy -- Poisson, Skellam, and Compound-Poisson Regimes
di: Shvets, Alex
Pubblicazione: (2026)

Complete corrected formula for generating functions of the hypergeometric distribution
di: Yamamoto, Ken
Pubblicazione: (2024)

Complex-Valued Probability Measures and Their Applications in Information Theory
di: Cheng, Siang, et al.
Pubblicazione: (2026)

A new lower bound for deterministic pop-stack-sorting
di: Bauer, Morgan, et al.
Pubblicazione: (2023)

Asymptotics for graphically divergent series: dense digraphs and 2-SAT formulae
di: Dovgal, Sergey, et al.
Pubblicazione: (2023)

Finding cliques and dense subgraphs using edge queries
di: Csóka, Endre, et al.
Pubblicazione: (2023)