An efficient algorithm to generate large random uncorrelated Euclidean distances: the random link model

Physics – Condensed Matter – Disordered Systems and Neural Networks

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

8 pages, 2 figures and 1 table

Scientific paper

10.1590/S0103-97332006000200017

A disordered medium is often constructed by $N$ points independently and identically distributed in a $d$-dimensional hyperspace. Characteristics related to the statistics of this system is known as the random point problem. As $d \to \infty$, the distances between two points become independent random variables, leading to its mean field description: the random link model. While the numerical treatment of large random point problems pose no major difficulty, the same is not true for large random link systems due to Euclidean restrictions. Exploring the deterministic nature of the congruential pseudo-random number generators, we present techniques which allow the consideration of models with memory consumption of order O(N), instead of $O(N^2)$ in a naive implementation but with the same time dependence $O(N^2)$.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

An efficient algorithm to generate large random uncorrelated Euclidean distances: the random link model does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An efficient algorithm to generate large random uncorrelated Euclidean distances: the random link model, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An efficient algorithm to generate large random uncorrelated Euclidean distances: the random link model will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-194003

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.