Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • 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
Local measures for probabilistic networks
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Computing Science. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
2019 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

Modeling and analysis of imperfection in network data is essential in many applications such as protein–protein interaction networks, ad-hoc networks and social influence networks. In the study of imperfect network data, three issues have to be considered: first the type of imperfection, second the aspects of networks such as existence of nodes/edges or attributes of nodes/edges in which imperfection occurs and third the theory that has been used to represent imperfection. This thesis, first, reviews the different types of imperfection and consolidates the meaning of the terms used in literature. Second, it discusses network aspects and theories through which imperfect network data is represented and analyzed. Amongst all, the most applied model is uncertainty about existence of edges which is represented using probability theory, called probabilistic networks. Third, this thesis surveys queries and algorithms which have been applied over probabilistic networks.

Fourth and the main focus of this dissertation is to look deeply at nodes' local properties in probabilistic networks. In our first contribution we have shown that two nodes with the same expected degree can have different properties. In this work we have highlighted the role of other summary information of degree distribution such as variance and skewness in addition to the expected value. In our second contribution, we have introduced two possible definitions of probabilistic ego networks and we have studied the concepts of degree, ego betweenness and ego closeness.

One of the main applications of the proposed local properties could be in the sparsification process, in which a network's edges and the probability of the edges are altered, but nodes' local properties are preserved.

Place, publisher, year, edition, pages
Uppsala University, 2019.
Series
Information technology licentiate theses: Licentiate theses from the Department of Information Technology, ISSN 1404-5117 ; 2019-004
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:uu:diva-392411OAI: oai:DiVA.org:uu-392411DiVA, id: diva2:1348166
Supervisors
Available from: 2019-09-03 Created: 2019-09-03 Last updated: 2019-09-03Bibliographically approved
List of papers
1. Comparing node degrees in probabilistic networks
Open this publication in new window or tab >>Comparing node degrees in probabilistic networks
2019 (English)In: Journal of Complex Networks, E-ISSN 2051-1329, Vol. 7Article in journal (Refereed) Epub ahead of print
National Category
Computer Sciences
Identifiers
urn:nbn:se:uu:diva-392384 (URN)10.1093/comnet/cnz003 (DOI)
Available from: 2019-02-23 Created: 2019-09-03 Last updated: 2019-09-03Bibliographically approved
2. Defining and measuring probabilistic ego networks
Open this publication in new window or tab >>Defining and measuring probabilistic ego networks
2019 (English)In: Applied Network Science Journal, E-ISSN 2364-8228Article in journal (Other academic) Submitted
National Category
Computer Sciences
Identifiers
urn:nbn:se:uu:diva-392404 (URN)
Available from: 2019-06-16 Created: 2019-09-03 Last updated: 2019-09-03Bibliographically approved

Open Access in DiVA

fulltext(3455 kB)14 downloads
File information
File name FULLTEXT01.pdfFile size 3455 kBChecksum SHA-512
8b91a8f2c96ad05364f36ecb69877d58896e76ffb748d6c1d778cfe782d6079c00dfd79f7e8db0f30f3cbe5551ea8150d88090db75106efc8c26e45a21f39250
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Kaveh, Amin
By organisation
Division of Computing ScienceComputing Science
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 14 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: 86 hits
CiteExportLink to record
Permanent link

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