Threshold for monotone symmetric properties through a logarithmic Sobolev inequality (Q858978): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2081116272 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0511607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities in Fourier analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: First passage percolation has sublinear distance variance. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Evolution of Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The scaling window of the 2-SAT transition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Étude des coefficients de Fourier des fonctions de \(L^ p(G)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration inequalities using the entropy method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Influences of variables and threshold intervals under group symmetries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Image denoising by statistical area thresholding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability threshold for random XOR-CNF formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial methods in density estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp thresholds of graph properties, and the $k$-sat problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every monotone graph property has a sharp threshold / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4693063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Talagrand's deviation inequalities for product measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083487 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4085018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate zero-one law / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4358811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3142398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isoperimetry, logarithmic Sobolev inequalities on the discrete cube, and Margulis' graph connectivity theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Russo's approximate zero-one law / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration of measure and isoperimetric inequalities in product spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new look at independence / rank
 
Normal rank

Latest revision as of 12:34, 25 June 2024

scientific article
Language Label Description Also known as
English
Threshold for monotone symmetric properties through a logarithmic Sobolev inequality
scientific article

    Statements

    Threshold for monotone symmetric properties through a logarithmic Sobolev inequality (English)
    0 references
    0 references
    12 January 2007
    0 references
    For \(p\in]0,1[\), let \(\mu_p\) denote the probability on \(\{0,1\}^n\) given by \(\mu_p(\{x\})=\prod_{i=1}^np^{x_i}(1-p)^{1-x_i},\) \(x=(x_1,\dots,x_n)\in\{0,1\}^n\). A nonempty set \(A\subset\{0,1\}^n\) is called monotone if \(x\in A\) whenever \(x'\in A\) and \(x\geq x'\). If \(A\neq\{0,1\}^n\) is monotone and \(\varepsilon\in\;]0,1/2[\), the quantity \(\tau(A,\varepsilon)=p(1-\varepsilon)-p(\varepsilon)\) is called the threshold width of \(A\) at level \(\varepsilon\), where \(p(\alpha)\) is the unique number in \(]0,1[\) such that \(\mu_{p(\alpha)}(A)=\alpha\). Here is the main result. Let \(A\neq\{0,1\}^n\) be monotone, and assume there exists a subgroup \(\pi\) of the group of all permutations of \(\{1,\dots,n\}\) such that for any \(i,j\in\{1,\dots,n\}\) there is \(\pi\in\Pi\) with \(\pi_i=j\), and that \(A=\pi(A)\) for all \(\pi\in\Pi\), where \(\pi(x_1,\dots,x_n)=(x_{\pi_1},\dots,x_{\pi_n})\), \(x\in\{0,1\}^n\). Then \((d/(dp))\mu_p (A)\geq s_n\mu_p(A)(1-\mu_p(A))/c(p)\), where \((s_n)_{n\geq2}\) is an intricate sequence of positive numbers with \(s_n\sim\log n\) as \(n\to\infty\), and \(c(p)\) is a concave function with \(c(0+)=0\), \(c(p)=c(1-p)\) and \(c(p)\leq c(1/2)=1/2\). From this it follows that \(\tau(A,\varepsilon)\leq(1/(s_n))\log((1-\varepsilon)/\varepsilon)\). Given the standard of ``The Annals of Probability'', the paper is somewhat negligently written.
    0 references
    0 references
    threshold
    0 references
    influence
    0 references
    logarithmic Sobolev inequality
    0 references
    0 references
    0 references