SlideShare a Scribd company logo
1 of 8
Download to read offline
Ìàòåìàòè÷åñêèå îñíîâû Computer Science
×àñòü 2: Âåðîÿòíîñòíûé ìåòîä. Ëåêöèÿ 8.
        Ìåòîä âòîðîãî ìîìåíòà



            Äìèòðèé Èöûêñîí
                ÏÎÌÈ ÐÀÍ

              6 äåêàáðÿ 2009



                                          1/8
Ñîäåðæàíèå ëåêöèè




 1   Äèñïåðñèÿ
 2   Íåðàâåíñòâî ×åáûøåâà
 3   Ïîðîã äëÿ 4-êëèêè
 4   Ñåïàðàòîð
Ëèòåðàòóðà
 1   Í. Àëîí, Äæ. Ñïåíñåð. Âåðîÿòíîñòíûé ìåòîä.
 2   S. Jukna. Extremal combinatorics.


                                                   2/8
Äèñïåðñèÿ




Îïðåäåëåíèå. Äèñïåðñèåé ñëó÷àéíîé âåëè÷èíû ξ íàçûâàåòñÿ
âåëè÷èíà D ξ = E[(ξ − E ξ)2].
D ξ = E[ξ − E[ξ]]2 = E[ξ 2 − 2ξ E[ξ] + (E[ξ])2 ] = E[ξ 2 ] − (E[ξ])2 ≥ 0.
Ëåììà. (Íåðàâåíñòâî ×åáûøåâà).        D[ξ] = σ 2   , òîãäà
                                              1
                      Pr[|ξ − E[ξ]| ≥ kσ] ≤      .
                                              k2
Äîêàçàòåëüñòâî. η = (ξ − E[ξ])2, E[η] = σ2.
                                 (íåð-âî Ìàðêîâà) 1
                            2 2
Pr[|ξ − E ξ| ≥ kσ} = Pr{η ≥ k σ ]              ≤             k2
                                                                  .


                                                                            3/8
Äèñïåðñèÿ ñóììû




• Cov [ξ1 , ξ2 ] = E[ξ1 ξ2 ] − E[ξ1 ] E[ξ2 ]
• D[ n ξ1 ] = n D[ξi ] + 2 i<j Cov [ξi , ξj ]
       i=1            i=1
      • D[   ξi ] = E[( i ξi )2 ] − (E[ i ξi ])2
              i
      • E[(       2             2                        2
            i ξi ) ] = E[    i ξi +2  i<j ξi ξj ] = i E[ξi ]+2  i<j E[ξi ξj ]
      • (E[ i ξi ])2 = ( i E[ξi ])2 = i (E[ξi ])2 + 2 i<j E[ξi ] E[ξj ]
      • D[ i ξi ] = i E[ξi2 ] − i (E[ξi ])2 + 2 i<j E[ξi ξj ] −
        2 i<j E[ξi ] E[ξj ] = i D[ξi ] + 2 i<j Cov [ξi , ξj ]
•   Åñëè                   ïîïàðíî íåçàâèñèìû, òî
         ξ1 , ξ2 , . . . , ξn
    D[ξ1 + ξ2 + · · · + ξn ] = D[ξ1 ] + D[ξ2 ] + · · · + D[ξn ].


                                                                                4/8
Ïîðîã ñóùåñòâîâàíèÿ 4-êëèêè


• G (n, p)  ñëó÷àéíûé ãðàô íà n âåðøèíàõ, êàæäîå ðåáðî
    äîáàâëÿåòñÿ íåçàâèñèìî ñ âåðîÿòíîñòüþ p.
•   Çàäà÷à: ïðè êàêèõ p â ãðàôå G (n, p) ñ áîëüøîé
    âåðîÿòíîñòüþ åñòü êëèêà íà 4 âåðøèíàõ?
