Premium
An extension of Janson's inequality
Author(s) -
Roos Małgorzata
Publication year - 1996
Publication title -
random structures and algorithms
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.314
H-Index - 69
eISSN - 1098-2418
pISSN - 1042-9832
DOI - 10.1002/(sici)1098-2418(199605)8:3<213::aid-rsa5>3.0.co;2-0
Subject(s) - extension (predicate logic) , generalization , inequality , graph , combinatorics , mathematics , random graph , random variable , upper and lower bounds , mathematical economics , discrete mathematics , computer science , statistics , mathematical analysis , programming language
An upper bound for P[ W = 0], where W is a sum of indicator variables with a special structure, which appears, for example, in subgraph counts in random graphs, is derived. Furthermore, its applications to a problem of k ‐runs and a random graph problem are given. The result is a generalization and an improvement of the well‐known Janson's inequality. © 1996 John Wiley & Sons, Inc.