Color-avoiding percolation and branching processes

DOI10.1017/jpr.2023.115zbMATH Open1548.05294MaRDI QIDQ6617605

Kitti Varga, Roland Molontay, Panna Tímea Fekete, Balázs Ráth

Publication date: 11 October 2024

Published in: Journal of Applied Probability (Search for Journal in Brave)

zbMATH Keywords

generating functiongiant componentErdős-Rényi random graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Exact enumeration problems, generating functions (05A15) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Cites Work

• Unnamed Item
• Unnamed Item
• Correlation inequalities on some partially ordered sets
• Deterministic and stochastic models for coalescence (aggregation and coagulation): A review of the mean-field theory for probabilists
• Brownian excursions, critical random graphs and the multiplicative coalescent
• Über eine Schlußweise aus dem Endlichen ins Unendliche.
• Conceptual proofs of \(L\log L\) criteria for mean behavior of branching processes
• On the complexity of color-avoiding site and bond percolation
• Percolation on complex networks: theory and application
• Random Graphs and Complex Networks

This page was built for publication: Color-avoiding percolation and branching processes