Related papers: A note on general epidemic region for infinite reg…
Applying a modification of Extreme value Theory (thanks to a dual distribution technique by the authors on data over the past 2,500 years, we show that pandemics are extremely fat-tailed in terms of fatalities, with a marked potentially…
We study a simple model of epidemics where an infected node transmits the infection to its neighbors independently with probability $p$. This is also known as the independent cascade or Susceptible-Infected-Recovered (SIR) model with fixed…
If $\Gamma$ is a graph for which every edge is in exactly one clique of order $\omega$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $\Gamma$. We discover many general…
We introduce the concept of link-irregular labelings for graphs, extending the notion of link-irregular graphs through edge labeling with positive integers. A labeling is link-irregular if every vertex has a uniquely labeled subgraph…
Network epidemiology's most important assumption is that the contact structure over which infectious diseases propagate can be represented as a static network. However, contacts are highly dynamic, changing at many time scales. In this…
We study preferential attachment models where vertices enter the network with i.i.d. random numbers of edges that we call the out-degree. We identify the local limit of such models, substantially extending the work of Berger et al.(2014).…
Our main goal is to examine the role of communities in epidemic spread in a random graph model. More precisely, we consider a random graph model which consists of overlapping complete graphs, representing households, workplaces, school…
We study epidemic spreading processes in large networks, when the spread is assisted by a small number of external agents: infection sources with bounded spreading power, but whose movement is unrestricted vis-\`a-vis the underlying network…
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 many epidemiological and ecological contexts, there is a trade-off between infections and interactions. This arises because the links between individuals capable of spreading infections are also often associated with beneficial…
An oriented hypergraph is an oriented incidence structure that allows for the generalization of graph theoretic concepts to integer matrices through its locally signed graphic substructure. The locally graphic behaviors are formalized in…
Following Bradonji\'c and Saniee, we study a model of bootstrap percolation on the Gilbert random geometric graph on the $2$-dimensional torus. In this model, the expected number of vertices of the graph is $n$, and the expected degree of a…
In this paper, we propose a mathematical framework that governs the evolution of epidemic dynamics, encompassing both intra-population dynamics and inter-population mobility within a metapopulation network. By linearizing this dynamical…
Despite recent success in using the invariance principle for out-of-distribution (OOD) generalization on Euclidean data (e.g., images), studies on graph data are still limited. Different from images, the complex nature of graphs poses…
We investigate the information-theoretical limits of inference tasks in epidemic spreading on graphs in the thermodynamic limit. The typical inference tasks consist in computing observables of the posterior distribution of the epidemic…
In epidemic modeling, the term infection strength indicates the ratio of infection rate and cure rate. If the infection strength is higher than a certain threshold -- which we define as the epidemic threshold - then the epidemic spreads…
In this paper, we analyze dynamic switching networks, wherein the networks switch arbitrarily among a set of topologies. For this class of dynamic networks, we derive an epidemic threshold, considering the SIS epidemic model. First, an…
Motivated by the study of controlling (curing) epidemics, we consider the spread of an SI process on a known graph, where we have a limited budget to use to transition infected nodes back to the susceptible state (i.e., to cure nodes).…
This work uses Game Theory to study the effectiveness of punishments as an incentive for rational nodes to follow an epidemic dissemination protocol. The dissemination process is modeled as an infinite repetition of a stage game. At the end…
We study a family of binary state, socially-inspired contagion models which incorporate imitation limited by an aversion to complete conformity. We uncover rich behavior in our models whether operating with either probabilistic or…