Journal article icon

Journal article

Exploring hypergraphs with martingales

Abstract:

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 Aldous [Ann Probab 25 (1997), 812–854], to prove asymptotic normality of the number L1 of vertices in the largest component urn:x-wiley:10429832:media:rsa20678:rsa20678-math-0001 of the random r‐unif...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Accepted Manuscript

Actions


Access Document


Files:
Publisher copy:
10.1002/rsa.20678

Authors


More by this author
Department:
St Edmund Hall
Role:
Author
Publisher:
Wiley Publisher's website
Journal:
Random Structures and Algorithms Journal website
Volume:
50
Issue:
3
Pages:
325-352
Publication date:
2017-03-23
Acceptance date:
2016-02-02
DOI:
EISSN:
1098-2418
ISSN:
1042-9832
Pubs id:
pubs:458352
URN:
uri:965931b3-69e3-4b57-b11a-13dd398ecbc8
UUID:
uuid:965931b3-69e3-4b57-b11a-13dd398ecbc8
Local pid:
pubs:458352

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP