Exploring hypergraphs with martingales
Recently, in [Random Struct Algorithm 41 (2012), 441–450] we adapted exploration and martingale arguments of Nachmias and Peres [ALEA Lat Am J Probab Math Stat 3 (2007), 133–142], in turn based on ideas of Martin‐Löf [J Appl Probab 23 (1986), 265–282], Karp [Random Struct Alg 1 (1990), 73–93] and Al...
Main Authors: | Bollobás, B, Riordan, O |
---|---|
Format: | Journal article |
Published: |
Wiley
2017
|
Similar Items
-
Counting dense connected hypergraphs via the probabilistic method
by: Bollobás, B, et al.
Published: (2018) -
Asymptotic normality of the size of the giant component in a random hypergraph
by: Bollobás, B, et al.
Published: (2012) -
Asymptotic normality of the size of the giant component in a random
hypergraph
by: Bollobas, B, et al.
Published: (2011) -
Intersections of hypergraphs
by: Bollobas, B, et al.
Published: (2014) -
Intersections of random hypergraphs and tournaments
by: Bollobas, B, et al.
Published: (2014)