Models of random spanning trees
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 417855 (Why is no real title available?)
- scientific article; zbMATH DE number 4172924 (Why is no real title available?)
- scientific article; zbMATH DE number 3136270 (Why is no real title available?)
- scientific article; zbMATH DE number 3154265 (Why is no real title available?)
- scientific article; zbMATH DE number 1256746 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 3217478 (Why is no real title available?)
- Critical random graphs and the structure of a minimum spanning tree
- Independent random utility representations
- Log-concave polynomials. I: Entropy and a deterministic approximation algorithm for counting bases of matroids
- Log-concave polynomials. II: High-dimensional walks and an FPRAS for counting bases of a matroid
- Lyndon Words, Free Algebras and Shuffles
- Nontransitive random variables and nontransitive dice
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Probability on trees and networks
- Random graphs.
- The Paradox of Nontransitive Dice
- The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
- The scaling limits of the minimal spanning tree and invasion percolation in the plane
This page was built for publication: Models of random spanning trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7240418)