Highlights from Current Programs part 2:
summary
Three short programs report concrete tools and open claims: a graph limit (graphon) model that generates sparse networks from two-feature link functions and produces a measurable limit; network epidemics show R0 depends on hubs and short cycles leading to a distinct R-naught for households vs individuals threshold and fragile predictions; Boolean-function analysis uses Fourier expansion to multilinear polynomials and Gaussian/invariance tools extended to high-dimensional expanders, aiming at unique-games, quantum LDPC and derandomization, and testing the Aaronson-Umbellino conjecture.
AI-written summary · about
chapters (9)
- 0:00Workshop programs intro
- 1:07Graph limits and networks
- 5:27Epidemics on networks
- 9:47R-naught in network models
- 13:19Boolean functions program
- 13:46Boolean functions analysis
- 18:08Boolean function research trends
- 21:02Open questions in Boolean functions
- 23:38Closing remarks
related talks
01h 17mLightning Talks
29mApplying Randomized Methods for Zonotope Enumeration and...
43mInformation-Theoretic Bounds and Phase Transitions in Community Detection and High-Dimensional Clust
55mDistribution-Free Models of Social and Information Networks
01h 06mComplex networks sparsification: methods and tools
15mOpening Remarks
44mScalable Algorithmic Primitives for Data Science
31mBayesian Data Analysis of Nonparametric Models in Clojure