2011 Fourth International Workshop on Chaos-Fractals Theories and Applications 2011
DOI: 10.1109/iwcfta.2011.98
|View full text |Cite
|
Sign up to set email alerts
|

The Analytical Solution of the Average Distance for Delayed Deterministic Recursive Trees

Abstract: On the basis of the recursive trees, we propose a kind of delayed recursive trees with the feature that not all the existing nodes produce new nodes in each evolving step. Using the solutions of difference equation, the analytical expression of the average distance is obtained. This family of delayed recursive trees exhibits small-world characteristics. In addition, the average distance of this delayed trees is smaller than that of the recursive trees.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 19 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?