Simple graphmodels of information spread in finite populations

dc.contributor.author	Voorhees, Burton	en_US
dc.contributor.author	Bergerud, Ryder	en_US
dc.date.accessioned	2016-06-25T01:57:24Z
dc.date.available	2016-06-25T01:57:24Z
dc.date.issued	2015	en_US
dc.identifier.other	HPU4160255	en_US
dc.identifier.uri	https://lib.hpu.edu.vn/handle/123456789/21759	en_US
dc.description.abstract	We consider several classes of simple graphs as potential models for information diffusion in a structured population. These include biases cycles, dual circular flows, partial bipartite graphs and what we call ‘single-link’ graphs. In addition to fixation probabilities, we study structure parameters for these graphs, including eigenvalues of the Laplacian, conductances, communicability and expected hitting times. In several cases, values of these parameters are related, most strongly so for partial bipartite graphs.	en_US
dc.format.extent	25 p.	en_US
dc.format.mimetype	application/pdf	en_US
dc.language.iso	en	en_US
dc.publisher	The Royal Society	en_US
dc.subject	Biology	en_US
dc.subject	Appliedmathematics	en_US
dc.subject	Mathematical	en_US
dc.subject	Modelling	en_US
dc.subject	Fixation	en_US
dc.subject	Probabilities	en_US
dc.title	Simple graphmodels of information spread in finite populations	en_US
dc.type	Book	en_US
dc.size	2.48MB	en_US
dc.department	Education	en_US