The following pages link to Guy Bresler (Q657692):
Displayed 28 items.
- Mixing time of exponential random graphs (Q657693) (← links)
- Learning a tree-structured Ising model in order to make predictions (Q2196190) (← links)
- Phase transitions for detecting latent geometry in random graphs (Q2210754) (← links)
- Stein's method for stationary distributions of Markov chains and application to Ising models (Q2286465) (← links)
- Efficiently Learning Ising Models on Arbitrary Graphs (Q2941573) (← links)
- Feasibility of Interference Alignment for the MIMO Interference Channel (Q2986169) (← links)
- Regret Bounds and Regimes of Optimality for User-User and Item-Item Collaborative Filtering (Q5001785) (← links)
- Information Storage in the Stochastic Ising Model (Q5003662) (← links)
- The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs (Q5157395) (← links)
- Learning restricted Boltzmann machines via influence maximization (Q5212822) (← links)
- The Approximate Capacity of the Many-to-One and One-to-Many Gaussian Interference Channels (Q5281309) (← links)
- Information Theory of DNA Shotgun Sequencing (Q5346287) (← links)
- Learning Graphical Models From the Glauber Dynamics (Q5375563) (← links)
- Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms (Q5891104) (← links)
- Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms (Q5900475) (← links)
- Metastable mixing of Markov chains: efficiently sampling low temperature exponential random graphs (Q6126113) (← links)
- Threshold for detecting high dimensional geometry in anisotropic random geometric graphs (Q6185052) (← links)
- Optimal Single Sample Tests for Structured versus Unstructured Network Data (Q6297889) (← links)
- Universality of Computational Lower Bounds for Submatrix Detection (Q6314261) (← links)
- Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness (Q6314324) (← links)
- The Average-Case Complexity of Counting Cliques in Erdos-Renyi Hypergraphs (Q6315907) (← links)
- Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries (Q6323781) (← links)
- Reducibility and Statistical-Computational Gaps from Secret Leakage (Q6340851) (← links)
- De Finetti-Style Results for Wishart Matrices: Combinatorial Structure and Phase Transitions (Q6363763) (← links)
- The Algorithmic Phase Transition of Random $k$-SAT for Low Degree Polynomials (Q6369399) (← links)
- Random Algebraic Graphs and Their Convergence to Erdos-Renyi (Q6435797) (← links)
- Algorithmic Decorrelation and Planted Clique in Dependent Random Graphs: The Case of Extra Triangles (Q6436917) (← links)
- Detection of $L_\infty$ Geometry in Random Geometric Graphs: Suboptimality of Triangles and Cluster Expansion (Q6456238) (← links)