Sharp threshold for the Ising perceptron model

DOI10.1214/21-AOP1511zbMath1495.60094arXiv1905.05978MaRDI QIDQ2057207

Changji Xu

Publication date: 8 December 2021

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.05978

zbMATH Keywords

sharp thresholdIsing perceptron

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Neural nets applied to problems in time-dependent statistical mechanics (82C32)

Related Items (1)

Critical window of the symmetric perceptron

Cites Work

• Unnamed Item
• A structure theorem for Boolean functions with small total influences
• Correlation inequalities on some partially ordered sets
• Covering cubes by random half cubes, with applications to binary neural networks
• Boolean functions with low average sensitivity depend on few coordinates
• On Russo's approximate zero-one law
• The influence of variables in product spaces
• Rigorous solution of the Gardner problem
• Regularity of infinitely divisible processes
• On the critical percolation probabilities
• An approximate zero-one law
• Sharp thresholds of graph properties, and the $k$-sat problem
• High-Dimensional Probability
• Intersecting random half cubes
• Analysis of Boolean Functions
• Capacity lower bound for the Ising perceptron

This page was built for publication: Sharp threshold for the Ising perceptron model