Percolation on high-dimensional product graphs

DOI10.1002/RSA.21268MaRDI QIDQ7027471zbMATH OpenFDO

Authors Sahar Diskin, Joshua Erde, Mihyun Kang, Michael Krivelevich

Publication date 14 February 2025

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1002/RSA.21268

zbMATH Keywords

percolationphase transitionproduct graphsrandom graphs

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Cites work

• A critical point for random graphs with a given degree sequence
• Critical percolation on random regular graphs
• Evolution of the n-cube
• scientific article; zbMATH DE number 3148802 (Why is no real title available?)
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 3826957 (Why is no real title available?)
• scientific article; zbMATH DE number 736289 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 3190745 (Why is no real title available?)
• Introduction to Random Graphs
• Isoperimetric Inequalities for Cartesian Products of Graphs
• Largest random component of a k-cube
• Optimal Assignments of Numbers to Vertices
• Percolation
• Percolation
• Percolation on irregular high-dimensional product graphs
• Probability
• Random graphs.
• Random minimum length spanning trees in regular graphs
• Supercritical site percolation on the hypercube: small components are small
• The emergence of a giant component in random subgraphs of pseudo-random graphs
• The Evolution of Random Subgraphs of the Cube
• The giant component after percolation of product graphs
• The phase transition in random graphs: a simple proof
• The probabilistic method

Cited in

(2)

• Components, large and small, are as they should be. II: Supercritical percolation on regular graphs of constant degree
• Components, large and small, are as they should be I: supercritical percolation on regular graphs of growing degree

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

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