•   Òåîðåìà. Åñëè p = o(n−2/3), òî â ãðàôå G (n, p) åñòü
    4-êëèêà ñ âåðîÿòíîñòüþ o(1). Åñëè p = ω(n−2/3), òî â
    ãðàôå G (n, p) åñòü 4-êëèêà ñ âåðîÿòíîñòüþ 1 − o(1).
    Äîêàçàòåëüñòâî.
      • S ⊆ V , |S| = 4, AS : S   îáðàçóåò êëèêó.

                  1, åñëè S îáðàçóåò êëèêó G
      •   XS =
                  0, èíà÷å
      •   E[XS ] = Pr[XS = 1] = p 6
      •   X = XS
                                        4 6
      •   Pr[X ≥ 1] ≤ E[X ] = Cn p 6 ≤ n24 = o(1),
                                4        p
                                                     åñëè   p = o(n−2/3 )

                                                                            5/8
Ïîðîã ñóùåñòâîâàíèÿ 4-êëèêè


                     D[X ]
• Pr[X = 0] ≤        E[X ]2
• D[X ] =       S   D[XS ] +    S=T Cov (XS , XT )
• D[XS ] =       2
              E[XS ]  − E[XS ]  2 ≤ E[X 2 ] = E[X ]   = p6
                                       S         S
•     S   D[XS ] =   O(n4 p 6 )
•   Åñëè AS è AT íåçàâèñèìû, òî Cov (XS , XT ) = 0.
•   Åñëè AS è AT çàâèñèìû, åñëè |S ∩ T | = 2 èëè |S ∩ T | = 3.
•   Åñëè |S ∩ T | = 2, òàêèõ ïàð O(n6),
    Cov [XS , XT ] ≤ E[XS XT ] = p 11
•   Åñëè |S ∩ T | = 3, òàêèõ ïàð O(n5),
    Cov [XS , XT ] ≤ E[XS XT ] = p 9
• D[X ] = O(n4 p 6 + n6 p 11 + n5 p 9 ) = o(n8 p 12 ) = o((E[X ])2 )


                                                                       6/8
Ñåïàðàòîðû
Òåîðåìà. X = {1, 2, . . . , n}, F ⊆ . 1) ∀A ∈ F, |A| ≤ r ; 2)
                                2X
dx = |{A ∈ F | x ∈ A}|; 3) d =            ;
                                x∈X   x d

Òîãäà ñóùåñòâóåò ïàðà ìíîæåñòâ S, T ⊆ X , ÷òî S ∩ T = ∅ è
                                      n

äëÿ ëþáîãî A ∈ F âûïîëíÿåòñÿ ëèáî A ∩ S = ∅, ëèáî
A ∩ T = ∅, êðîìå òîãî |S|, |T | ≥ (1 − δ)2−d n, ãäå δ = dr 2 .
                                                          d+1


Äîêàçàòåëüñòâî.
                                                              n

  • Ïîêðàñèì âñå ìíîæåñòâà èç F ñëó÷àéíûì îáðàçîì â ñèíèé
    è êðàñíûå öâåòà.
  • S = {x ∈ X | ∀A ∈ F, x ∈ A =⇒ A ñèíåå}
  • T = {x ∈ X | ∀A ∈ F, x ∈ A =⇒ A êðàñíîå}
  • S ∩ T = ∅, ∀A ∈ F ëèáî A ∩ S = ∅, ëèáî A ∩ T = ∅.
  • Öåëü: ïîêàçàòü, ÷òî ñ ïîëîæèòåëüíîé âåðîÿòíîñòüþ
    |S|, |T | ≥ (1 − δ)2−d n.

  • Zx =
              1, x ∈ S
              0, èíà÷å
                       , E[Zx ] = Pr[Zx = 1] = 2−d
                                             x



  • Z = x Zx , Z = |S|
                                                                  7/8
Ñåïàðàòîðû


                   èíà÷å ,
                 1, x ∈ S
• Zx =                   E[Zx ] = Pr[Zx = 1] = 2−dx
             0,
•   Z = x Zx Z = |S|,
•   E[Z ] = x 2−dx ≥ n2− x dx /n = n2−d
•   D[Z ] = x D[Zx ] + x=y Cov [Zx , Zy ]
•   Åñëè íåò   A∈F, ÷òî        , òî
                              x, y ∈ A        è
                                          Zx Z y    íåçàâèñèìû,
    ïîýòîìó               .
              Cov (Zx , Zy ) = 0
