서브메뉴
검색
Inequalities for Connectivity Events in Bernoulli Percolation
Inequalities for Connectivity Events in Bernoulli Percolation
상세정보
- 자료유형
- 학위논문 서양
- 최종처리일시
- 20260202103624
- ISBN
- 9798315796879
- DDC
- 510
- 저자명
- Gladkov, Nikita.
- 서명/저자
- Inequalities for Connectivity Events in Bernoulli Percolation
- 발행사항
- [Sl] : University of California, Los Angeles, 2025
- 발행사항
- Ann Arbor : ProQuest Dissertations & Theses, 2025
- 형태사항
- 135 p
- 주기사항
- Source: Dissertations Abstracts International, Volume: 86-12, Section: B.
- 주기사항
- Advisor: Pak, Igor.
- 학위논문주기
- Thesis (Ph.D.)--University of California, Los Angeles, 2025.
- 초록/해제
- 요약This thesis consists of six chapters based on papers on probabilities of connectivity events in percolation theory.• Chapter 1 is based on paper written with Igor Pak. There we study colored percolation, a generalization of the classical percolation model.• Chapter 2 is based on paper written with Aleksandr Zimin. There we show that bond percolation does not simulate site percolation.• Chapter 3 is based on paper. There we study percolation inequalities and decision trees.• Chapter 4 is based on paper with Igor Pak and Aleksandr Zimin. There we disprove the bunkbed conjecture. The appendix proves the bunkbed conjecture for the case of 2 transversal vertices and wasn't published before.• Chapter 5 is based on an unpublished manuscript written with Aleksandr Zimin. There we prove multiple inequalities of the form similar to the Harris-Kleitman inequality. This work generalizes and supersedes a previous paper by the author.• Chapter 6 contains an unpublished result related to the main body of work in the thesis.
- 일반주제명
- Mathematics
- 일반주제명
- Statistical physics
- 일반주제명
- Computational physics
- 키워드
- Combinatorics
- 키워드
- Probability
- 기타저자
- University of California, Los Angeles Mathematics 0540
- 기본자료저록
- Dissertations Abstracts International. 86-12B.
- 전자적 위치 및 접속
- 로그인 후 원문을 볼 수 있습니다.
MARC
008260126s2025 us c eng d■001000017357967
■00520260202103624
■006m o d
■007cr#unu||||||||
■020 ▼a9798315796879
■035 ▼a(MiAaPQ)AAI32046117
■040 ▼aMiAaPQ▼cMiAaPQ
■0820 ▼a510
■1001 ▼aGladkov, Nikita.
■24510▼aInequalities for Connectivity Events in Bernoulli Percolation
■260 ▼a[Sl]▼bUniversity of California, Los Angeles▼c2025
■260 1▼aAnn Arbor▼bProQuest Dissertations & Theses▼c2025
■300 ▼a135 p
■500 ▼aSource: Dissertations Abstracts International, Volume: 86-12, Section: B.
■500 ▼aAdvisor: Pak, Igor.
■5021 ▼aThesis (Ph.D.)--University of California, Los Angeles, 2025.
■520 ▼aThis thesis consists of six chapters based on papers on probabilities of connectivity events in percolation theory.• Chapter 1 is based on paper written with Igor Pak. There we study colored percolation, a generalization of the classical percolation model.• Chapter 2 is based on paper written with Aleksandr Zimin. There we show that bond percolation does not simulate site percolation.• Chapter 3 is based on paper. There we study percolation inequalities and decision trees.• Chapter 4 is based on paper with Igor Pak and Aleksandr Zimin. There we disprove the bunkbed conjecture. The appendix proves the bunkbed conjecture for the case of 2 transversal vertices and wasn't published before.• Chapter 5 is based on an unpublished manuscript written with Aleksandr Zimin. There we prove multiple inequalities of the form similar to the Harris-Kleitman inequality. This work generalizes and supersedes a previous paper by the author.• Chapter 6 contains an unpublished result related to the main body of work in the thesis.
■590 ▼aSchool code: 0031.
■650 4▼aMathematics
■650 4▼aStatistical physics
■650 4▼aComputational physics
■653 ▼aCombinatorics
■653 ▼aProbability
■653 ▼aPercolation theory
■653 ▼aConnectivity events
■690 ▼a0405
■690 ▼a0217
■690 ▼a0216
■71020▼aUniversity of California, Los Angeles▼bMathematics 0540.
■7730 ▼tDissertations Abstracts International▼g86-12B.
■790 ▼a0031
■791 ▼aPh.D.
■792 ▼a2025
■793 ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T17357967▼nKERIS▼z이 자료의 원문은 한국교육학술정보원에서 제공합니다.
