Chip-firing games on graphs

dc.rights.license	CC-BY-NC-ND
dc.contributor.advisor	Karemaker, Dr. V.
dc.contributor.advisor	van der Wegen, Dr. M.
dc.contributor.author	Vink, R.
dc.date.accessioned	2021-09-07T18:02:19Z
dc.date.available	2021-09-07T18:02:19Z
dc.date.issued	2021
dc.identifier.uri	https://studenttheses.uu.nl/handle/20.500.12932/1163
dc.description.abstract	This thesis is based on chip-firing games as discussed in the following papers: - Chip-firing, potential theory, spanning trees - Baker, Shokrieh - Chipfiring games on graphs – Bjorner - Chipfiring games on directed graphs – Bjorner - Signed chipfiring games on weighted graphs - J.-H. Park These papers (and others) will be used to find answers to a few questions regarding chip-firing games. How do they work? Can we encapsulate them in a nice mathematical structure? Can we find efficient algorithms to determine equivalence classes? How are chipfiring games connected to spanning trees?
dc.description.sponsorship	Utrecht University
dc.format.extent	661298
dc.format.mimetype	application/pdf
dc.language.iso	en
dc.title	Chip-firing games on graphs
dc.type.content	Bachelor Thesis
dc.rights.accessrights	Open Access
dc.subject.courseuu	Wiskunde