We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Simplicial complex entropy.

Dantchev, Stefan and Ivrissimtzis, Ioannis (2017) 'Simplicial complex entropy.', in Mathematical methods for curves and surfaces : 9th International Conference, MMCS 2016, Tønsberg, Norway, June 23 - June 28, 2016. Revised selected papers. Cham: Springer, pp. 96-107. Lecture notes in computer science. (10521).


We propose an entropy function for simplicial complices. Its value gives the expected cost of the optimal encoding of sequences of vertices of the complex, when any two vertices belonging to the same simplex are indistinguishable. We focus on the computational properties of the entropy function, showing that it can be computed efficiently. Several examples over complices consisting of hundreds of simplices show that the proposed entropy function can be used in the analysis of large sequences of simplicial complices that often appear in computational topology applications.

Item Type:Book chapter
Full text:(AM) Accepted Manuscript
Download PDF
Publisher Web site:
Publisher statement:The final publication is available at Springer via
Date accepted:16 May 2017
Date deposited:15 May 2017
Date of first online publication:18 October 2017
Date first made open access:18 October 2018

Save or Share this output

Look up in GoogleScholar