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

AUTOR(ES)

Terçariol, César Augusto Sangaletti, Martinez, Alexandre Souto

FONTE

Brazilian Journal of Physics

DATA DE PUBLICAÇÃO

2006-03

RESUMO

A disordered medium is often constructed by N random points independently and identically distributed in a d-dimensional hyperspace. Characteristics related to the statistics of this system are known as the random point problem. As d ® ¥, 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 poses no major difficulty, due to Euclidean restrictions the same is not true for large random link systems. Exploring the deterministic nature of the pseudo-random number generators, we present techniques which allow to consider models with memory consumption of O(N), instead of O(N²) obtained by a naive implementation, but with the same time dependence O(N²).

Documentos Relacionados

• Covariant chronogeometry and extreme distances: Elementary particles
• An algorithm to generate low-resolution protein tertiary structures from knowledge of secondary structure.
• Accurate and robust phylogeny estimation based on profile distances: a study of the Chlorophyceae (Chlorophyta)
• An algorithm to generate all spanning trees of a graph in order of increasing cost
• Paralelização do algoritmo de geração de redes aleatórias contínuas por Simulated Annealing