scientific article; zbMATH DE number 3503316
From MaRDI portal
Publication:4083487
zbMath0322.05147MaRDI QIDQ4083487
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Reliability, availability, maintenance, inspection in operations research (90B25) Combinatorial probability (60C05) Graph theory (05C99)
Related Items
Boolean functions: influence, threshold and noise, Sharp thresholds of graph properties, and the $k$-sat problem, On regular 3-wise intersecting families, On the convexified Sauer-Shelah theorem, Around two theorems and a lemma by Lucio Russo, Threshold for monotone symmetric properties through a logarithmic Sobolev inequality, Upper bounds on Fourier entropy, On Monotonicity Testing and Boolean Isoperimetric-type Theorems, Critical site percolation in high dimension, A 0-1 law for the massive Gaussian free field, Variational Analysis of Poisson Processes, Smooth Gaussian fields and percolation, Geometric influences, An isoperimetric inequality for the Hamming cube and some consequences, Polynomial-time targeted attacks on coin tossing for any number of corruptions, A structure theorem for Boolean functions with small total influences, A short proof for a theorem of Harper about Hamming-spheres, On a biased edge isoperimetric inequality for the discrete cube, Oded Schramm's contributions to noise sensitivity, Improved Cheeger's Inequality and Analysis of Local Graph Partitioning using Vertex Expansion and Expansion Profile, Sharp threshold phenomena in statistical physics, Thresholds and expectation-thresholds of monotone properties with small minterms, The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture, On the critical probability in percolation, Vertex cover might be hard to approximate to within \(2 - \varepsilon \), On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes, Arbitrary Threshold Widths for Monotone, Symmetric Properties, Contributions to the geometry of Hamming spaces, Isoperimetric and related bounds on configuration spaces, An $o(n)$ Monotonicity Tester for Boolean Functions over the Hypercube, Isoperimetry, logarithmic Sobolev inequalities on the discrete cube, and Margulis' graph connectivity theorem, Sharp threshold for the Ising perceptron model, Every monotone graph property has a sharp threshold, On the Probability that a Random Subgraph Contains a Circuit, Russo's Formula, Uniqueness of the Infinite Cluster, and Continuous Differentiability of Free Energy for Continuum Percolation, Note on an extremal problem arising for unreliable networks in parallel computing, Odd and even Hamming spheres also have minimum boundary
