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 spanning trees"”.
-
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 …
-
Fast spectral primitives for directed graphs
… diagonally dominant matrix and for sampling random spanning trees from a graph. --
-
FAST LEARNING ON GRAPHS
We carry out a systematic study of classification problems on networked data, presenting novel techniques with good performance both in theory and in practice. We assess the power of node classification based on class-linkage information only. In particular, we propose four new algorithms that …
-
Design und Analyse stochastischer Algorithmen auf kombinatorischen Strukturen
In der vorliegenden Arbeit werden randomisierte Algorithmen, basierend auf ergodischen Markov-Ketten, konstruiert und analysiert. Die Grundräume dieser Markov-Ketten sind endliche Mengen kombinatorischer Strukturen, wie zum Beispiel die aufspannenden Bäume eines Graphen, die eulerschen …