Theorems like the Lovász Local Lemma?analog of principle of inclusion-exclusionprobabilities of increasing events under different product measures.Can you explain the description of the Lovasz Local Lemma by Moser+Tardos?To what extent can the following zero-one laws be relaxed?A question on independenceHelp with derivation of probability density of event generation & event detectionWhat is the early history of the concepts of probabilistic independence and conditional probability/expectation?Fixing (non)-independency of a the subfamilies of finitely many events.Negative association in a “k out of n” processWhat's the probability of two independent events in time domain?

Theorems like the Lovász Local Lemma?


analog of principle of inclusion-exclusionprobabilities of increasing events under different product measures.Can you explain the description of the Lovasz Local Lemma by Moser+Tardos?To what extent can the following zero-one laws be relaxed?A question on independenceHelp with derivation of probability density of event generation & event detectionWhat is the early history of the concepts of probabilistic independence and conditional probability/expectation?Fixing (non)-independency of a the subfamilies of finitely many events.Negative association in a “k out of n” processWhat's the probability of two independent events in time domain?













3












$begingroup$


The Lovász Local Lemma gives a probability bound in a context where there are many events that are "not quite" independent.



What other theorems exist in this genre? That is, what other theorems have a hypothesis of the form "Let events E_1, E_2, ... satisfy [relaxed form of independence]" and a conclusion of the form "Then the probability of [compound event] satisfies [inequality]"?



