We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p = n-...
Catherine S. Greenhill, Fred B. Holt, Nicholas C. ...
We address the problem of efficiently discovering the influential nodes in a social network under the susceptible/infected/susceptible (SIS) model, a diffusion model where nodes ar...
—In battery-constrained large-scale sensor networks, nodes are prone to random failures due to various reasons, such as energy depletion and hostile environment. Random failures ...
We address the connectivity of large-scale ad hoc cognitive radio networks, where secondary users exploit channels temporarily and locally unused by primary users and the existenc...
Abstract--Characterizing the topology and therefore fundamental limits is a must to establish effective end-to-end cognitive radio networking (CRN). However, there lacks complete u...