Sciweavers

64 search results - page 10 / 13
» Percolation in self-similar networks
Sort
View
EJC
2008
13 years 7 months ago
Expansion properties of a random regular graph after random vertex deletions
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. ...
DIS
2009
Springer
13 years 11 months ago
Discovering Influential Nodes for SIS Models in Social Networks
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...
Kazumi Saito, Masahiro Kimura, Hiroshi Motoda
ICC
2008
IEEE
127views Communications» more  ICC 2008»
14 years 2 months ago
On the Devolution of Large-Scale Sensor Networks in the Presence of Random Failures
—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 ...
Fei Xing, Wenye Wang
MOBICOM
2009
ACM
14 years 2 months ago
Connectivity of cognitive radio networks: proximity vs. opportunity
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...
Wei Ren, Qing Zhao, Ananthram Swami
GLOBECOM
2010
IEEE
13 years 5 months ago
Phase Transition Diagram for Underlay Heterogeneous Cognitive Radio Networks
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...
Weng-Chon Ao, Shin-Ming Cheng, Kwang-Cheng Chen