The following pages link to (Q4083487):
Displayed 37 items.
- Upper bounds on Fourier entropy (Q344776) (← links)
- Geometric influences (Q428146) (← links)
- A structure theorem for Boolean functions with small total influences (Q447936) (← links)
- Thresholds and expectation-thresholds of monotone properties with small minterms (Q491531) (← links)
- Oded Schramm's contributions to noise sensitivity (Q651003) (← links)
- Isoperimetric and related bounds on configuration spaces (Q730727) (← links)
- Note on an extremal problem arising for unreliable networks in parallel computing (Q786823) (← links)
- Odd and even Hamming spheres also have minimum boundary (Q798656) (← links)
- Threshold for monotone symmetric properties through a logarithmic Sobolev inequality (Q858978) (← links)
- A short proof for a theorem of Harper about Hamming-spheres (Q1162510) (← links)
- Contributions to the geometry of Hamming spaces (Q1242920) (← links)
- Isoperimetry, logarithmic Sobolev inequalities on the discrete cube, and Margulis' graph connectivity theorem (Q1261160) (← links)
- On the convexified Sauer-Shelah theorem (Q1354724) (← links)
- Boolean functions: influence, threshold and noise (Q1620841) (← links)
- Around two theorems and a lemma by Lucio Russo (Q1648777) (← links)
- A 0-1 law for the massive Gaussian free field (Q1682494) (← links)
- On a biased edge isoperimetric inequality for the discrete cube (Q1713503) (← links)
- Sharp threshold phenomena in statistical physics (Q1731896) (← links)
- On the critical probability in percolation (Q1748902) (← links)
- Sharp threshold for the Ising perceptron model (Q2057207) (← links)
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture (Q2237385) (← links)
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \) (Q2475406) (← links)
- Critical site percolation in high dimension (Q2659291) (← links)
- Polynomial-time targeted attacks on coin tossing for any number of corruptions (Q2697882) (← links)
- An $o(n)$ Monotonicity Tester for Boolean Functions over the Hypercube (Q2805510) (← links)
- Russo's Formula, Uniqueness of the Infinite Cluster, and Continuous Differentiability of Free Energy for Continuum Percolation (Q3094679) (← links)
- On regular 3-wise intersecting families (Q3177823) (← links)
- Sharp thresholds of graph properties, and the $k$-sat problem (Q4257709) (← links)
- On Monotonicity Testing and Boolean Isoperimetric-type Theorems (Q4562273) (← links)
- Every monotone graph property has a sharp threshold (Q4717065) (← links)
- On the Probability that a Random Subgraph Contains a Circuit (Q4978293) (← links)
- An isoperimetric inequality for the Hamming cube and some consequences (Q5117318) (← links)
- Arbitrary Threshold Widths for Monotone, Symmetric Properties (Q5443708) (← links)
- Improved Cheeger's Inequality and Analysis of Local Graph Partitioning using Vertex Expansion and Expansion Profile (Q5737813) (← links)
- On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes (Q5936463) (← links)
- Variational Analysis of Poisson Processes (Q6089026) (← links)
- Smooth Gaussian fields and percolation (Q6183891) (← links)