Related papers: Epidemic thresholds on scale-free graphs: the inte…
Abstract In Extreme Value methodology the choice of threshold plays an important role in efficient modelling of observations exceeding the threshold. The threshold must be chosen high enough to ensure an unbiased extreme value index but…
We study the threshold of epidemic models in quenched networks with degree distribution given by a power-law. For the susceptible-infected-susceptible (SIS) model the activity threshold lambda_c vanishes in the large size limit on any…
The initial phase of an epidemic is often characterized by an exponential increase in the number of infected individuals. In this paper, we predict the exponential spreading rate of an epidemic on a complex network. We first find an…
In this paper we describe the emergence of scale-free degree distributions from statistical mechanics principles. We define an energy associated to a degree sequence as the logarithm of the number of indistinguishable simple networks it is…
We investigate the standard susceptible-infected-susceptible model on a random network to study the effects of preference and geography on diseases spreading. The network grows by introducing one random node with $m$ links on a Euclidean…
The outcome of SIR epidemics with heterogeneous infective lifetimes, or heterogeneous susceptibilities, can be mapped onto a directed percolation process on the underlying contact network. In this paper we study SIR models where…
The degree distribution of a real world network -- the number of links per node -- often follows a power law, with some hubs having many more links than traditional graph generation methods predict. For years, preferential attachment and…
We study ensemble-based graph-theoretical methods aiming to approximate the size of the minimum dominating set (MDS) in scale-free networks. We analyze both analytical upper bounds of dominating sets and numerical realizations for…
The bloom of complex network study, in particular, with respect to scale-free ones, is considerably triggering the research of scale-free graph itself. Therefore, a great number of interesting results have been reported in the past,…
A random network model which allows for tunable, quite general forms of clustering, degree correlation and degree distribution is defined. The model is an extension of the configuration model, in which stubs (half-edges) are paired to form…
We establish asymptotic vertex degree distribution and examine its relation to the clustering coefficient in two popular random intersection graph models of Godehardt and Jaworski [Electron. Notes Discrete Math. 10 (2001) 129-132]. For…
With the premise that social interactions are described by power-law distributions, we study a SIR stochastic dynamic on a static scale-free random network generated via configuration model. We verify our model with respect to deterministic…
We consider the Majority Vote model coupled with scale-free networks. Recent works point to a non-universal behavior of the Majority Vote model, where the critical exponents depend on the connectivity while the network's effective dimension…
We give an explicit construction of the weak local limit of a class of preferential attachment graphs. This limit contains all local information and allows several computations that are otherwise hard, for example, joint degree…
We consider an infectious disease spreading along the edges of a network which may have significant clustering. The individuals in the population have heterogeneous infectiousness and/or susceptibility. We define the out-transmissibility of…
We provide optimal rates of convergence to the asymptotic distribution of the (properly scaled) degree of a fixed vertex in two preferential attachment random graph models. Our approach is to show that these distributions are unique fixed…
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…
We study the susceptibility, i.e., the mean cluster size, in random graphs with given vertex degrees. We show, under weak assumptions, that the susceptibility converges to the expected cluster size in the corresponding branching process. In…
In this paper, we focus on susceptible-infected-susceptible dynamics on metapopulation networks, where nodes represent subpopulations, and where agents diffuse and interact. Recent studies suggest that heterogeneous network structure…
Through the distinction between ``real'' and ``virtual'' links between the nodes of a graph, we develop a set of simple rules leading to scale-free networks with a tunable degree distribution exponent. Albeit sharing some similarities with…