Eigenvector Centrality in Highly Partitioned Mobile Networks: Principles and Applications Export

@incollection{carreras:eigenvector, abstract = {In this chapter we introduce a model for analyzing the spread of epidemics in a disconnected mobile network. The work is based on an extension, to a dynamic setting, of the eigenvector centrality principle introduced by two of the authors for the case of static networks. The extension builds on a new definition of connectivity matrix for a highly partitioned mobile system, where the connectivity between a pair of nodes is defined as the number of contacts taking place over a finite time window. The connectivity matrix is then used to evaluate the eigenvector centrality of the various nodes. Numerical results from real-world traces are presented and discussed. The applicability of the proposed approach to select on-line message forwarders is also addressed}, author = {Carreras, Iacopo and Miorandi, Daniele and Canright, Geoffrey and Monsen, Kenth E.}, citeulike-article-id = {1988019}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/978-3-540-72693-7_7}, citeulike-linkout-1 = {http://www.springerlink.com/content/288830l767l22383}, citeulike-linkout-2 = {http://reality.media.mit.edu/pdfs/Carreras.pdf}, doi = {10.1007/978-3-540-72693-7_7}, journal = {Advances in Biologically Inspired Information Systems}, keywords = {cambridge\_haggle, crawdad, mit\_diesel, mit\_reality, modelling, toronto\_bluetooth, umass\_diesel}, pages = {125--147}, posted-at = {2009-08-14 15:21:46}, priority = {2}, title = {Eigenvector Centrality in Highly Partitioned Mobile Networks: Principles and Applications}, url = {http://dx.doi.org/10.1007/978-3-540-72693-7_7}, year = {2007} }

TY - CHAP ID - carreras:eigenvector L3 - citeulike-article-id:1988019 N2 - In this chapter we introduce a model for analyzing the spread of epidemics in a disconnected mobile network. The work is based on an extension, to a dynamic setting, of the eigenvector centrality principle introduced by two of the authors for the case of static networks. The extension builds on a new definition of connectivity matrix for a highly partitioned mobile system, where the connectivity between a pair of nodes is defined as the number of contacts taking place over a finite time window. The connectivity matrix is then used to evaluate the eigenvector centrality of the various nodes. Numerical results from real-world traces are presented and discussed. The applicability of the proposed approach to select on-line message forwarders is also addressed JF - Advances in Biologically Inspired Information Systems EP - 147 TI - Eigenvector Centrality in Highly Partitioned Mobile Networks: Principles and Applications SP - 125 KW - cambridge_haggle KW - crawdad KW - mit_diesel KW - mit_reality KW - modelling KW - toronto_bluetooth KW - umass_diesel AU - Carreras, Iacopo AU - Miorandi, Daniele AU - Canright, Geoffrey AU - Monsen, Kenth PY - 2007/// UR - http://dx.doi.org/10.1007/978-3-540-72693-7_7 ER -