A note on the random triadic process

DOI10.1016/J.DISC.2024.114374MaRDI QIDQ7028855zbMATH OpenFDO

Authors Fang Tian, Yiting Yang

Publication date 11 February 2025

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2024.114374

zbMATH Keywords

concentration inequalitiesrandom graphthresholdtriadic graph processuniform hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Cites work

• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• A natural barrier in random greedy hypergraph matching
• A random triadic process
• A sharp threshold for bootstrap percolation in a random hypergraph
• On the random greedy \(F\)-free hypergraph process
• Random triangle removal
• The triangle-free process

This page was built for publication: A note on the random triadic process

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