Displaying similar documents to “Cutwidth of iterated caterpillars”

The triangles method to build -trees from incomplete distance matrices

Alain Guénoche, Bruno Leclerc (2010)

RAIRO - Operations Research

Similarity:

A method to infer -trees (valued trees having as set of leaves) from incomplete distance arrays (where some entries are uncertain or unknown) is described. It allows us to build an unrooted tree using only 2-3 distance values between the elements of , if they fulfill some explicit conditions. This construction is based on the mapping between -tree and a weighted generalized 2-tree spanning .

Asymptotic equipartition properties for simple hierarchical and networked structures

Kwabena Doku-Amponsah (2012)

ESAIM: Probability and Statistics

Similarity:

We prove for simple hierarchical structures (modelled as ) and networked structures (modelled as ). For example, for large , a networked data structure consisting of units connected by an average number of links of order   log  can be coded by about  ×  bits, where is an explicitly defined entropy. The main technique in our proofs are large deviation principles for suitably defined empirical measures.

Asymptotic equipartition properties for simple hierarchical and networked structures

Kwabena Doku-Amponsah (2012)

ESAIM: Probability and Statistics

Similarity:

We prove for simple hierarchical structures (modelled as ) and networked structures (modelled as ). For example, for large , a networked data structure consisting of units connected by an average number of links of order   log  can be coded by about  ×  bits, where is an explicitly defined entropy. The main technique in our proofs are large deviation principles for suitably defined empirical measures.