Branching random walk and probability problems from physics and biology Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/0c483m66m

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • This thesis studies connections between disorder type in tree polymers and the branching random walk and presents an application to swarm site-selection. Chapter two extends results on tree polymers in the infinite volume limit to critical strong disorder. Almost sure (a.s.) convergence in the infinite volume limit is obtained for weak disorder by standard theory on multiplicative cascades or the branching random walk. Chapter three establishes results for a simple branching random walk in connection with a related tree polymer. A central limit theorem (CLT) is shown to hold regardless of polymer disorder type, and a.s. connectivity of the support is established in the asymmetric case. Chapter four contains a model for site-selection in honeybee swarms. Simulations demonstrate a trade-off between speed and accuracy, and strongly suggest that increasing the quorum threshold at which the process terminates usually improves decision performance.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Keyword
Subject
Rights Statement
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Made available in DSpace on 2012-06-27T20:47:14Z (GMT). No. of bitstreams: 3 JohnsonTorreyA2012.pdf: 706979 bytes, checksum: 34cc2282be34f3e7025678dd955e8667 (MD5) license_rdf: 19965 bytes, checksum: 225316337756db2af069c3edfe03a49f (MD5) license_text: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2012-06-07
  • description.provenance : Approved for entry into archive by Julie Kurtz(julie.kurtz@oregonstate.edu) on 2012-06-23T21:35:42Z (GMT) No. of bitstreams: 3 JohnsonTorreyA2012.pdf: 706979 bytes, checksum: 34cc2282be34f3e7025678dd955e8667 (MD5) license_rdf: 19965 bytes, checksum: 225316337756db2af069c3edfe03a49f (MD5) license_text: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
  • description.provenance : Submitted by Torrey Johnson (johntorr@onid.orst.edu) on 2012-06-15T00:36:01Z No. of bitstreams: 3 JohnsonTorreyA2012.pdf: 706979 bytes, checksum: 34cc2282be34f3e7025678dd955e8667 (MD5) license_rdf: 19965 bytes, checksum: 225316337756db2af069c3edfe03a49f (MD5) license_text: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
  • description.provenance : Approved for entry into archive by Laura Wilson(laura.wilson@oregonstate.edu) on 2012-06-27T20:47:14Z (GMT) No. of bitstreams: 3 JohnsonTorreyA2012.pdf: 706979 bytes, checksum: 34cc2282be34f3e7025678dd955e8667 (MD5) license_rdf: 19965 bytes, checksum: 225316337756db2af069c3edfe03a49f (MD5) license_text: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)

Relationships

In Administrative Set:
Last modified: 08/03/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items