125 search results - page 10 / 25 » Growth of components in random graphs |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The intrinsically secure communications graph (-graph) is a random graph which captures the connections that can be securely established over a large-scale network, in the presence...
WWW
2010
ACM
13 years 7 months ago
2010
ACM
With the phenomenal success of networking sites (e.g., Facebook, Twitter and LinkedIn), social networks have drawn substantial attention. On online social networking sites, link r...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
In this paper, we investigate limiting behavior of linear dynamic systems driven by random stochastic matrices. We introduce and study the new concepts of partial ergodicity and 1-...
DCG
2011
13 years 2 months ago
2011
We study the expected topological properties of ˇCech and Vietoris-Rips complexes built on random points in Rd . We find higher dimensional analogues of known results for connect...
CPC
2011
13 years 2 months ago
2011
We study a problem on edge percolation on product graphs G× K2. Here G is any finite graph and K2 consists of two vertices {0, 1} connected by an edge. Every edge in G × K2 is p...