I am trying to implement the so called pivot algorithm for a markov chain monte carlo simulation of self avoiding random walks. There must be a simple method of checking to see if the pivoted portion of the random walk intersects with the previous section?
In other words I have a list of adjacent coordinates divided into two parts. I apply an orthogonal transformation to one part and I need to check if it intersects with the other part before accepting the transformation. I am able to do it with a messy nest of loops but there must be a more elegant solution that I am missing. Thanks Seth Latimer -- View this message in context: http://www.nabble.com/matching-coordinates-tf2664904.html#a7431888 Sent from the R help mailing list archive at Nabble.com. ______________________________________________ R-help@stat.math.ethz.ch mailing list https://stat.ethz.ch/mailman/listinfo/r-help PLEASE do read the posting guide http://www.R-project.org/posting-guide.html and provide commented, minimal, self-contained, reproducible code.
