Collision times in multicolor urn models and sequential graph coloring with applications to discrete logarithms

DOI10.1214/16-AAP1176zbMath1356.05045arXiv1311.4243MaRDI QIDQ511468

Bhaswar B. Bhattacharya

Publication date: 21 February 2017

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

Full work available at URL: https://arxiv.org/abs/1311.4243

zbMATH Keywords

graph coloringlimit theoremsdiscrete logarithmPoisson embedding

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Coloring of graphs and hypergraphs (05C15) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Authentication, digital signatures and secret sharing (94A62)

Related Items (3)

A fourth‐moment phenomenon for asymptotic normality of monochromatic subgraphs ⋮ Normal approximation and fourth moment theorems for monochromatic triangles ⋮ Monochromatic subgraphs in randomly colored graphons

This page was built for publication: Collision times in multicolor urn models and sequential graph coloring with applications to discrete logarithms