•   Äëÿ   x ∈Xñóùåñòâóåò íå áîëåå        (r − 1)dx  ýëåìåíòîâ , ÷òî
                                                                  y
    x, yëåæàò â îäíîì       A∈F
•   Cov (Zx , Zy ) ≤ E[Zx Zy ] ≤ E[Zx ] ≤ 2−dx
                                              −dx ≤
•      y =x Cov (Zx , Zy ) ≤ (r − 1)   x dx 2
    r −1       −dx )(
      n ( x2            x dx ) = d(r − 1)E [Z ]
•   D[Z ] ≤ (d(r − 1) + 1) E[Z ] ≤ dr E[Z ]
•   Pr[Z  (1 − δ) E[Z ]]  δ2 (E[Z]])2 ≤ δ2 dr ] = dr 2d+1 E[Z ] =
                                  D[Z
                                              E[Z
                                                         drn

        n
    2d+1 E[Z ]
                 ≤       n
                     2d+1 2−d n
                                  =   1
                                      2   .
                                                                      8/8

More Related Content

What's hot

đạI số tổ hợp chương 5 ( p1)
đạI số tổ hợp chương 5 ( p1)đạI số tổ hợp chương 5 ( p1)
đạI số tổ hợp chương 5 ( p1)Thế Giới Tinh Hoa
 
20080309 cryptography hirsch_lecture04
20080309 cryptography hirsch_lecture0420080309 cryptography hirsch_lecture04
20080309 cryptography hirsch_lecture04Computer Science Club
 
Toan pt.de080.2010
Toan pt.de080.2010Toan pt.de080.2010
Toan pt.de080.2010BẢO Hí
 
Toan pt.de056.2011
Toan pt.de056.2011Toan pt.de056.2011
Toan pt.de056.2011BẢO Hí
 
رياضيات11ع جزء2
رياضيات11ع جزء2رياضيات11ع جزء2
رياضيات11ع جزء2fatima harazneh
 
bai-tap-lon-ly-thuyet-dieu-khien-tu-dong-pdf
bai-tap-lon-ly-thuyet-dieu-khien-tu-dong-pdfbai-tap-lon-ly-thuyet-dieu-khien-tu-dong-pdf
bai-tap-lon-ly-thuyet-dieu-khien-tu-dong-pdfTrần Thân
 
Bài giảng tích phân pham kimchung
Bài giảng tích phân pham kimchungBài giảng tích phân pham kimchung
Bài giảng tích phân pham kimchungThế Giới Tinh Hoa
 
Chuyen de phan nguyen phan le cua vu phong.doc
Chuyen de phan nguyen phan le cua vu phong.docChuyen de phan nguyen phan le cua vu phong.doc
Chuyen de phan nguyen phan le cua vu phong.doclethiminhhoa
 
Powerpoint dad5
Powerpoint dad5Powerpoint dad5
Powerpoint dad5daalt209
 
Bat dang thuc trong de thi dai hoc
Bat dang thuc trong de thi dai hocBat dang thuc trong de thi dai hoc
Bat dang thuc trong de thi dai hochienhang2509
 
Cân bằng hệ số trong bđt AM-GM
Cân bằng hệ số trong bđt AM-GMCân bằng hệ số trong bđt AM-GM
Cân bằng hệ số trong bđt AM-GMNguyễn Việt Long
 

What's hot (12)

đạI số tổ hợp chương 5 ( p1)
đạI số tổ hợp chương 5 ( p1)đạI số tổ hợp chương 5 ( p1)
đạI số tổ hợp chương 5 ( p1)
 
20080309 cryptography hirsch_lecture04
20080309 cryptography hirsch_lecture0420080309 cryptography hirsch_lecture04
20080309 cryptography hirsch_lecture04
 
Toan pt.de080.2010
Toan pt.de080.2010Toan pt.de080.2010
Toan pt.de080.2010
 
Toan pt.de056.2011
Toan pt.de056.2011Toan pt.de056.2011
Toan pt.de056.2011
 
رياضيات11ع جزء2
رياضيات11ع جزء2رياضيات11ع جزء2
رياضيات11ع جزء2
 
bai-tap-lon-ly-thuyet-dieu-khien-tu-dong-pdf
bai-tap-lon-ly-thuyet-dieu-khien-tu-dong-pdfbai-tap-lon-ly-thuyet-dieu-khien-tu-dong-pdf
bai-tap-lon-ly-thuyet-dieu-khien-tu-dong-pdf
 
Bài giảng tích phân pham kimchung
Bài giảng tích phân pham kimchungBài giảng tích phân pham kimchung
Bài giảng tích phân pham kimchung
 
Chuyen de phan nguyen phan le cua vu phong.doc
Chuyen de phan nguyen phan le cua vu phong.docChuyen de phan nguyen phan le cua vu phong.doc
Chuyen de phan nguyen phan le cua vu phong.doc
 
Powerpoint dad5
Powerpoint dad5Powerpoint dad5
Powerpoint dad5
 
Mat1 lec11
Mat1 lec11Mat1 lec11
Mat1 lec11
 
Bat dang thuc trong de thi dai hoc
Bat dang thuc trong de thi dai hocBat dang thuc trong de thi dai hoc
Bat dang thuc trong de thi dai hoc
 
Cân bằng hệ số trong bđt AM-GM
Cân bằng hệ số trong bđt AM-GMCân bằng hệ số trong bđt AM-GM
Cân bằng hệ số trong bđt AM-GM
 

More from Computer Science Club

20140531 serebryany lecture01_fantastic_cpp_bugs
20140531 serebryany lecture01_fantastic_cpp_bugs20140531 serebryany lecture01_fantastic_cpp_bugs
20140531 serebryany lecture01_fantastic_cpp_bugsComputer Science Club
 
20140531 serebryany lecture02_find_scary_cpp_bugs
20140531 serebryany lecture02_find_scary_cpp_bugs20140531 serebryany lecture02_find_scary_cpp_bugs
20140531 serebryany lecture02_find_scary_cpp_bugsComputer Science Club
 
20140531 serebryany lecture01_fantastic_cpp_bugs
20140531 serebryany lecture01_fantastic_cpp_bugs20140531 serebryany lecture01_fantastic_cpp_bugs
20140531 serebryany lecture01_fantastic_cpp_bugsComputer Science Club
 
20140511 parallel programming_kalishenko_lecture12
20140511 parallel programming_kalishenko_lecture1220140511 parallel programming_kalishenko_lecture12
20140511 parallel programming_kalishenko_lecture12Computer Science Club
 
20140427 parallel programming_zlobin_lecture11
20140427 parallel programming_zlobin_lecture1120140427 parallel programming_zlobin_lecture11
20140427 parallel programming_zlobin_lecture11Computer Science Club
 
20140420 parallel programming_kalishenko_lecture10
20140420 parallel programming_kalishenko_lecture1020140420 parallel programming_kalishenko_lecture10
20140420 parallel programming_kalishenko_lecture10Computer Science Club
 
20140413 parallel programming_kalishenko_lecture09
20140413 parallel programming_kalishenko_lecture0920140413 parallel programming_kalishenko_lecture09
20140413 parallel programming_kalishenko_lecture09Computer Science Club
 
20140329 graph drawing_dainiak_lecture02
20140329 graph drawing_dainiak_lecture0220140329 graph drawing_dainiak_lecture02
20140329 graph drawing_dainiak_lecture02Computer Science Club
 
20140329 graph drawing_dainiak_lecture01
20140329 graph drawing_dainiak_lecture0120140329 graph drawing_dainiak_lecture01
20140329 graph drawing_dainiak_lecture01Computer Science Club
 
20140310 parallel programming_kalishenko_lecture03-04
20140310 parallel programming_kalishenko_lecture03-0420140310 parallel programming_kalishenko_lecture03-04
20140310 parallel programming_kalishenko_lecture03-04Computer Science Club
 
20140216 parallel programming_kalishenko_lecture01
20140216 parallel programming_kalishenko_lecture0120140216 parallel programming_kalishenko_lecture01
20140216 parallel programming_kalishenko_lecture01Computer Science Club
 

More from Computer Science Club (20)

20141223 kuznetsov distributed
20141223 kuznetsov distributed20141223 kuznetsov distributed
20141223 kuznetsov distributed
 
Computer Vision
Computer VisionComputer Vision
Computer Vision
 
20140531 serebryany lecture01_fantastic_cpp_bugs
20140531 serebryany lecture01_fantastic_cpp_bugs20140531 serebryany lecture01_fantastic_cpp_bugs
20140531 serebryany lecture01_fantastic_cpp_bugs
 
20140531 serebryany lecture02_find_scary_cpp_bugs
20140531 serebryany lecture02_find_scary_cpp_bugs20140531 serebryany lecture02_find_scary_cpp_bugs
20140531 serebryany lecture02_find_scary_cpp_bugs
 
20140531 serebryany lecture01_fantastic_cpp_bugs
20140531 serebryany lecture01_fantastic_cpp_bugs20140531 serebryany lecture01_fantastic_cpp_bugs
20140531 serebryany lecture01_fantastic_cpp_bugs
 
20140511 parallel programming_kalishenko_lecture12
20140511 parallel programming_kalishenko_lecture1220140511 parallel programming_kalishenko_lecture12
20140511 parallel programming_kalishenko_lecture12
 
20140427 parallel programming_zlobin_lecture11
20140427 parallel programming_zlobin_lecture1120140427 parallel programming_zlobin_lecture11
20140427 parallel programming_zlobin_lecture11
 
20140420 parallel programming_kalishenko_lecture10
20140420 parallel programming_kalishenko_lecture1020140420 parallel programming_kalishenko_lecture10
20140420 parallel programming_kalishenko_lecture10
 
20140413 parallel programming_kalishenko_lecture09
20140413 parallel programming_kalishenko_lecture0920140413 parallel programming_kalishenko_lecture09
20140413 parallel programming_kalishenko_lecture09
 
20140329 graph drawing_dainiak_lecture02
20140329 graph drawing_dainiak_lecture0220140329 graph drawing_dainiak_lecture02
20140329 graph drawing_dainiak_lecture02
 
20140329 graph drawing_dainiak_lecture01
20140329 graph drawing_dainiak_lecture0120140329 graph drawing_dainiak_lecture01
20140329 graph drawing_dainiak_lecture01
 
20140310 parallel programming_kalishenko_lecture03-04
20140310 parallel programming_kalishenko_lecture03-0420140310 parallel programming_kalishenko_lecture03-04
20140310 parallel programming_kalishenko_lecture03-04
 
20140223-SuffixTrees-lecture01-03
20140223-SuffixTrees-lecture01-0320140223-SuffixTrees-lecture01-03
20140223-SuffixTrees-lecture01-03
 
20140216 parallel programming_kalishenko_lecture01
20140216 parallel programming_kalishenko_lecture0120140216 parallel programming_kalishenko_lecture01
20140216 parallel programming_kalishenko_lecture01
 
20131106 h10 lecture6_matiyasevich
20131106 h10 lecture6_matiyasevich20131106 h10 lecture6_matiyasevich
20131106 h10 lecture6_matiyasevich
 
20131027 h10 lecture5_matiyasevich
20131027 h10 lecture5_matiyasevich20131027 h10 lecture5_matiyasevich
20131027 h10 lecture5_matiyasevich
 
20131027 h10 lecture5_matiyasevich
20131027 h10 lecture5_matiyasevich20131027 h10 lecture5_matiyasevich
20131027 h10 lecture5_matiyasevich
 
20131013 h10 lecture4_matiyasevich
20131013 h10 lecture4_matiyasevich20131013 h10 lecture4_matiyasevich
20131013 h10 lecture4_matiyasevich
 
20131006 h10 lecture3_matiyasevich
20131006 h10 lecture3_matiyasevich20131006 h10 lecture3_matiyasevich
20131006 h10 lecture3_matiyasevich
 
20131006 h10 lecture3_matiyasevich
20131006 h10 lecture3_matiyasevich20131006 h10 lecture3_matiyasevich
20131006 h10 lecture3_matiyasevich
 

20091206 mfcs itsykson_lecture08

  • 1. Ìàòåìàòè÷åñêèå îñíîâû Computer Science ×àñòü 2: Âåðîÿòíîñòíûé ìåòîä. Ëåêöèÿ 8. Ìåòîä âòîðîãî ìîìåíòà Äìèòðèé Èöûêñîí ÏÎÌÈ ÐÀÍ 6 äåêàáðÿ 2009 1/8
  • 2. Ñîäåðæàíèå ëåêöèè 1 Äèñïåðñèÿ 2 Íåðàâåíñòâî ×åáûøåâà 3 Ïîðîã äëÿ 4-êëèêè 4 Ñåïàðàòîð Ëèòåðàòóðà 1 Í. Àëîí, Äæ. Ñïåíñåð. Âåðîÿòíîñòíûé ìåòîä. 2 S. Jukna. Extremal combinatorics. 2/8
  • 3. Äèñïåðñèÿ Îïðåäåëåíèå. Äèñïåðñèåé ñëó÷àéíîé âåëè÷èíû ξ íàçûâàåòñÿ âåëè÷èíà D ξ = E[(ξ − E ξ)2]. D ξ = E[ξ − E[ξ]]2 = E[ξ 2 − 2ξ E[ξ] + (E[ξ])2 ] = E[ξ 2 ] − (E[ξ])2 ≥ 0. Ëåììà. (Íåðàâåíñòâî ×åáûøåâà). D[ξ] = σ 2 , òîãäà 1 Pr[|ξ − E[ξ]| ≥ kσ] ≤ . k2 Äîêàçàòåëüñòâî. η = (ξ − E[ξ])2, E[η] = σ2. (íåð-âî Ìàðêîâà) 1 2 2 Pr[|ξ − E ξ| ≥ kσ} = Pr{η ≥ k σ ] ≤ k2 . 3/8
  • 4. Äèñïåðñèÿ ñóììû • Cov [ξ1 , ξ2 ] = E[ξ1 ξ2 ] − E[ξ1 ] E[ξ2 ] • D[ n ξ1 ] = n D[ξi ] + 2 i<j Cov [ξi , ξj ] i=1 i=1 • D[ ξi ] = E[( i ξi )2 ] − (E[ i ξi ])2 i • E[( 2 2 2 i ξi ) ] = E[ i ξi +2 i<j ξi ξj ] = i E[ξi ]+2 i<j E[ξi ξj ] • (E[ i ξi ])2 = ( i E[ξi ])2 = i (E[ξi ])2 + 2 i<j E[ξi ] E[ξj ] • D[ i ξi ] = i E[ξi2 ] − i (E[ξi ])2 + 2 i<j E[ξi ξj ] − 2 i<j E[ξi ] E[ξj ] = i D[ξi ] + 2 i<j Cov [ξi , ξj ] • Åñëè ïîïàðíî íåçàâèñèìû, òî ξ1 , ξ2 , . . . , ξn D[ξ1 + ξ2 + · · · + ξn ] = D[ξ1 ] + D[ξ2 ] + · · · + D[ξn ]. 4/8
  • 5. Ïîðîã ñóùåñòâîâàíèÿ 4-êëèêè • G (n, p) ñëó÷àéíûé ãðàô íà n âåðøèíàõ, êàæäîå ðåáðî äîáàâëÿåòñÿ íåçàâèñèìî ñ âåðîÿòíîñòüþ p. • Çàäà÷à: ïðè êàêèõ p â ãðàôå G (n, p) ñ áîëüøîé âåðîÿòíîñòüþ åñòü êëèêà íà 4 âåðøèíàõ? • Òåîðåìà. Åñëè p = o(n−2/3), òî â ãðàôå G (n, p) åñòü 4-êëèêà ñ âåðîÿòíîñòüþ o(1). Åñëè p = ω(n−2/3), òî â ãðàôå G (n, p) åñòü 4-êëèêà ñ âåðîÿòíîñòüþ 1 − o(1). Äîêàçàòåëüñòâî. • S ⊆ V , |S| = 4, AS : S îáðàçóåò êëèêó. 1, åñëè S îáðàçóåò êëèêó G • XS = 0, èíà÷å • E[XS ] = Pr[XS = 1] = p 6 • X = XS 4 6 • Pr[X ≥ 1] ≤ E[X ] = Cn p 6 ≤ n24 = o(1), 4 p åñëè p = o(n−2/3 ) 5/8
  • 6. Ïîðîã ñóùåñòâîâàíèÿ 4-êëèêè D[X ] • Pr[X = 0] ≤ E[X ]2 • D[X ] = S D[XS ] + S=T Cov (XS , XT ) • D[XS ] = 2 E[XS ] − E[XS ] 2 ≤ E[X 2 ] = E[X ] = p6 S S • S D[XS ] = O(n4 p 6 ) • Åñëè AS è AT íåçàâèñèìû, òî Cov (XS , XT ) = 0. • Åñëè AS è AT çàâèñèìû, åñëè |S ∩ T | = 2 èëè |S ∩ T | = 3. • Åñëè |S ∩ T | = 2, òàêèõ ïàð O(n6), Cov [XS , XT ] ≤ E[XS XT ] = p 11 • Åñëè |S ∩ T | = 3, òàêèõ ïàð O(n5), Cov [XS , XT ] ≤ E[XS XT ] = p 9 • D[X ] = O(n4 p 6 + n6 p 11 + n5 p 9 ) = o(n8 p 12 ) = o((E[X ])2 ) 6/8
  • 7. Ñåïàðàòîðû Òåîðåìà. X = {1, 2, . . . , n}, F ⊆ . 1) ∀A ∈ F, |A| ≤ r ; 2) 2X dx = |{A ∈ F | x ∈ A}|; 3) d = ; x∈X x d Òîãäà ñóùåñòâóåò ïàðà ìíîæåñòâ S, T ⊆ X , ÷òî S ∩ T = ∅ è n äëÿ ëþáîãî A ∈ F âûïîëíÿåòñÿ ëèáî A ∩ S = ∅, ëèáî A ∩ T = ∅, êðîìå òîãî |S|, |T | ≥ (1 − δ)2−d n, ãäå δ = dr 2 . d+1 Äîêàçàòåëüñòâî. n • Ïîêðàñèì âñå ìíîæåñòâà èç F ñëó÷àéíûì îáðàçîì â ñèíèé è êðàñíûå öâåòà. • S = {x ∈ X | ∀A ∈ F, x ∈ A =⇒ A ñèíåå} • T = {x ∈ X | ∀A ∈ F, x ∈ A =⇒ A êðàñíîå} • S ∩ T = ∅, ∀A ∈ F ëèáî A ∩ S = ∅, ëèáî A ∩ T = ∅. • Öåëü: ïîêàçàòü, ÷òî ñ ïîëîæèòåëüíîé âåðîÿòíîñòüþ |S|, |T | ≥ (1 − δ)2−d n. • Zx = 1, x ∈ S 0, èíà÷å , E[Zx ] = Pr[Zx = 1] = 2−d x • Z = x Zx , Z = |S| 7/8
  • 8. Ñåïàðàòîðû èíà÷å , 1, x ∈ S • Zx = E[Zx ] = Pr[Zx = 1] = 2−dx 0, • Z = x Zx Z = |S|, • E[Z ] = x 2−dx ≥ n2− x dx /n = n2−d • D[Z ] = x D[Zx ] + x=y Cov [Zx , Zy ] • Åñëè íåò A∈F, ÷òî , òî x, y ∈ A è Zx Z y íåçàâèñèìû, ïîýòîìó . Cov (Zx , Zy ) = 0 • Äëÿ x ∈Xñóùåñòâóåò íå áîëåå (r − 1)dx ýëåìåíòîâ , ÷òî y x, yëåæàò â îäíîì A∈F • Cov (Zx , Zy ) ≤ E[Zx Zy ] ≤ E[Zx ] ≤ 2−dx −dx ≤ • y =x Cov (Zx , Zy ) ≤ (r − 1) x dx 2 r −1 −dx )( n ( x2 x dx ) = d(r − 1)E [Z ] • D[Z ] ≤ (d(r − 1) + 1) E[Z ] ≤ dr E[Z ] • Pr[Z (1 − δ) E[Z ]] δ2 (E[Z]])2 ≤ δ2 dr ] = dr 2d+1 E[Z ] = D[Z E[Z drn n 2d+1 E[Z ] ≤ n 2d+1 2−d n = 1 2 . 8/8