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

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.