Cascading behavior in infinite networks

dc.contributor	Graduate Program in Mathematics.
dc.contributor.advisor	Eden, Alp,
dc.contributor.author	Özdemir, Alperen Yaşar.
dc.date.accessioned	2023-03-16T11:21:38Z
dc.date.available	2023-03-16T11:21:38Z
dc.date.issued	2012.
dc.identifier.other	MATH 2012 O84
dc.identifier.uri	http://digitalarchive.boun.edu.tr/handle/123456789/15266
dc.description.abstract	The aim of this master thesis is to analyze the underlying mathematical structure of the infinite network models of cascading behavior. Graph theoretical tools are essential to understand the structure of the network and game theoretical tools are employed for the dynamics of the model. It is tried to determine under what conditions on the structure of the graph or on the parameters of the game, cascading is possible. We also consider the optimization problem of choosing the initial set from which cascading behavior spreads through the network. For this purpose, we use the theory of submodular functions. Submodularity condition provides close approximations to the optimal value when the initial set is selected by Greedy Algorithm.
dc.format.extent	30 cm.
dc.publisher	Thesis (M.S.)-Bogazici University. Institute for Graduate Studies in Science and Engineering, 2012.
dc.subject.lcsh	Cascading style sheets.
dc.title	Cascading behavior in infinite networks
dc.format.pages	xi, 52 leaves ;