16,882 research outputs found
On local weak limit and subgraph counts for sparse random graphs
We use an inequality of Sidorenko to show a general relation between local
and global subgraph counts and degree moments for locally weakly convergent
sequences of sparse random graphs. This yields an optimal criterion to check
when the asymptotic behaviour of graph statistics such as the clustering
coefficient and assortativity is determined by the local weak limit. As an
application we obtain new facts for several common models of sparse random
intersection graphs where the local weak limit, as we see here, is a simple
random clique tree corresponding to a certain two-type Galton-Watson branching
process
On Topological Properties of Wireless Sensor Networks under the q-Composite Key Predistribution Scheme with On/Off Channels
The q-composite key predistribution scheme [1] is used prevalently for secure
communications in large-scale wireless sensor networks (WSNs). Prior work
[2]-[4] explores topological properties of WSNs employing the q-composite
scheme for q = 1 with unreliable communication links modeled as independent
on/off channels. In this paper, we investigate topological properties related
to the node degree in WSNs operating under the q-composite scheme and the
on/off channel model. Our results apply to general q and are stronger than
those reported for the node degree in prior work even for the case of q being
1. Specifically, we show that the number of nodes with certain degree
asymptotically converges in distribution to a Poisson random variable, present
the asymptotic probability distribution for the minimum degree of the network,
and establish the asymptotically exact probability for the property that the
minimum degree is at least an arbitrary value. Numerical experiments confirm
the validity of our analytical findings.Comment: Best Student Paper Finalist in IEEE International Symposium on
Information Theory (ISIT) 201
Epidemics on random intersection graphs
In this paper we consider a model for the spread of a stochastic SIR
(Susceptible Infectious Recovered) epidemic on a network of
individuals described by a random intersection graph. Individuals belong to a
random number of cliques, each of random size, and infection can be transmitted
between two individuals if and only if there is a clique they both belong to.
Both the clique sizes and the number of cliques an individual belongs to follow
mixed Poisson distributions. An infinite-type branching process approximation
(with type being given by the length of an individual's infectious period) for
the early stages of an epidemic is developed and made fully rigorous by proving
an associated limit theorem as the population size tends to infinity. This
leads to a threshold parameter , so that in a large population an epidemic
with few initial infectives can give rise to a large outbreak if and only if
. A functional equation for the survival probability of the
approximating infinite-type branching process is determined; if , this
equation has no nonzero solution, while if , it is shown to have
precisely one nonzero solution. A law of large numbers for the size of such a
large outbreak is proved by exploiting a single-type branching process that
approximates the size of the susceptibility set of a typical individual.Comment: Published in at http://dx.doi.org/10.1214/13-AAP942 the Annals of
Applied Probability (http://www.imstat.org/aap/) by the Institute of
Mathematical Statistics (http://www.imstat.org
- β¦