scientific article; zbMATH DE number 1256746
From MaRDI portal
Publication:4228482
A new algorithm for generating random spanning trees is given that works for both undirected and directed graphs. The algorithm is compared to alternative algorithms presented in previous work and it is shown to be usually much faster. For the entire collection see [Zbl 0908.00030].
Recommendations
Cited in
(only showing first 100 items - show all)- Choosing a random spanning subtree: A case study
- Scaling limits of loop-erased random walks and uniform spanning trees
- On Brownian motion, simple paths, and loops
- Probabilistic frequent subtrees for efficient graph classification and retrieval
- Imaginary geometry. IV: Interior rays, whole-plane reversibility, and space-filling trees
- A proof of the transfer-current theorem in absence of reversibility
- Growth exponent for loop-erased random walk in three dimensions
- Topics in loop measures and the loop-erased walk
- Random forests and networks analysis
- The height fluctuations of an off-critical dimer model on the square grid
- Sandpile models
- SLE as a mating of trees in Euclidean geometry
- Two applications of random spanning forests
- Conformal invariance of planar loop-erased random walks and uniform spanning trees.
- Determinantal probability measures
- Girsanov's transformation for \(\text{SLE}(\kappa,\rho)\) processes, intersection exponents and hiding exponents.
- Hölder regularity and dimension bounds for random curves
- Approximate and exact solutions of intertwining equations through random spanning forests
- Counting trees with random walks
- SLE and Virasoro representations: fusion
- Induced graphs of uniform spanning forests
- Partitioning a graph into balanced connected classes: formulations, separation and experiments
- External diffusion-limited aggregation on a spanning-tree-weighted random planar map
- A reverse Aldous-Broder algorithm
- Random walks with local memory
- Quenched and averaged tails of the heat kernel of the two-dimensional uniform spanning tree
- Prevalence expansion in NIMFA
- Scaling limits of the three-dimensional uniform spanning tree and associated random walk
- The free uniform spanning forest is disconnected in some virtually free groups, depending on the generator set
- The Hölder continuity of the scaling limit of three-dimensional loop-erased random walk
- Connectedness of the free uniform spanning forest as a function of edge weights
- The number of spanning clusters of the uniform spanning tree in three dimensions
- Spatial networks and percolation. Abstracts from the workshop held January 17--23, 2021 (hybrid meeting)
- Local geometry of the rough-smooth interface in the two-periodic Aztec diamond
- Loop-erased partitioning of a graph: mean-field analysis
- Mean-field avalanche size exponent for sandpiles on Galton-Watson trees
- Boundary correlations in planar LERW and UST
- Four-dimensional loop-erased random walk
- UST branches, martingales, and multiple SLE(2)
- Spectral decimation of the magnetic Laplacian on the Sierpinski gasket: solving the Hofstadter-Sierpinski butterfly
- Asymptotic height distribution in high-dimensional sandpiles
- Local limits of uniform triangulations in high genus
- The component graph of the uniform spanning forest: transitions in dimensions \(9,10,11,\ldots\)
- One-point function estimates for loop-erased random walk in three dimensions
- Universality of high-dimensional spanning forests and sandpiles
- Intertwining wavelets or multiresolution analysis on graphs through random forests
- On Markovian random networks
- Hyperbolic and parabolic unimodular random maps
- Linking and cutting spanning trees
- How quickly can we sample a uniform domino tiling of the \(2L\times 2L\) square via Glauber dynamics?
- Asymptotics of height change on toroidal Temperleyan dimer models
- Lozenge tilings, Glauber dynamics and macroscopic shape
- Indistinguishability of trees in uniform spanning forests
- The loop-erased random walk and the uniform spanning tree on the four-dimensional discrete torus
- Probabilistic and exact frequent subtree mining in graphs beyond forests
- The scaling limit of loop-erased random walk in three dimensions
- Infinite volume limit of the abelian sandpile model in dimensions \(d \geq 3\)
- Uniqueness of maximal entropy measure on essential spanning forests
- \(\text{SLE}(\kappa,\rho)\) martingales and duality
- Approaching criticality via the zero dissipation limit in the abelian avalanche model
- Loop-erased random walk on a torus in dimensions 4 and above
- Infinite volume limit for the stationary distribution of Abelian sandpile models
- Loop-erased random walk as a spin system observable
- The diameter of uniform spanning trees in high dimensions
- Random walks on mated-CRT planar maps and Liouville Brownian motion
- Loop-erased random walk branch of uniform spanning tree in topological polygons
- Learning about critical phenomena from scribbles and sandpiles
- CoEulerian graphs
- Generating random spanning trees via fast matrix multiplication
- Abelian networks. I: Foundations and examples
- Loop measures and the Gaussian free field
- History dependent quantum random walks as quantum lattice gas automata
- New algorithm for generation of spanning trees
- Logarithmic fluctuations for internal DLA
- Fundamental constants in the theory of two-dimensional uniform spanning trees
- Application of a generalized Sherman-Morrison formula to the computation of network Green's functions and the construction of spanning trees
- Schramm's formula for multiple loop-erased random walks
- Generating random combinatorial objects
- Hitting matrix and domino tiling with diagonal impurities
- Stochastic Löwner evolution and the scaling limit of critical models
- How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
- Scaling limits and the Schramm-Loewner evolution
- A conformally invariant growth process of SLE excursions
- Random walk problems motivated by statistical physics
- scientific article; zbMATH DE number 1369841 (Why is no real title available?)
- Fast sequential importance sampling to estimate the graph reliability polynomial
- scientific article; zbMATH DE number 871943 (Why is no real title available?)
- Sampling random spanning trees faster than matrix multiplication
- Infinite-step stationarity of rotor walk and the wired spanning forest
- Approximately counting bases of bicircular matroids
- scientific article; zbMATH DE number 7375995 (Why is no real title available?)
- Normal approximation for functions of hidden Markov models
- The local weak limit of \(k\)-dimensional hypertrees
- Toppling and height probabilities in sandpiles
- Uniform spanning forests of planar graphs
- Bayesian space-time partitioning by sampling and pruning spanning trees
- Speeding up non-Markovian first-passage percolation with a few extra edges
- The Z-invariant massive Laplacian on isoradial graphs
- An almost-linear time algorithm for uniform random spanning tree generation
- A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228482)
