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 “"random walks on graphs"”.
-
Faster generation of random spanning trees
… algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is within a multiplicative (1+6) of uniform in expected time ... . This improves the sparse graph case of the best previously known worst-case bound of …
-
Networked interactions, graphical models and econometrics perspectives in data analysis
… parts. In Part I, we study higher-order interactions in both graphical models and networks, i.e., interactions between more than two nodes. In the graphical model setting, we do not assume that interactions are known and our goal is to recover the structure of the graph. Our main contribution is …
-
Random Walks with Pheromone
In this thesis we are interested in random walks on graphs where transition probabilities from each vertex depend on values of a function, f, at neighboring nodes. The work is motivated by applications that arise in bio-inspired models wherein questions of dynamics are effected by pheromone trails. …
-
Reciprocal classes of continuous time Markov Chains
… reciprocal classes of Markov chains. Given a continuous time Markov chain on a countable state space, acting as reference dynamics, the associated reciprocal class is the set of all probability measures on path space that can be written as a mixture of its bridges. These processes possess a …