Javascript must be enabled for the correct page display

Approximation of homogeneous networks using Exponential Random Graph Models

Ceoldo, Giacomo (2018) Approximation of homogeneous networks using Exponential Random Graph Models. Master's Thesis / Essay, Mathematics.

[img]
Preview
Text
mMATH_2018_CeoldoG.pdf

Download (574kB) | Preview
[img] Text
Toestemming.pdf
Restricted to Registered users only

Download (94kB)

Abstract

Every homogeneous network can be approximated by an Exponential Random Graph Model with sufficient statistics that depends on the eigenvalue distribution, the main result is the computation of the relative entropy between the real and approximating model

Item Type: Thesis (Master's Thesis / Essay)
Supervisor name: Wit, E.C.
Degree programme: Mathematics
Thesis type: Master's Thesis / Essay
Language: English
Date Deposited: 14 Jul 2018
Last Modified: 02 Aug 2018 10:57
URI: https://fse.studenttheses.ub.rug.nl/id/eprint/17882

Actions (login required)

View Item View Item