Jong, F. de (2017) Thesis: Distributed graph parameter computation in finite time. Bachelor's Thesis, Mathematics.
|
Text
BSC_Math_2017_deJong_F.pdf - Published Version Download (378kB) | Preview |
|
![[img]](https://fse.studenttheses.ub.rug.nl/style/images/fileicons/text.png) |
Text
Toestemming.pdf - Other Restricted to Backend only Download (78kB) |
Abstract
This project is about computing graph parameters of a directed graph in a distributed way and in finite time. Graph parameters can be used for the analysis of the underlying structure of a network. We will consider the following parameters: the left-eigenvector, the out-degree, and the spectrum. The left-eigenvector is often used for determining the final state of components of a network and can also be used to compute other parameters. The out-degree is important for the analysis on the out-neighbourhood of each node. The spectrum gives much information regarding the structure of a network and can be used for acceleration of computations. The key point of this project is that we want to compute the parameters in a distributed way.
| Item Type: | Thesis (Bachelor's Thesis) |
|---|---|
| Degree programme: | Mathematics |
| Thesis type: | Bachelor's Thesis |
| Language: | English |
| Date Deposited: | 15 Feb 2018 08:30 |
| Last Modified: | 15 Feb 2018 08:30 |
| URI: | https://fse.studenttheses.ub.rug.nl/id/eprint/15492 |
Actions (login required)
 |
View Item |