A percolation on directed graphs
Probability
2016-04-04 v1 Statistics Theory
Statistics Theory
Abstract
Suppose each site independently and randomly chooses some sites around it, and it is weakly (strongly) connected with them (if there choose each other). What is the probability that the weak (strong) connected cluster is infinite? We investigate a percolation model for this problem, which is a generalization of site percolation. We give a relation between the probability of the number of chosen sites around a site and the size of clusters. We also see the expected number of infinite clusters, and the exponential tail decay of the radius and the size of a cluster.
Cite
@article{arxiv.1604.00371,
title = {A percolation on directed graphs},
author = {Mamoru Tanaka},
journal= {arXiv preprint arXiv:1604.00371},
year = {2016}
}