Critical window of the symmetric perceptron
From MaRDI portal
Publication:6177525
DOI10.1214/23-ejp1024arXiv2205.02319OpenAlexW4387963337MaRDI QIDQ6177525
Publication date: 17 January 2024
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.02319
Cites Work
- Unnamed Item
- A structure theorem for Boolean functions with small total influences
- Some rigorous results on the Sherrington-Kirkpatrick spin glass model.
- Contiguity and non-reconstruction results for planted partition models: the dense case
- Intersecting random half-spaces: Toward the Gardner-Derrida formula.
- Sharp threshold for the Ising perceptron model
- Invertibility of adjacency matrices for random \(d\)-regular graphs
- Proof of the satisfiability conjecture for large \(k\)
- Maximum independent sets on random regular graphs
- The scaling window of the 2-SAT transition
- Proof of the Satisfiability Conjecture for Large k
- Non-asymptotic theory of random matrices: extreme singular values
- Proceedings of the 5th conference on Innovations in theoretical computer science
- Six Standard Deviations Suffice
- Sharp thresholds of graph properties, and the $k$-sat problem
- Almost all regular graphs are hamiltonian
- Intersecting random half cubes
- Storage capacity in symmetric binary perceptrons
- On the discrepancy of random matrices with many columns
- The distribution of sandpile groups of random regular graphs
- On the discrepancy of random low degree set systems
- Capacity lower bound for the Ising perceptron
- On the Beck‐Fiala conjecture for random set systems
- The Satisfiability Threshold fork-XORSAT
- Satisfiability threshold for random regular \textsc{nae-sat}
- The Phase Transition of Discrepancy in Random Hypergraphs
This page was built for publication: Critical window of the symmetric perceptron
