Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 4 of 4 for “"Coalescing random walks"”.
-
High-Order and Coalescing Random Walks on Networks: Theory and Applications
Random walks are a useful tool both for studying structural and dynamic properties of networks and for building algorithms to mine information from the given network data. This dissertation discusses two topics on random walks on networks. The first is properties of a second-order random walk …
-
On the convergence of the Drainage Network Model with branching
Systems of coalescing random walks have been object of extensive studies, with applications in many areas. The Drainage Network is a system of coalescing random walks that have dependence before coalescence, introduced by Gangopadhyay, Roy and Sarkar in 2004. Few years later, in 2009, Coletti, …
-
Selection in a spatially structured population
… from the population behaves as a system of random walks that coalesce upon meeting. Backwards in time, each ancestral lineage jumps, at the time of its birth, to the location of its parent, and whenever two ancestral lineages have the same parent they jump to the same location and coalesce. …
-
Fractional Brownian motion, heavy tails, and coalescence: a random walk approach
Random walks are ubiquitous. They are of interest in and of themselves and as the driving randomness controlling other processes. Vanilla random walks with finite variance and independent increments have Brownian motion scaling limits, but more exotic random walks can give fractional Brownian …