Sandpile groups and the coeulerian property for random directed graphs
Combinatorics
2016-11-22 v1
Abstract
We consider random directed graphs, and calculate the distribution of the cokernels of their laplacian, following the methods used by Wood. As a corollary, we show that the probability that a random digraph is coeulerian is asymptotically upper bounded by a constant around .
Keywords
Cite
@article{arxiv.1611.06444,
title = {Sandpile groups and the coeulerian property for random directed graphs},
author = {Shaked Koplewitz},
journal= {arXiv preprint arXiv:1611.06444},
year = {2016}
}