Related papers: Graphon-based sensitivity analysis of SIS epidemic…
This work establishes rigorous, novel and widely applicable stability guarantees and transferability bounds for graph convolutional networks -- without reference to any underlying limit object or statistical distribution. Crucially,…
Quantum graphs with leads to infinity serve as convenient models for studying various aspects of systems which are usually attributed to chaotic scattering. They are also studied in several experimental systems and practical applications.…
Graph Neural Networks (GNNs) have shown remarkable capabilities in learning from graph-structured data with various applications such as social analysis and bioinformatics. However, the presence of label noise in real scenarios poses a…
We consider a standard \textit{susceptible-infected-susceptible} (SIS) model to study behaviors of steady states of epidemic spreading in small-world networks. Using analytical methods and large scale simulations, we recover the usual…
In this paper, we study the dynamics of epidemic processes taking place in adaptive networks of arbitrary topology. We focus our study on the adaptive susceptible-infected-susceptible (ASIS) model, where healthy individuals are allowed to…
This paper deals with the spread of diseases over both a population network and an infrastructure network. We develop a layered networked spread model for a susceptible-infected-susceptible (SIS) pathogen-borne disease spreading over a…
We investigate how the graph topology influences the robustness to noise in undirected linear consensus networks. We measure the structural robustness by using the smallest possible value of steady state population variance of states under…
We study an SIS epidemic process over a static contact network where the nodes have partial information about the epidemic state. They react by limiting their interactions with their neighbors when they believe the epidemic is currently…
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…
This paper considers the classical Susceptible--Infected--Susceptible (SIS) network epidemic model, which describes a disease spreading through $n$ nodes, with the network links governing the possible transmission pathways of the disease…
We consider an SIR epidemic model propagating on a configuration model network, where the degree distribution of the vertices is given and where the edges are randomly matched. The evolution of the epidemic is summed up into three…
This paper considers the susceptible-infected-susceptible (SIS) epidemic model with an underlying network structure among subpopulations and focuses on the effect of social distancing to regulate the epidemic level. We demonstrate that if…
Disease awareness in epidemiology can be modelled with adaptive contact networks, where the interplay of disease dynamics and network alteration often adds new phases to the standard models (Gross et al. 2006, Shaw et al. 2008) and, in…
We introduce a fast simulation technique for modeling epidemics on adaptive networks. Our rejection-based algorithm efficiently simulates the co-evolution of the network structure and the epidemic dynamics. We extend the classical SIS model…
Networked epidemic models have been widely adopted to describe propagation phenomena. The endemic equilibrium of these models is of great significance in the field of viral marketing, innovation dissemination, and information diffusion.…
The paper deals with the spread of two competing viruses over a network of population nodes, accounting for pairwise interactions and higher-order interactions (HOI) within and between the population nodes. We study the competitive…
In this paper, we derive the asymptotic distribution of the number of copies of a fixed graph $H$ in a random graph $G_n$ sampled from a sparse graphon model. Specifically, we provide a refined analysis that separates the contributions of…
We consider the problem of estimating the topology of multiple networks from nodal observations, where these networks are assumed to be drawn from the same (unknown) random graph model. We adopt a graphon as our random graph model, which is…
In this paper we analyze continuous-time SIS epidemics subject to arrivals and departures of agents, by using an approximated process based on replacements. In defining the SIS dynamics in an open network, we consider a stochastic setting…
This letter investigates the bias-dependent low frequency noise of single layer graphene field-effect transistors. Noise measurements have been conducted with electrolyte-gated graphene transistors covering a wide range of gate and drain…