| Publication | Date of Publication | Type |
|---|
Efficient reductions between some statistical models
(available as arXiv preprint) | N/A | Paper |
On The Fourier Coefficients of High-Dimensional Random Geometric Graphs
(available as arXiv preprint) | N/A | Paper |
Computationally efficient reductions between some statistical models
IEEE Transactions on Information Theory | 2025-10-06 | Paper |
The average-case complexity of counting cliques in Erdős-Rényi hypergraphs
SIAM Journal on Computing | 2025-09-16 | Paper |
| Algorithmic decorrelation and planted clique in dependent random graphs: the case of extra triangles | 2025-08-15 | Paper |
| Chow-Liu++: optimal prediction-centric learning of tree Ising models | 2025-08-13 | Paper |
| The algorithmic phase transition of random k-SAT for low degree polynomials | 2025-08-13 | Paper |
| The average-case complexity of counting cliques in Erdős-Rényi hypergraphs | 2025-08-12 | Paper |
Random algebraic graphs and their convergence to Erdős-Rényi
Random Structures & Algorithms | 2025-02-14 | Paper |
Metastable mixing of Markov chains: efficiently sampling low temperature exponential random graphs
The Annals of Applied Probability | 2024-04-09 | Paper |
Metastable mixing of Markov chains: efficiently sampling low temperature exponential random graphs
The Annals of Applied Probability | 2024-04-09 | Paper |
Threshold for detecting high dimensional geometry in anisotropic random geometric graphs
Random Structures & Algorithms | 2024-01-05 | Paper |
| Detection of L_\infty Geometry in Random Geometric Graphs: Suboptimality of Triangles and Cluster Expansion | 2023-10-22 | Paper |
| Algorithmic Decorrelation and Planted Clique in Dependent Random Graphs: The Case of Extra Triangles | 2023-05-17 | Paper |
| Random Algebraic Graphs and Their Convergence to Erdos-Renyi | 2023-05-08 | Paper |
The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs
SIAM Journal on Computing | 2021-10-18 | Paper |
Regret Bounds and Regimes of Optimality for User-User and Item-Item Collaborative Filtering
IEEE Transactions on Information Theory | 2021-07-23 | Paper |
Information Storage in the Stochastic Ising Model
IEEE Transactions on Information Theory | 2021-07-22 | Paper |
| The Algorithmic Phase Transition of Random k-SAT for Low Degree Polynomials | 2021-06-03 | Paper |
| De Finetti-Style Results for Wishart Matrices: Combinatorial Structure and Phase Transitions | 2021-03-25 | Paper |
Phase transitions for detecting latent geometry in random graphs
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2020-11-08 | Paper |
Learning a tree-structured Ising model in order to make predictions
The Annals of Statistics | 2020-08-28 | Paper |
Learning a tree-structured Ising model in order to make predictions
The Annals of Statistics | 2020-08-28 | Paper |
| Reducibility and Statistical-Computational Gaps from Secret Leakage | 2020-05-16 | Paper |
Learning restricted Boltzmann machines via influence maximization
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Stein's method for stationary distributions of Markov chains and application to Ising models
The Annals of Applied Probability | 2020-01-22 | Paper |
| Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries | 2019-08-08 | Paper |
The Average-Case Complexity of Counting Cliques in Erdos-Renyi Hypergraphs
(available as arXiv preprint) | 2019-03-19 | Paper |
| Universality of Computational Lower Bounds for Submatrix Detection | 2019-02-19 | Paper |
| Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness | 2019-02-19 | Paper |
Learning Graphical Models From the Glauber Dynamics
IEEE Transactions on Information Theory | 2018-09-14 | Paper |
| Optimal Single Sample Tests for Structured versus Unstructured Network Data | 2018-02-16 | Paper |
The Approximate Capacity of the Many-to-One and One-to-Many Gaussian Interference Channels
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Information Theory of DNA Shotgun Sequencing
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Feasibility of Interference Alignment for the MIMO Interference Channel
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Efficiently learning Ising models on arbitrary graphs (extended abstract)
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Reconstruction of Markov random fields from samples: some observations and algorithms
SIAM Journal on Computing | 2013-07-24 | Paper |
Mixing time of exponential random graphs
The Annals of Applied Probability | 2012-01-10 | Paper |
Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms
Lecture Notes in Computer Science | 2008-11-27 | Paper |
