Intersecting random half cubes

DOI10.1002/(SICI)1098-2418(199910/12)15:3/4%3C436::AID-RSA11%3E3.0.CO;2-5MaRDI QIDQ4704800zbMATH OpenOpenAlexFDO

Authors Michel Talagrand

Publication date 25 May 2000

Full work available at URL https://doi.org/10.1002/(sici)1098-2418(199910/12)15:3/4%3C436::aid-rsa11%3E3.0.co;2-5

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05)

Recommendations

• Intersecting random half spaces with a cube
• Volumes Spanned by Random Points in the Hypercube
• Random polytopes in the d-dimensional cube

Cites work

• Covering cubes by random half cubes, with applications to binary neural networks
• Regularity of infinitely divisible processes
• The space of interactions in neural network models

Cited in

(8)

• Intersecting random half spaces with a cube
• Sharp threshold for the Ising perceptron model
• Synthesizing cubes to satisfy a given intersection pattern
• The discrepancy of random rectangular matrices
• Critical window of the symmetric perceptron
• Frozen 1-RSB structure of the symmetric Ising perceptron
• Capacity lower bound for the Ising perceptron
• Average-case matrix discrepancy: satisfiability bounds

This page was built for publication: Intersecting random half cubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4704800)