Show simple item record

dc.rights.licenseUsers may download and share copies with attribution in accordance with a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License. No commercial use or derivatives are permitted without the explicit approval of the author.
dc.contributorKramer, Peter Roland, 1971-
dc.contributorHolmes, Mark H.
dc.contributorLai, W. Michael, 1930-
dc.contributorKorniss, Gyorgy
dc.contributor.authorTreitman, Yosef
dc.date.accessioned2021-11-03T09:03:50Z
dc.date.available2021-11-03T09:03:50Z
dc.date.created2018-10-24T13:31:37Z
dc.date.issued2018-08
dc.identifier.urihttps://hdl.handle.net/20.500.13015/2254
dc.descriptionAugust 2018
dc.descriptionSchool of Science
dc.description.abstractWe make rather specific assumptions about the distribution of agents across the geographic map and the likelihood of any pair of them being adjacent. We assume that the agents are nearly evenly spaced across the network. More precisely, we assume that if a network of width $w$ were divided into $N$ equal intervals of width W/N each interval would contain exactly one agent. The location of each agent within its interval follows a uniform distribution. We assume that each agent can only be adjacent to other agents within some radius of influence r of itself with r << w. As the cascade propagates across the spatial network, it may spontaneously terminate. This property is not found in locally treelike networks. This work examines the likelihood of such a termination and accounts for that possibility when estimating the CDF of the final cascade size distribution.
dc.description.abstractThe approximation we develop is reasonably accurate for several response threshold distributions. Previous work already showed that, under these assumptions, the cascade will propagate at a constant overall speed. Our approach gets an estimate for that speed and the likelihood of spontaneous termination.
dc.description.abstractTo address the main challenge of the possibility of a finite-time extinction, we find the mean number of new activations per unit time and the likelihood of a spontaneous termination. These statistics can be estimated by viewing the number of new activations per unit time as a Markov chain. Given the number of activations at some time tau - 1, we can estimate the number of spikes sent to inactive agents. Given that number, we can estimate the number of activations at time tau. We assume that the number of new activations follows a Poisson distribution, and use our estimate as the mean. This gives us an approximate one-step probability transition matrix of the number of new activations from time tau - 1 to time tau. Using this matrix, we find the mean number of new activations and the extinction probability.
dc.description.abstractOver the past few decades, there has been considerable research on the spread of various phenomena across networks. While the most general case of the cascade problem on an arbitrary network is too broad a question to address, the question has been studied under specific simplifying assumptions, both on the construction of the network and on the rules for the spread and adoption of the cascading phenomenon. In paricular, we are interested in studying cascades under the widely-used Centola-Macy threshold model on a class of spatial networks. The spatial aspects of these networks present challenges not found in other networks.
dc.language.isoENG
dc.publisherRensselaer Polytechnic Institute, Troy, NY
dc.relation.ispartofRensselaer Theses and Dissertations Online Collection
dc.subjectApplied mathematics
dc.titlePredicting cascade size distribution on one-dimensional geographic networks
dc.typeElectronic thesis
dc.typeThesis
dc.digitool.pid179204
dc.digitool.pid179205
dc.digitool.pid179206
dc.rights.holderThis electronic version is a licensed copy owned by Rensselaer Polytechnic Institute, Troy, NY. Copyright of original work retained by author.
dc.description.degreePhD
dc.relation.departmentDept. of Mathematical Sciences


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record