Exact Computation of Percolation Cluster Sizes in Finite Networks

Show simple item record

dc.contributor Klemm, Konstantin
dc.contributor.author Pont Serra, Joan
dc.date 2017
dc.date.accessioned 2018-06-04T12:56:12Z
dc.date.issued 2018-06-04
dc.identifier.uri http://hdl.handle.net/11201/146617
dc.description.abstract [eng] Bond percolation in real networks is a well known problem of statistical physics with many applications from epidemic spreading to network robustness analysis. In particular, we focus on the design of a new algorithm for the computation of exact values of the percolation estimates. Due to the scaling of the possible number of configurations of the percolation process with the network size, there has been a huge emphasis on the computation of these estimates using approximations or Monte-Carlo methods instead of the search of an exact solution. We have used equivalence relations in the nodes set called Cluster Constellations (CC) in order to reduce the complexity in the description of the percolation configurations. An algorithm which uses these equivalence relations has been implemented in order to obtain exact percolation quantities. For certain networks of interest including the famous Karate Club Network we are able to compute exact expected cluster sizes for the first time. ca
dc.format application/pdf
dc.language.iso eng ca
dc.publisher Universitat de les Illes Balears
dc.rights info:eu-repo/semantics/openAccess
dc.rights all rights reserved
dc.subject 53 - Física ca
dc.title Exact Computation of Percolation Cluster Sizes in Finite Networks ca
dc.type info:eu-repo/semantics/masterThesis ca
dc.type info:eu-repo/semantics/publishedVersion
dc.date.updated 2018-05-30T12:10:58Z
dc.date.embargoEndDate info:eu-repo/date/embargoEnd/2050-01-01
dc.embargo 2050-01-01
dc.rights.accessRights info:eu-repo/semantics/embargoedAccess

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Repository

Advanced Search


My Account