Mathematica 9 is now available
Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2007
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2007

[Date Index] [Thread Index] [Author Index]

Search the Archive

Combinatorics -- Random spanning trees.

  • To: mathgroup at smc.vnet.net
  • Subject: [mg72928] Combinatorics -- Random spanning trees.
  • From: "Diamond, Mark" <dot at dot.dot>
  • Date: Thu, 25 Jan 2007 07:27:33 -0500 (EST)

I wondered if anyone had implemented Wilson's algorithm for generating 
random spanning trees of undirected graphs. If so, I'd very much like to see 
how it was done. It's easy enough to use Combinatorica to assign random 
weightings to the edges of the graph and then find a MinimalSpanningTree, 
but I think that the other approach would be much faster.

-------------
Mark R. Diamond 



  • Prev by Date: Re: 2D interpolation
  • Next by Date: RE: Re: how to quickly read a >10MB big file
  • Previous by thread: Re: Zeroes of Zeta function
  • Next by thread: Error bars for 3D graphics?