| dc.contributor | Universidade Estadual Paulista (UNESP) | |
| dc.creator | Gerdy, Jim | |
| dc.date | 2013-09-25T18:10:37Z | |
| dc.date | 2013-09-25T18:10:37Z | |
| dc.date | 2013-09-25 | |
| dc.date.accessioned | 2017-04-05T18:52:55Z | |
| dc.date.available | 2017-04-05T18:52:55Z | |
| dc.identifier | http://acervodigital.unesp.br/handle/unesp/69630 | |
| dc.identifier | http://objetoseducacionais2.mec.gov.br/handle/mec/23710 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/847177 | |
| dc.description | Ensino Médio::Matemática | |
| dc.description | This Demonstration expands on a graphical study of nearest neighbors to look at the statistics of the number of connections. (The original Demonstration, "Nearest Neighbor Networks", looked at a process of connecting nearest neighbors and successively more removed neighbors on an assortment of points in 2D.) The parameter settings specify the number of connections to make from each point to its nearest neighbors and possibly to further neighbors. The first control is for the number of points. The second control is for the neighbor connections in the dot and stick visualization, while the third slider specifies the maximum of a range of neighbor connections over which to explore in the bottom plots. Note that while the parameter set specifies connections from each point to a certain number of neighbors, the result is more complex, with some points connected multiply as back-and-forth connections accumulate, so that clusters of connections form | |
| dc.publisher | Wolfram Demonstration Project | |
| dc.relation | NearestNeighborGraphConnections.nbp | |
| dc.rights | Demonstration freeware using MathematicaPlayer | |
| dc.subject | Random processes | |
| dc.subject | Educação Básica::Ensino Médio::Matemática::Análise de dados e probabilidade | |
| dc.title | Nearest neighbor graph connections | |
| dc.type | Software | |
