서브메뉴
검색
Percolation on Transitive Graphs
Percolation on Transitive Graphs
Detailed Information
- Material Type
- 단행본
- 0017358796
- Date and Time of Latest Transaction
- 20260202104753
- ISBN
- 9798290654720
- DDC
- 530
- Author
- Easo, Philip.
- Title/Author
- Percolation on Transitive Graphs
- Publish Info
- [Sl] : California Institute of Technology, 2025
- Publish Info
- Ann Arbor : ProQuest Dissertations & Theses, 2025
- Material Info
- 409 p
- General Note
- Source: Dissertations Abstracts International, Volume: 87-03, Section: B.
- General Note
- Advisor: Hutchcroft, Tom.
- 학위논문주기
- Thesis (Ph.D.)--California Institute of Technology, 2025.
- Abstracts/Etc
- 요약Percolation on a transitive graph is an idealized mathematical model for a homogeneous system undergoing a phase transition. We will investigate how the geometry of an infinite transitive graph determines whether percolation undergoes a phase transition, and if so, at what critical point. Building on these ideas, we will develop a new theory of percolation on finite transitive graphs. This theory unifies the percolation phase transition on infinite transitive graphs with the giant-cluster phase transition in the celebrated Erdos-Renyi model from combinatorics.
- Subject Added Entry-Topical Term
- Phase transitions
- Subject Added Entry-Topical Term
- Probability
- Subject Added Entry-Topical Term
- Statistical mechanics
- Subject Added Entry-Topical Term
- Graphs
- Subject Added Entry-Topical Term
- Geometry
- Subject Added Entry-Topical Term
- Mathematics
- Subject Added Entry-Topical Term
- Applied mathematics
- Index Term-Uncontrolled
- Percolation
- Index Term-Uncontrolled
- Homogeneous system
- Added Entry-Corporate Name
- California Institute of Technology Physics Mathematics and Astronomy
- Host Item Entry
- Dissertations Abstracts International. 87-03B.
- Electronic Location and Access
- 로그인 후 원문을 볼 수 있습니다.
MARC
008260126s2025 us c eng d■001000017358796
■00520260202104753
■006m o d
■007cr#unu||||||||
■020 ▼a9798290654720
■035 ▼a(MiAaPQ)AAI32151361
■035 ▼a(MiAaPQ)Caltech17315
■040 ▼aMiAaPQ▼cMiAaPQ
■0820 ▼a530
■1001 ▼aEaso, Philip.
■24510▼aPercolation on Transitive Graphs
■260 ▼a[Sl]▼bCalifornia Institute of Technology▼c2025
■260 1▼aAnn Arbor▼bProQuest Dissertations & Theses▼c2025
■300 ▼a409 p
■500 ▼aSource: Dissertations Abstracts International, Volume: 87-03, Section: B.
■500 ▼aAdvisor: Hutchcroft, Tom.
■5021 ▼aThesis (Ph.D.)--California Institute of Technology, 2025.
■520 ▼aPercolation on a transitive graph is an idealized mathematical model for a homogeneous system undergoing a phase transition. We will investigate how the geometry of an infinite transitive graph determines whether percolation undergoes a phase transition, and if so, at what critical point. Building on these ideas, we will develop a new theory of percolation on finite transitive graphs. This theory unifies the percolation phase transition on infinite transitive graphs with the giant-cluster phase transition in the celebrated Erdos-Renyi model from combinatorics.
■590 ▼aSchool code: 0037.
■650 4▼aPhase transitions
■650 4▼aProbability
■650 4▼aStatistical mechanics
■650 4▼aGraphs
■650 4▼aGeometry
■650 4▼aMathematics
■650 4▼aApplied mathematics
■653 ▼aPercolation
■653 ▼aHomogeneous system
■690 ▼a0405
■690 ▼a0364
■71020▼aCalifornia Institute of Technology▼bPhysics, Mathematics and Astronomy.
■7730 ▼tDissertations Abstracts International▼g87-03B.
■790 ▼a0037
■791 ▼aPh.D.
■792 ▼a2025
■793 ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T17358796▼nKERIS▼z이 자료의 원문은 한국교육학술정보원에서 제공합니다.
Preview
Export
ChatGPT Discussion
AI Recommended Related Books
Detail Info.
- Reservation
- Not Exist
- My Folder
- First Request
- Non-Book Loan Application
- Nighttime Book Loan Application
Books borrowed together with this book
Related Popular Books
Available after logging in.