Graphs and concepts of entropy for studying disorder in d-dimensional distributions of points

Armin Loeffler and Monique Rasigni

Physica A: Statistical Mechanics and its Applications, 2000, vol. 276, issue 3, 535-549

Abstract: Graph theory and entropy concepts are used to retrieve and quantify information in dD-sets of points. In this approach, each disordered set of points is assigned a graph which is considered as a probe that gives access to some information typical of the kind of graph chosen. It is shown that this information can be quantified by means of Kullback–Leibler's entropy as pertaining to graph edge-length distributions. This relative entropy uses the edge-length distribution of graphs constructed from independently and uniformly distributed points as reference.

Keywords: Point patterns; Graphs; Entropy; Disorder (search for similar items in EconPapers)
Date: 2000
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437199004616
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:276:y:2000:i:3:p:535-549

DOI: 10.1016/S0378-4371(99)00461-6

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().