liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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
Hide and Seek in a Social Network
Linköping University, Department of Electrical Engineering, Communication Systems.
2017 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

In this thesis a known heuristic for decreasing a node's centrality scores while maintaining influence, called ROAM, is compared to a modified version specifically designed to decrease eigenvector centrality. The performances of these heuristics are also tested against the Shapley values of a cooperative game played over the considered network, where the game is such that influential nodes receive higher Shapley values. The modified heuristic performed at least as good as the original ROAM, and in some instances even better (especially when the terrorist network behind the World Trade Center attacks was considered). Both heuristics increased the influence score for a given targeted node when applied consecutively on the WTC network, and consequently the Shapley values increased as well. Therefore the Shapley value of the game considered in this thesis seems to be well suited for discovering individuals that are assumed to actively trying to evade social network analysis.

Place, publisher, year, edition, pages
2017. , p. 63
Keywords [en]
terrorists, hiding, network theory, social network, graph theory, eigenvector centrality, game theory, cooperative game, Shapley value, Myerson value
National Category
Other Mathematics
Identifiers
URN: urn:nbn:se:liu:diva-139059ISRN: LiTH-ISY-EX--17/5038–SEOAI: oai:DiVA.org:liu-139059DiVA, id: diva2:1117970
Subject / course
Mathematics
Presentation
2017-06-09, Algoritmen, Linköpings Universitet, B-huset, Linköping, 09:15 (Swedish)
Supervisors
Examiners
Available from: 2017-06-29 Created: 2017-06-29 Last updated: 2017-06-30Bibliographically approved

Open Access in DiVA

fulltext(458 kB)149 downloads
File information
File name FULLTEXT01.pdfFile size 458 kBChecksum SHA-512
b44082755d5bac382da0d28c8e6cc651d5a53b9f3b3a21bcba9f25ec319375410d4729e10892dfa57720cb8ac16cd67c3e4c55c5848954f663707d4c519d73a7
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Abrahamsson, Olle
By organisation
Communication Systems
Other Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 149 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 805 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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