22 research outputs found
Fiedler’s Clustering on m-dimensional Lattice Graphs
We consider the partitioning of m-dimensional lattice graphs using Fiedler’s approach [1], that requires the determination of the eigenvector belonging to the second smallest eigenvalue of
the Laplacian. We examine the general m-dimensional lattice and, in particular, the special cases: the 1-dimensional path graph and the 2-dimensional lattice graph. We determine the size of the clusters and the number of links, which are cut by this partitioning as a function of Fiedler’s threshold α.Peer Reviewe
Decentralized Protection Strategies against SIS Epidemics in Networks
Defining an optimal protection strategy against viruses, spam propagation or
any other kind of contamination process is an important feature for designing
new networks and architectures. In this work, we consider decentralized optimal
protection strategies when a virus is propagating over a network through a SIS
epidemic process. We assume that each node in the network can fully protect
itself from infection at a constant cost, or the node can use recovery
software, once it is infected.
We model our system using a game theoretic framework and find pure, mixed
equilibria, and the Price of Anarchy (PoA) in several network topologies.
Further, we propose both a decentralized algorithm and an iterative procedure
to compute a pure equilibrium in the general case of a multiple communities
network. Finally, we evaluate the algorithms and give numerical illustrations
of all our results.Comment: accepted for publication in IEEE Transactions on Control of Network
System
Complete game-theoretic characterization of SIS epidemics protection strategies
International audienceDefining an optimal protection strategy against viruses, spam propagation or any other kind of contamination process is an important feature for designing new networks and architectures. In this work, we consider decentralized optimal protection strategies when a virus is propagating over a network through a Susceptible Infected Susceptible (SIS) epidemic process. We assume that each node in the network can fully protect itself from infection at a constant cost, or the node can use recovery software, once it is infected. We model our system using a game theoretic framework. Based on this model, we find pure and mixed equilibria, and evaluate the performance of the equilibria by finding the Price of Anarchy (PoA) in several network topologies. Finally, we give numerical illustrations of our results
From epidemics to information propagation: Striking differences in structurally similar adaptive network models
Fiedler’s Clustering on m-dimensional Lattice Graphs
We consider the partitioning of m-dimensional lattice graphs using Fiedler’s approach [1], that requires the determination of the eigenvector belonging to the second smallest eigenvalue of
the Laplacian. We examine the general m-dimensional lattice and, in particular, the special cases: the 1-dimensional path graph and the 2-dimensional lattice graph. We determine the size of the clusters and the number of links, which are cut by this partitioning as a function of Fiedler’s threshold α.Peer Reviewe
Fiedler's Clustering on m−dimensional Lattice Graphs
We consider the partitioning of m-dimensional lattice graphs using Fiedler's approac