Percolation on irregular high-dimensional product graphs

DOI10.1017/S0963548323000469MaRDI QIDQ6632810

Sahar Diskin, Michael Krivelevich, Joshua Erde, Mihyun Kang

Publication date: 5 November 2024

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

bond percolationcomponent sizesrandom subgraphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An approximate vertex-isoperimetric inequality for \(r\)-sets
• Largest random component of a k-cube
• Evolution of the \(n\)-cube
• Progress in high-dimensional percolation and random graphs
• Random graphs.
• The probabilistic method
• Introduction to Random Graphs
• Percolation
• The Evolution of Random Subgraphs of the Cube
• Isoperimetric Inequalities for Cartesian Products of Graphs
• Probability
• The giant component after percolation of product graphs
• Isoperimetric inequalities and supercritical percolation on high-dimensional graphs

This page was built for publication: Percolation on irregular high-dimensional product graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6632810)