• DocumentCode
    2054846
  • Title

    Trust Centrality in Online Social Networks

  • Author

    Barbian, Guido

  • Author_Institution
    Inst. for Knowledge & Inf. Manage., Leuphana Univ., Luneburg, Germany
  • fYear
    2011
  • fDate
    12-14 Sept. 2011
  • Firstpage
    372
  • Lastpage
    377
  • Abstract
    Centrality is an important element of social network analysis (SNA) measuring the relative power and influence of members of a social network. In face book-style online social networks every member is potentially able to communicate with everyone else within the network. This has an important impact on centrality: the power derivable from (exclusive) connections within the social graph is reduced because network members must not necessarily follow links. In this paper we propose a new measure for centrality which reflects this paradigm shift. It is based not on connectedness but on trust. We discuss different notions of trust, introduce trust matrix and trust centrality and provide an algorithm for its calculation.
  • Keywords
    graph theory; matrix algebra; security of data; social networking (online); facebook-style online social networks; social graph; social network analysis; trust centrality; trust matrix; DH-HEMTs; Facebook; Peer to peer computing; Privacy; Symmetric matrices; Tin; centrality; online social network; reputation; social network analysis; trust; trust centrality; trust matrix;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligence and Security Informatics Conference (EISIC), 2011 European
  • Conference_Location
    Athens
  • Print_ISBN
    978-1-4577-1464-1
  • Electronic_ISBN
    978-0-7695-4406-9
  • Type

    conf

  • DOI
    10.1109/EISIC.2011.17
  • Filename
    6061233