Summary
In many cases complex systems are mapped onto more simple systems with the only criteria of the nearest neighbor distribution similitude. Some of these simplified systems are coalescing and interacting random walk, another common simplification is the independent interval approximation. However, we found that the nearest neighbor distribution does not contain enough information about the statistics of the system: several different systems could share the same nearest neighbor distribution.
Mathematics Subject Classification (2000)
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
González D, Téllez G (2007) Phys. Rev. E 76:011126.
Mettetal J, Schmittmann B, Zia R (2002) Europhysics Lett. 58:653–659.
Cornell S, Bray A (1996) Phys. Rev. E 54:1153–1160.
Spirin V, Krapivsky P, Redner S (1999) Phys. Rev. E 60:2670–2676.
Mehta M (1991) Random matrices 2ed. Academic press.
Alemany P, ben-Avraham D (1995) Phys. Lett. A 206:18–25.
Derrida B, Hakim V and Zeitak R (1996) Phys. Rev. Lett. 77:2871–2874.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
González, D.L., Téllez, G. (2009). Is the Nearest Neighbor Distribution Enough to Describe the Statistical Behavior of a Domain System?. In: Appert-Rolland, C., Chevoir, F., Gondret, P., Lassarre, S., Lebacque, JP., Schreckenberg, M. (eds) Traffic and Granular Flow ’07. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77074-9_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-77074-9_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77073-2
Online ISBN: 978-3-540-77074-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)