Learn More
J o u r n a l o f P r o b a b i l i t y Electron. Abstract We consider sparse random intersection graphs with the property that the clustering coefficient does not vanish as the number of nodes tends to infinity. We find explicit asymptotic expressions for the correlation coefficient of degrees of adjacent nodes (called the assortativity coefficient), the(More)
We consider a key distribution scheme for wireless sensor networks which uses deployment knowledge. Deployment is modeled as a grid of hexagonal clusters, into centers of which the sensor nodes are dropped according to a given probability distribution (e.g. a Gaussian one). We consider sensor connectivity in a random intersection graph model, instead of the(More)
In this paper we consider a cutting process for random mappings. Specifically, for 0 < m < n, we consider the initial (uniform) random mapping digraph G n on n labelled vertices, and we delete (if possible), uniformly and at random, m non-cyclic directed edges from G n. The maximal random digraph consisting of the uni-cyclic components obtained after(More)