Related papers: A model for infection on graphs
We consider a finite structured population of mobile individuals that strategically explore a network using a Markov movement model and interact with each other via a public goods game. We extend the model of Erovenko et al. (2019) from…
One of the famous results of network science states that networks with heterogeneous connectivity are more susceptible to epidemic spreading than their more homogeneous counterparts. In particular, in networks of identical nodes it has been…
In this paper, we give an analytic solution for graphs with n nodes and E edges for which the probability of obtaining a given graph G is specified in terms of the degree sequence of G. We describe how this model naturally appears in the…
We consider random walks that start and are absorbed on the leaves of random networks and study the length of such walks. For the networks we investigate, Erdos-Renyi random graphs and Barabasi-Albert scale free networks, these walks are…
Various graph algorithms have been developed with multiple random walks, the movement of several independent random walkers on a graph. Designing an efficient graph algorithm based on multiple random walks requires investigating multiple…
In a networked system, functionality can be seriously endangered when nodes are infected, due to internal random failures or a contagious virus that develops into an epidemic. Given a snapshot of the network representing the nodes' states…
A key characteristic of the spread of infectious diseases is their ability to use efficient transmission paths within contact graphs. This enables the pathogen to maximise infection rates and spread within a target population. In this work,…
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
We show that the recently introduced logarithmic metrics used to predict disease arrival times on complex networks are approximations of more general network-based measures derived from random walks theory. Using the daily air-traffic…
The evolution of network structure and the spreading of epidemic are common coexistent dynamical processes. In most cases, network structure is treated either static or time-varying, supposing the whole network is observed in a same time…
We investigate the hitting times of random walks on graphs, where a hitting time is defined as the number of steps required for a random walker to move from one node to another. While much of the existing literature focuses on calculating…
Graph-theoretic methods have seen wide use throughout the literature on multi-agent control and optimization. When communications are intermittent and unpredictable, such networks have been modeled using random communication graphs. When…
The structure of sexual contacts, its contacts network and its temporal interactions, play an important role in the spread of sexually transmitted infections. Unfortunately, that kind of data is very hard to obtain. One of the few…
The study of SIS epidemics on networks has stressed the role of the network topology on the spreading process. However, accurate models of SIS epidemics rely on the complete knowledge of the network topology, which is often not available.…
We study the spreading of cooperative infections in an empirical temporal network of contacts between people, including health care workers and patients, in a hospital. The system exhibits a phase transition leading to one or several…
We present a thorough inspection of the dynamical behavior of epidemic phenomena in populations with complex and heterogeneous connectivity patterns. We show that the growth of the epidemic prevalence is virtually instantaneous in all…
We study the spread of multi-competitive viruses over a (possibly) time-varying network of individuals accounting for the presence of shared infrastructure networks that further enables transmission of the virus. We establish a sufficient…
We study epidemic arrival times in meta-population disease models through the lens of front propagation into unstable states. We demonstrate that several features of invasion fronts in the PDE context are also relevant to the network case.…
We study the traffic-driven epidemic spreading on scale-free networks with tunable degree distribution. The heterogeneity of networks is controlled by the exponent $\gamma$ of power-law degree distribution. It is found that the epidemic…
Dynamical processes taking place on networks have received much attention in recent years, especially on various models of random graphs (including small world and scale free networks). They model a variety of phenomena, including the…