Bounded infinite graphs are defined on the basis of natural physical requirements. When specialized to trees, this definition leads to a natural conjecture that the average connectivity dimension of bounded trees cannot exceed two. We verify that this bound is saturated by a class of random trees, in which case we also derive explicit expressions for the growth probabilities.
Destri, C., Donetti, L. (2002). On the growth of bounded trees. JOURNAL OF PHYSICS. A, MATHEMATICAL AND GENERAL, 35(25), 5147-5163 [10.1088/0305-4470/35/25/301].
On the growth of bounded trees
DESTRI, CLAUDIO;
2002
Abstract
Bounded infinite graphs are defined on the basis of natural physical requirements. When specialized to trees, this definition leads to a natural conjecture that the average connectivity dimension of bounded trees cannot exceed two. We verify that this bound is saturated by a class of random trees, in which case we also derive explicit expressions for the growth probabilities.
File in 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.
