Random recursion

dc.contributor.advisorHoffman, Christopher
dc.contributor.authorJunge, Matthew S.
dc.date.accessioned2016-07-14T16:43:21Z
dc.date.available2016-07-14T16:43:21Z
dc.date.issued2016-07-14
dc.date.submitted2016-06
dc.descriptionThesis (Ph.D.)--University of Washington, 2016-06
dc.description.abstractWe study the limiting behavior of three stochastic processes. Two are interacting particle systems, the frog model and coalescing random walk. We work out transience and recurrence properties on various graphs. The last is an interval splitting algorithm, which is shown to be equidistributed in the limit. Many of the proofs hinge on recursive equations of random variables.
dc.embargo.termsOpen Access
dc.format.mimetypeapplication/pdf
dc.identifier.otherJunge_washington_0250E_15699.pdf
dc.identifier.urihttp://hdl.handle.net/1773/36755
dc.language.isoen_US
dc.subjectprobability
dc.subjectrandom walk
dc.subject.otherMathematics
dc.subject.othermathematics
dc.titleRandom recursion
dc.typeThesis

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Junge_washington_0250E_15699.pdf
Size:
1000.6 KB
Format:
Adobe Portable Document Format

Collections