Using Gromov-Wasserstein distance to explore sets of networks

dc.contributor.advisor	Zafra, Raul Vicente, juhendaja
dc.contributor.author	Hendrikson, Reigo
dc.contributor.other	Tartu Ülikool. Matemaatika ja statistika instituut	et
dc.contributor.other	Tartu Ülikool. Loodus- ja täppisteaduste valdkond.	et
dc.date.accessioned	2016-01-29T09:38:13Z
dc.date.available	2016-01-29T09:38:13Z
dc.date.issued	2016
dc.identifier.uri	http://hdl.handle.net/10062/50406
dc.description.abstract	In many fields such as social sciences or biology, relations between data or variables are presented as networks. To compare these networks, a meaningful notion of distance between networks is highly desired. The aim of this Master thesis is to study, implement, and apply one Gromov-Wasserstein type of distance introduced by F.Memoli (2011) in his paper "Gromov-Wasserstein Distances and the Metric Approach to Object Matching" to study sets of complex networks. Taking into account theoretical underpinnings introduced in this paper we represent some real world networks as metric measure spaces and compare them on basis of Gromov-Wasserstein distance.	en
dc.language.iso	en	en
dc.subject	kaugus	et
dc.subject	Gromov-Hausdorff	et
dc.subject	Gromov-Wasserstein	et
dc.subject	võrgustik	et
dc.subject	mõõduga meetriline ruum	et
dc.subject.other	distance	en
dc.subject.other	Gromov-Hausdorff	en
dc.subject.other	Gromov-Wasserstein	en
dc.subject.other	networks	en
dc.subject.other	metric measure space	en
dc.title	Using Gromov-Wasserstein distance to explore sets of networks	en
dc.type	Thesis	en

LTMS magistritööd -- Master's theses [150]
Matemaatika ja statistika instituudis kaitstud magistritööd