uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Pareto Distance for Multi-layer Network Analysis
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. (UDBL)
IT University, Copenhagen.
2013 (English)In: Social Computing, Behavioral-Cultural Modeling and Prediction / [ed] Ariel M. Greenberg, William G. Kennedy, Nathan D. Bos, 2013, Vol. 7812, 249-256 p.Conference paper, Published paper (Refereed)
Abstract [en]

Social Network Analysis has been historically applied to single networks, e.g., interaction networks between co-workers. However, the advent of on-line social network sites has emphasized the stratified structure of our social experience. Individuals usually spread their identities over multiple services, e.g., Facebook, Twitter, LinkedIn and Foursquare. As a result, the analysis of on-line social networks requires a wider scope and, more technically speaking, models for the representation of this fragmented scenario. The recent introduction of more realistic layered models has however determined new research problems related to the extension of traditional single-layer network measures. In this paper we take a step forward over existing approaches by defining a new concept of geodesic distance that includes heterogeneous networks and connections with very limited assumptions regarding the strength of the connections. This is achieved by exploiting the concept of Pareto efficiency to define a simple and at the same time powerful measure that we call Pareto distance, of which geodesic distance is a particular case when a single layer (or network) is analyzed. The limited assumptions on the nature of the connections required by the Pareto distance may in theory result in a large number of potential shortest paths between pairs of nodes. However, an experimental computation of distances on multi-layer networks of increasing size shows an interesting and non-trivial stable behavior.

Place, publisher, year, edition, pages
2013. Vol. 7812, 249-256 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 7812
National Category
Information Systems
Identifiers
URN: urn:nbn:se:uu:diva-204584DOI: 10.1007/978-3-642-37210-0_27ISBN: 978-3-642-37209-4 (print)OAI: oai:DiVA.org:uu-204584DiVA: diva2:640603
Conference
6th International Conference, SBP 2013, Washington, DC, USA, April 2-5, 2013. Proceedings
Available from: 2013-08-14 Created: 2013-08-06 Last updated: 2013-12-10

Open Access in DiVA

No full text

Other links

Publisher's full texthttp://link.springer.com/chapter/10.1007/978-3-642-37210-0_27

Authority records BETA

Magnani, Matteo

Search in DiVA

By author/editor
Magnani, Matteo
By organisation
Computing Science
Information Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 450 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf