- Are the Jhanas related to some of the 31 realms of existence
- Craft 3 Registration Form Success Redirect
- Assigning a new document to a cluster based on keywords extracted and tiff
- I have data with customer personal information and customer transaction. I cannot figure out how to use the data for training my model?
- sending dht11 sensor data to webserver(MySql db) via ESP8266 12E Module
- ultrasonic sensor on Arduino through the firmata protocol with python
- Arduino Mega hangs/freezes on opening COM port
- What is the difference using library of SoftwareSerial.h and ESP8266WiFi.h?
- Software to bulk upload and schedule videos to Facebook page?
- Alternative to Google's Play Store for Android
- How would humans with appropriate equipment navigate the surface of Saturn's moon Titan on foot?
- Blender closes with no error message 1-2 minutes after launching
- Change Blender 2.8 theme?
- How to get the Class of selected object in Blender 2.8?
- Why do the majority of probe requests captured have an invalid OUI in their MAC address?
- TCP errors explain
- What's the difference between “to subscribe to something” and “to agree with something”?
- “When applying on” or “applying to”
- meaning of the 'promotes begging as therefore desirable'
How to sample a lot of independent uniform spanning trees?
There are a bunch of good algorithms for sampling a uniform spanning tree from a graph $G$. For example, Aldous/Broder and Wilson's algorithm are pretty efficient. However, each of these graphs only samples one tree at a time.
I have a graph that I want to draw a lot of independent uniform spanning trees from, and I want to know if there is an useful preprocessing kind of step I can do that will make it easy to draw a large number of independent, uniform spanning trees.
Here is one approach: the spanning trees can be put into an efficient bijection with the sandpile group. This suggests that a fast way to generate a lot of random spanning trees by: 1) computing the decomposition of the sandpile group into a product of (hopefully small) Abelian groups 2) Fix a spanning tree T, and draw randomly from this product of abelian groups, and apply them to T. (This is discussed here: https://arxiv.org/pdf/1107.1313.pdf see 6.2)
Has anyone tried this? Are there other methods for