An efficient algorithm to generate random uncorrelated Euclidean distances: the random link model
Autor(a) principal: | |
---|---|
Data de Publicação: | 2006 |
Outros Autores: | |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Brazilian Journal of Physics |
Texto Completo: | http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0103-97332006000200017 |
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 <FONT FACE=Symbol>® ¥</FONT>, 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²). |
id |
SBF-2_9bdda733bca47c3b0b81d67eb6cfc8ef |
---|---|
oai_identifier_str |
oai:scielo:S0103-97332006000200017 |
network_acronym_str |
SBF-2 |
network_name_str |
Brazilian Journal of Physics |
repository_id_str |
|
spelling |
An efficient algorithm to generate random uncorrelated Euclidean distances: the random link modelRandom mediaRandom point problemRandom link modelRandom-number generatorA 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 <FONT FACE=Symbol>® ¥</FONT>, 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²).Sociedade Brasileira de Física2006-03-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0103-97332006000200017Brazilian Journal of Physics v.36 n.1b 2006reponame:Brazilian Journal of Physicsinstname:Sociedade Brasileira de Física (SBF)instacron:SBF10.1590/S0103-97332006000200017info:eu-repo/semantics/openAccessTerçariol,César Augusto SangalettiMartinez,Alexandre Soutoeng2006-04-10T00:00:00Zoai:scielo:S0103-97332006000200017Revistahttp://www.sbfisica.org.br/v1/home/index.php/pt/ONGhttps://old.scielo.br/oai/scielo-oai.phpsbfisica@sbfisica.org.br||sbfisica@sbfisica.org.br1678-44480103-9733opendoar:2006-04-10T00:00Brazilian Journal of Physics - Sociedade Brasileira de Física (SBF)false |
dc.title.none.fl_str_mv |
An efficient algorithm to generate random uncorrelated Euclidean distances: the random link model |
title |
An efficient algorithm to generate random uncorrelated Euclidean distances: the random link model |
spellingShingle |
An efficient algorithm to generate random uncorrelated Euclidean distances: the random link model Terçariol,César Augusto Sangaletti Random media Random point problem Random link model Random-number generator |
title_short |
An efficient algorithm to generate random uncorrelated Euclidean distances: the random link model |
title_full |
An efficient algorithm to generate random uncorrelated Euclidean distances: the random link model |
title_fullStr |
An efficient algorithm to generate random uncorrelated Euclidean distances: the random link model |
title_full_unstemmed |
An efficient algorithm to generate random uncorrelated Euclidean distances: the random link model |
title_sort |
An efficient algorithm to generate random uncorrelated Euclidean distances: the random link model |
author |
Terçariol,César Augusto Sangaletti |
author_facet |
Terçariol,César Augusto Sangaletti Martinez,Alexandre Souto |
author_role |
author |
author2 |
Martinez,Alexandre Souto |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Terçariol,César Augusto Sangaletti Martinez,Alexandre Souto |
dc.subject.por.fl_str_mv |
Random media Random point problem Random link model Random-number generator |
topic |
Random media Random point problem Random link model Random-number generator |
description |
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 <FONT FACE=Symbol>® ¥</FONT>, 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²). |
publishDate |
2006 |
dc.date.none.fl_str_mv |
2006-03-01 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0103-97332006000200017 |
url |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0103-97332006000200017 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
10.1590/S0103-97332006000200017 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
text/html |
dc.publisher.none.fl_str_mv |
Sociedade Brasileira de Física |
publisher.none.fl_str_mv |
Sociedade Brasileira de Física |
dc.source.none.fl_str_mv |
Brazilian Journal of Physics v.36 n.1b 2006 reponame:Brazilian Journal of Physics instname:Sociedade Brasileira de Física (SBF) instacron:SBF |
instname_str |
Sociedade Brasileira de Física (SBF) |
instacron_str |
SBF |
institution |
SBF |
reponame_str |
Brazilian Journal of Physics |
collection |
Brazilian Journal of Physics |
repository.name.fl_str_mv |
Brazilian Journal of Physics - Sociedade Brasileira de Física (SBF) |
repository.mail.fl_str_mv |
sbfisica@sbfisica.org.br||sbfisica@sbfisica.org.br |
_version_ |
1754734862665777152 |