Probabilistic Properties of GIG Digraphs
Combinatorics
2019-11-21 v1 Discrete Mathematics
Abstract
We study the probabilistic properties of the Greatest Increase Grid (GIG) digraph. We compute the probability of a particular sequence of directed edges connecting two random vertices. We compute the joint probability that a set of vertices are all sinks, and derive the mean and variance in the number of sinks in a randomly labeled GIG digraph. Finally, we show that the expected size of the maximum component of vertices converges.
Cite
@article{arxiv.1911.08595,
title = {Probabilistic Properties of GIG Digraphs},
author = {Chuhan Guo and Laurie J. Heyer and Jeffrey L. Poet},
journal= {arXiv preprint arXiv:1911.08595},
year = {2019}
}