(I hope this question isn't too broad. I frequently encounter problems with events that are "almost independent", either in the sense that most subsets are independent or in the sense that the probabilities of compound events are well-approximated by assuming independence, and I am looking for general tools that may be helpful when these situations come up.)










share|cite|improve this question









$endgroup$







  • 1




    $begingroup$
    See pdfs.semanticscholar.org/6631/…
    $endgroup$
    – Sam Hopkins
    3 hours ago






  • 2




    $begingroup$
    Talagrand’s concentration inequality in particular is very powerful for this kind of thing.
    $endgroup$
    – Sam Hopkins
    3 hours ago















3












$begingroup$


The Lovász Local Lemma gives a probability bound in a context where there are many events that are "not quite" independent.



What other theorems exist in this genre? That is, what other theorems have a hypothesis of the form "Let events E_1, E_2, ... satisfy [relaxed form of independence]" and a conclusion of the form "Then the probability of [compound event] satisfies [inequality]"?



(I hope this question isn't too broad. I frequently encounter problems with events that are "almost independent", either in the sense that most subsets are independent or in the sense that the probabilities of compound events are well-approximated by assuming independence, and I am looking for general tools that may be helpful when these situations come up.)










share|cite|improve this question









$endgroup$







  • 1




    $begingroup$
    See pdfs.semanticscholar.org/6631/…
    $endgroup$
    – Sam Hopkins
    3 hours ago






  • 2




    $begingroup$
    Talagrand’s concentration inequality in particular is very powerful for this kind of thing.
    $endgroup$
    – Sam Hopkins
    3 hours ago













3












3








3


1



$begingroup$


The Lovász Local Lemma gives a probability bound in a context where there are many events that are "not quite" independent.



What other theorems exist in this genre? That is, what other theorems have a hypothesis of the form "Let events E_1, E_2, ... satisfy [relaxed form of independence]" and a conclusion of the form "Then the probability of [compound event] satisfies [inequality]"?



(I hope this question isn't too broad. I frequently encounter problems with events that are "almost independent", either in the sense that most subsets are independent or in the sense that the probabilities of compound events are well-approximated by assuming independence, and I am looking for general tools that may be helpful when these situations come up.)










share|cite|improve this question









$endgroup$




The Lovász Local Lemma gives a probability bound in a context where there are many events that are "not quite" independent.



What other theorems exist in this genre? That is, what other theorems have a hypothesis of the form "Let events E_1, E_2, ... satisfy [relaxed form of independence]" and a conclusion of the form "Then the probability of [compound event] satisfies [inequality]"?



(I hope this question isn't too broad. I frequently encounter problems with events that are "almost independent", either in the sense that most subsets are independent or in the sense that the probabilities of compound events are well-approximated by assuming independence, and I am looking for general tools that may be helpful when these situations come up.)







pr.probability probabilistic-method






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked 3 hours ago









AustinAustin

1763




1763







  • 1




    $begingroup$
    See pdfs.semanticscholar.org/6631/…
    $endgroup$
    – Sam Hopkins
    3 hours ago






  • 2




    $begingroup$
    Talagrand’s concentration inequality in particular is very powerful for this kind of thing.
    $endgroup$
    – Sam Hopkins
    3 hours ago












  • 1




    $begingroup$
    See pdfs.semanticscholar.org/6631/…
    $endgroup$
    – Sam Hopkins
    3 hours ago






  • 2




    $begingroup$
    Talagrand’s concentration inequality in particular is very powerful for this kind of thing.
    $endgroup$
    – Sam Hopkins
    3 hours ago







1




1




$begingroup$
See pdfs.semanticscholar.org/6631/…
$endgroup$
– Sam Hopkins
3 hours ago




$begingroup$
See pdfs.semanticscholar.org/6631/…
$endgroup$
– Sam Hopkins
3 hours ago




2




2




$begingroup$
Talagrand’s concentration inequality in particular is very powerful for this kind of thing.
$endgroup$
– Sam Hopkins
3 hours ago




$begingroup$
Talagrand’s concentration inequality in particular is very powerful for this kind of thing.
$endgroup$
– Sam Hopkins
3 hours ago










1 Answer
1






active

oldest

votes


















4












$begingroup$

A large number of results for sums $W$ of possibly dependent indicators of events (that is, for sums of possibly dependent Bernoulli random variables) $X_i$ have been obtained by the Chen--Stein method. See e.g. Theorem 1, which gives an upper bound on the total variation distance between the distribution of such a sum $W$ and a corresponding Poisson distribution in terms of certain characteristics $b_1,b_2,b_3$ of the strength of the dependence between the $X_i$'s (defined in formulas (4)--(6) of that paper).






share|cite|improve this answer









$endgroup$












    Your Answer





    StackExchange.ifUsing("editor", function ()
    return StackExchange.using("mathjaxEditing", function ()
    StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
    StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
    );
    );
    , "mathjax-editing");

    StackExchange.ready(function()
    var channelOptions =
    tags: "".split(" "),
    id: "504"
    ;
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function()
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled)
    StackExchange.using("snippets", function()
    createEditor();
    );

    else
    createEditor();

    );

    function createEditor()
    StackExchange.prepareEditor(
    heartbeatType: 'answer',
    autoActivateHeartbeat: false,
    convertImagesToLinks: true,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    imageUploader:
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    ,
    noCode: true, onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    );



    );













    draft saved

    draft discarded


















    StackExchange.ready(
    function ()
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f325465%2ftheorems-like-the-lov%25c3%25a1sz-local-lemma%23new-answer', 'question_page');

    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    4












    $begingroup$

    A large number of results for sums $W$ of possibly dependent indicators of events (that is, for sums of possibly dependent Bernoulli random variables) $X_i$ have been obtained by the Chen--Stein method. See e.g. Theorem 1, which gives an upper bound on the total variation distance between the distribution of such a sum $W$ and a corresponding Poisson distribution in terms of certain characteristics $b_1,b_2,b_3$ of the strength of the dependence between the $X_i$'s (defined in formulas (4)--(6) of that paper).






    share|cite|improve this answer









    $endgroup$

















      4












      $begingroup$

      A large number of results for sums $W$ of possibly dependent indicators of events (that is, for sums of possibly dependent Bernoulli random variables) $X_i$ have been obtained by the Chen--Stein method. See e.g. Theorem 1, which gives an upper bound on the total variation distance between the distribution of such a sum $W$ and a corresponding Poisson distribution in terms of certain characteristics $b_1,b_2,b_3$ of the strength of the dependence between the $X_i$'s (defined in formulas (4)--(6) of that paper).






      share|cite|improve this answer









      $endgroup$















        4












        4








        4





        $begingroup$

        A large number of results for sums $W$ of possibly dependent indicators of events (that is, for sums of possibly dependent Bernoulli random variables) $X_i$ have been obtained by the Chen--Stein method. See e.g. Theorem 1, which gives an upper bound on the total variation distance between the distribution of such a sum $W$ and a corresponding Poisson distribution in terms of certain characteristics $b_1,b_2,b_3$ of the strength of the dependence between the $X_i$'s (defined in formulas (4)--(6) of that paper).






        share|cite|improve this answer









        $endgroup$



        A large number of results for sums $W$ of possibly dependent indicators of events (that is, for sums of possibly dependent Bernoulli random variables) $X_i$ have been obtained by the Chen--Stein method. See e.g. Theorem 1, which gives an upper bound on the total variation distance between the distribution of such a sum $W$ and a corresponding Poisson distribution in terms of certain characteristics $b_1,b_2,b_3$ of the strength of the dependence between the $X_i$'s (defined in formulas (4)--(6) of that paper).







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered 2 hours ago









        Iosif PinelisIosif Pinelis

        19.8k22259




        19.8k22259



























            draft saved

            draft discarded
















































            Thanks for contributing an answer to MathOverflow!


            • Please be sure to answer the question. Provide details and share your research!

            But avoid


            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.

            Use MathJax to format equations. MathJax reference.


            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f325465%2ftheorems-like-the-lov%25c3%25a1sz-local-lemma%23new-answer', 'question_page');

            );

            Post as a guest















            Required, but never shown





















































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown

































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown







            Popular posts from this blog

            Are there any AGPL-style licences that require source code modifications to be public? Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?Force derivative works to be publicAre there any GPL like licenses for Apple App Store?Do you violate the GPL if you provide source code that cannot be compiled?GPL - is it distribution to use libraries in an appliance loaned to customers?Distributing App for free which uses GPL'ed codeModifications of server software under GPL, with web/CLI interfaceDoes using an AGPLv3-licensed library prevent me from dual-licensing my own source code?Can I publish only select code under GPLv3 from a private project?Is there published precedent regarding the scope of covered work that uses AGPL software?If MIT licensed code links to GPL licensed code what should be the license of the resulting binary program?If I use a public API endpoint that has its source code licensed under AGPL in my app, do I need to disclose my source?

            2013 GY136 Descoberta | Órbita | Referências Menu de navegação«List Of Centaurs and Scattered-Disk Objects»«List of Known Trans-Neptunian Objects»

            Button changing it's text & action. Good or terrible? The 2019 Stack Overflow Developer Survey Results Are Inchanging text on user mouseoverShould certain functions be “hard to find” for powerusers to discover?Custom liking function - do I need user login?Using different checkbox style for different checkbox behaviorBest Practices: Save and Exit in Software UIInteraction with remote validated formMore efficient UI to progress the user through a complicated process?Designing a popup notice for a gameShould bulk-editing functions be hidden until a table row is selected, or is there a better solution?Is it bad practice to disable (replace) the context menu?