相关论文: Analysis of Push-type Epidemic Data Dissemination …
We consider propagation models that describe the spreading of an attribute, called "damage", through the nodes of a random network. In some systems, the average fraction of nodes that remain undamaged vanishes in the large system limit, a…
In this paper, we present an experimental analysis of the asynchronous push & pull rumour spreading protocol. This protocol is, to date, the best-performing rumour spreading protocol for simple, scalable, and robust information…
We perform a thorough study of various characteristics of the asynchronous push-pull protocol for spreading a rumor on Erd\H{o}s-R\'enyi random graphs $G_{n,p}$, for any $p>c\ln(n)/n$ with $c>1$. In particular, we provide a simple strategy…
Epidemics on complex networks is a widely investigated topic in the last few years, mainly due to the last pandemic events. Usually, real contact networks are dynamic, hence much effort has been invested in studying epidemics on evolving…
In this paper we consider a simple virus infection spread model on a finite population of $n$ agents connected by some neighborhood structure. Given a graph $G$ on $n$ vertices, we begin with some fixed number of initial infected vertices.…
We present an analytical method for computing the mean cover time of a random walk process on arbitrary, complex networks. The cover time is defined as the time a random walker requires to visit every node in the network at least once. This…
We consider the problem of distributing a vaccine for immunizing a scale-free network against a given virus or worm. We introduce a new method, based on vaccine dissemination, that seems to reflect more accurately what is expected to occur…
The asynchronous push&pull protocol, a randomized distributed algorithm for spreading a rumour in a graph $G$, works as follows. Independent Poisson clocks of rate 1 are associated with the vertices of $G$. Initially, one vertex of $G$…
We present a method aimed to compute the communicability (broadcast and receive) of nodes through causal paths in temporal networks. The method considers all possible combinations of chronologically ordered products of adjacency matrices of…
Under limited available resources, strategies for mitigating the propagation of an epidemic such as random testing and contact tracing become inefficient. Here, we propose to accurately allocate the resources by computing over time an…
We investigate the problem of spreading information contents in a wireless ad hoc network with mechanisms embracing the peer-to-peer paradigm. In our vision, information dissemination should satisfy the following requirements: (i) it…
Single virus epidemics over complete networks are widely explored in the literature as the fraction of infected nodes is, under appropriate microscopic modeling of the virus infection, a Markov process. With non-complete networks, this…
We prove a Central Limit Theorem for the proportion of infected individuals for an epidemic model by dealing with a discrete time system of simple random walks on a complete graph with n vertices. Each random walk makes a role of a virus.…
Information diffusion and virus propagation are fundamental processes taking place in networks. While it is often possible to directly observe when nodes become infected with a virus or adopt the information, observing individual…
We study a stochastic model of infection spreading on a network. At each time step a node is chosen at random, along with one of its neighbors. If the node is infected and the neighbor is susceptible, the neighbor becomes infected. How many…
We study the problem of disseminating a piece of information through all the nodes of a network, given that it is known originally only to a single node. In the absence of any structural knowledge on the network other than the nodes'…
In this work we consider three well-studied broadcast protocols: Push, Pull and Push&Pull. A key property of all these models, which is also an important reason for their popularity, is that they are presumed to be very robust, since they…
We model the spread of a SIS infection on Small World and random networks using weighted graphs. The entry $w_{ij}$ in the weight matrix W holds information about the transmission probability along the edge joining node $v_i$ and node…
The dynamic nature of system gives rise to dynamical features of epidemic spreading, such as oscillation and bistability. In this paper, by studying the epidemic spreading in growing networks, in which susceptible nodes may adaptively break…
Random walks are gaining much attention from the networks research community. They are the basis of many proposals aimed to solve a variety of network-related problems such as resource location, network construction, nodes sampling, etc.…