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 9 of 9 for “"spanning forest"”.
-
Applications of a Novel Sampling Technique to Fully Dynamic Graph Algorithms
… distributed algorithm for maintaining a spanning forest in a fully-dynamic synchronous network. Our algorithm maintains a spanning forest of a graph with $n$ nodes, with worst case message complexity $\tilde{O}(n)$ per edge insertion or deletion where messages are of size …
-
A Walk through the Forest: the Geometry and Topology of Random Systems
… geometry and topology of random walks and random forests, with analysis of the latter of these random systems often relying on analysis of the former and vice versa. The main models we consider are the static and dynamic random conductance models, the uniform spanning forest, the arboreal gas and …
-
Density-based clustering of information networks by substructure optimization
… DBC method involves constructing a maximal spanning forest (MSF) and deleting edges having weights below a threshold, leaving the connected components as clusters. In large networks, the data may contain large scale variances in the noise density level, which causes the baseline method to …
-
High Performance Issues on Parallel Architectures
… optimal algorithms for graph properties such as spanning forest bipartiteness, fundamental cycles, bridges and biconnected components. Other optimal algorithms for the more complex least common ancestor and the connected component problems are also presented. By design, all algorithms maintain …
-
Algorithms for connectivity problems in undirected graphs : maximum flow and minimun [kappa]-way cut.
… first method sparsifies unused edges by using a spanning forest. It is deterministic and takes ... time per path on average. The second method sparsifies the entire residual graph by taking random samples of the edges. It takes O(n) time per path on average. These results let us improve the O(mv) …
-
Group-invariant random processes
… that are adjacent to the other cluster. Minimal spanning trees on infinite graphs are important because of their close connection to Bernoulli percolation. We show that all the trees in the free minimal spanning forest of an infinite transitive unimodular graph have the same number of ends almost …
-
Superprobability on Graphs
… arboreal gas. This is a model of unrooted random forests on a graph, where the probability of a forest $F$ with $|F|$ edges is multiplicatively weighted by a parameter $\beta^{|F|} > 0$. In simple terms, it can be defined to be Bernoulli bond percolation with parameter $p = \frac{\beta}{1 + …
-
Topics in Probabilistic Combinatorics
… the opposite problem, seeking a copy of a spanning forest of fixed isomorphic class with a close-to-balanced colouring. We prove that given any forest $F$ of order $n$ and maximum degree $\Delta$, and a balanced 2-colouring of the edges of $K_n$, then one can find an embedding of $F$ into …
-
Conditional Stein’s method and maximal spanning forests
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-09-01 without embargo terms