Heterogeneous Protection in Regular and Complete Bi-partite Networks
نویسندگان
چکیده
We examine the influence of heterogeneous curing rates for a SIS model, used for malware spreading on the Internet, information dissemination in unreliable networks, and propagation of failures in networks. The topology structures considered are the regular graph which represents the homogenous network structures and the complete bi-partite graph which represents the hierarchical network structures. We find the threshold in a regular graph with m different curing rates. Further, we consider a complete bi-partite graph with 2 curing rates and find the threshold for any distribution of curing rates among nodes. In addition, we consider the optimization problem and show that the minimum sum of the curing rates that satisfies the threshold equation is equal to the number of links in the graph. The optimization problem is simplified by assuming fixed curing rates δ1, δ2 and optimization of the distribution of curing rates among different sets of nodes.
منابع مشابه
Work in Progress: Heterogeneous Protection in Regular and Complete Bi-partite Networks
We examine the influence of heterogeneous curing rates for a SIS model, used for malware spreading on the Internet, information dissemination in unreliable networks, and propagation of failures in networks. The topology structures considered are the regular graph which represents the homogenous network structures and the complete bi-partite graph which represents the hierarchical network struct...
متن کاملEnumeration Based Search Algorithm For Finding A Regular Bi-partite Graph Of Maximum Attainable Girth For Specified Degree And Number Of Vertices
We introduce a search problem for finding a regular bi-partite graph of maximum attainable girth for specified degree and number of vertices, by restricting the search space using a series of mathematically rigourous arguments from [1] and [2]. The goal of this paper is to derive the enumeration search algorithm for finding a girth maximum (m, r) BTU, which is notation for regular partite graph...
متن کاملSome Algebraic and Combinatorial Properties of the Complete $T$-Partite Graphs
In this paper, we characterize the shellable complete $t$-partite graphs. We also show for these types of graphs the concepts vertex decomposable, shellable and sequentially Cohen-Macaulay are equivalent. Furthermore, we give a combinatorial condition for the Cohen-Macaulay complete $t$-partite graphs.
متن کاملAnalysis Of The Girth For Regular Bi-partite Graphs With Degree 3
The goal of this paper is to derive the detailed description of the Enumeration Based Search Algorithm from the high level description provided in [16], analyze the experimental results from our implementation of the Enumeration Based Search Algorithm for finding a regular bi-partite graph of degree 3, and compare it with known results from the available literature. We show that the values of m...
متن کاملAlmost all almost regular c-partite tournaments with cgeq5 are vertex pancyclic
A tournament is an orientation of a complete graph and a multipartite or c-partite tournament is an orientation of a complete c-partite graph. If D is a digraph, then let d + (x) be the outdgree and d ? (x) the indegree of the vertex x in D. The minimum (maximum) out-degree and the minimum (maximum) indegree of D are denoted by + ((+) and ? ((?), respectively. In addition, we deene = minf + ; ?...
متن کامل