scientific article; zbMATH DE number 1256746
From MaRDI portal
Publication:4228482
zbMATH Open0946.60070MaRDI QIDQ4228482FDOQ4228482
Authors: David B. Wilson 
Publication date: 18 May 1999
Title of this publication is not available (Why is that?)
Recommendations
Computational methods in Markov chains (60J22) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cited In (only showing first 100 items - show all)
- Approximate and exact solutions of intertwining equations through random spanning forests
- Random walks with local memory
- A proof of the transfer-current theorem in absence of reversibility
- Spectral decimation of the magnetic Laplacian on the Sierpinski gasket: solving the Hofstadter-Sierpinski butterfly
- Asymptotic height distribution in high-dimensional sandpiles
- Linking and cutting spanning trees
- The diameter of the uniform spanning tree of dense graphs
- Local limits of uniform triangulations in high genus
- The number of spanning clusters of the uniform spanning tree in three dimensions
- Learning about critical phenomena from scribbles and sandpiles
- Boundary correlations in planar LERW and UST
- Geometry of Uniform Spanning Forest Components in High Dimensions
- Hyperbolic and parabolic unimodular random maps
- Uniform spanning forests of planar graphs
- Spatial networks and percolation. Abstracts from the workshop held January 17--23, 2021 (hybrid meeting)
- Approaching criticality via the zero dissipation limit in the abelian avalanche model
- Lozenge tilings, Glauber dynamics and macroscopic shape
- Perfect sampling from spatial mixing
- Local geometry of the rough-smooth interface in the two-periodic Aztec diamond
- SLE as a mating of trees in Euclidean geometry
- Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs
- Loop-erased partitioning of a graph: mean-field analysis
- Induced graphs of uniform spanning forests
- Partitioning a graph into balanced connected classes: formulations, separation and experiments
- Loop-erased random walk branch of uniform spanning tree in topological polygons
- UST branches, martingales, and multiple SLE(2)
- The component graph of the uniform spanning forest: transitions in dimensions \(9,10,11,\ldots\)
- Universality of high-dimensional spanning forests and sandpiles
- Topics in loop measures and the loop-erased walk
- Sampling random spanning trees faster than matrix multiplication
- Four-dimensional loop-erased random walk
- History dependent quantum random walks as quantum lattice gas automata
- The diameter of uniform spanning trees in high dimensions
- One-point function estimates for loop-erased random walk in three dimensions
- Mean-field avalanche size exponent for sandpiles on Galton-Watson trees
- Quenched and averaged tails of the heat kernel of the two-dimensional uniform spanning tree
- Random walks on mated-CRT planar maps and Liouville Brownian motion
- Toppling and height probabilities in sandpiles
- Indistinguishability of trees in uniform spanning forests
- Schramm's formula for multiple loop-erased random walks
- Prevalence expansion in NIMFA
- Scaling limits of the three-dimensional uniform spanning tree and associated random walk
- Growth exponent for loop-erased random walk in three dimensions
- Connectedness of the free uniform spanning forest as a function of edge weights
- The Hölder continuity of the scaling limit of three-dimensional loop-erased random walk
- New algorithm for generation of spanning trees
- The free uniform spanning forest is disconnected in some virtually free groups, depending on the generator set
- Fast generation of random spanning trees and the effective resistance metric
- Surprise probabilities in Markov chains
- An almost-linear time algorithm for uniform random spanning tree generation
- A reverse Aldous-Broder algorithm
- External diffusion-limited aggregation on a spanning-tree-weighted random planar map
- Random walk problems motivated by statistical physics
- Generating random combinatorial objects
- LERW as an example of off-critical SLEs
- The loop-erased random walk and the uniform spanning tree on the four-dimensional discrete torus
- Commutation relations for Schramm‐Loewner evolutions
- Hölder regularity and dimension bounds for random curves
- On Brownian motion, simple paths, and loops
- Normal approximation for functions of hidden Markov models
- Girsanov's transformation for \(\text{SLE}(\kappa,\rho)\) processes, intersection exponents and hiding exponents.
- Dimers, tilings and trees
- On the number of broadcast schemes in networks
- The height fluctuations of an off-critical dimer model on the square grid
- Conformal invariance and $2D$ statistical physics
- Sandpile models
- Duality of chordal SLE
- Counting trees with random walks
- The dimension of the SLE curves
- Scaling limits and the Schramm-Loewner evolution
- Scaling limits of loop-erased random walks and uniform spanning trees
- Infinite canonical super-Brownian motion and scaling limits
- Spectral dimension and random walks on the two dimensional uniform spanning tree
- Intertwining wavelets or multiresolution analysis on graphs through random forests
- Imaginary geometry. IV: Interior rays, whole-plane reversibility, and space-filling trees
- Ant colony optimization and the minimum spanning tree problem
- Conformal invariance of planar loop-erased random walks and uniform spanning trees.
- Determinantal probability measures
- Probabilistic frequent subtrees for efficient graph classification and retrieval
- Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on planar graphs
- Fundamental constants in the theory of two-dimensional uniform spanning trees
- A conformally invariant growth process of SLE excursions
- Approximately counting bases of bicircular matroids
- Logarithmic fluctuations for internal DLA
- Euler integrals for commuting SLEs
- Uniqueness of maximal entropy measure on essential spanning forests
- On Markovian random networks
- Loop measures and the Gaussian free field
- Probabilistic and exact frequent subtree mining in graphs beyond forests
- Exponential tail bounds for loop-erased random walk in two dimensions
- Dynamic Sampling from Graphical Models
- Random two-component spanning forests
- A combinatorial proof of Aldous–Broder theorem for general Markov chains
- Fast simulation of large-scale growth models
- \(\text{SLE}(\kappa,\rho)\) martingales and duality
- Models of random subtrees of a graph
- Fast sequential importance sampling to estimate the graph reliability polynomial
- Stochastic Löwner evolution and the scaling limit of critical models
- The scaling limit of loop-erased random walk in three dimensions
- Sequential Monte Carlo for Sampling Balanced and Compact Redistricting Plans
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)
