2015
DOI: 10.48550/arxiv.1503.08583
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Hierarchical Random Graphs Based on Motifs

Abstract: Network motifs are characteristic patterns which occur in the networks essentially more frequently than the other patterns. For five motifs found in S. Itzkovitz, U. Alon, Phys.Rev. E, 2005, 71, 026117-1, hierarchical random graph models are proposed in which the motifs appear at each hierarchical level. A rigorous construction of such graphs is performed and a number of their structural properties are analyzed. This includes degree distribution, amenability, clustering, and the small world property. For one o… Show more

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 27 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?