If G is a finite, directed, simple and irreducible graph, deletion of an edge makes the entropy decrease. We give a proof of this fact that avoids the Perron-Frobenius theorem and makes use of a technique developed by Gromov. (C) 2002 Elsevier Science Ltd. All rights reserved.
On a lemma of Gromov and the entropy of a graph / Scarabotti, Fabio. - In: EUROPEAN JOURNAL OF COMBINATORICS. - ISSN 0195-6698. - STAMPA. - 23:5(2002), pp. 631-633. [10.1006/eujc.2002.0567]
On a lemma of Gromov and the entropy of a graph
SCARABOTTI, Fabio
2002
Abstract
If G is a finite, directed, simple and irreducible graph, deletion of an edge makes the entropy decrease. We give a proof of this fact that avoids the Perron-Frobenius theorem and makes use of a technique developed by Gromov. (C) 2002 Elsevier Science Ltd. All rights reserved.File allegati a questo prodotto
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
