Proves a zero-one law for the minimum node degree being at least k in the inhomogeneous random K-out graph model from heterogeneous pairwise key predistribution.
This technique is referred to as the method of first moment
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Towards $k$-connectivity in Heterogeneous Sensor Networks under Pairwise Key Predistribution
Proves a zero-one law for the minimum node degree being at least k in the inhomogeneous random K-out graph model from heterogeneous pairwise key predistribution.