Abstract
In this paper, given an initial directed graph as a self-similar pattern and fix two nodes in the pattern, we can iterate the graph by replacing any directed edge with the initial graph of pattern and identifying the fixed nodes of pattern with the endpoints of directed edge. Using the iteration again and again, we obtain a family of growing self-similar networks. Modify these networks to be undirected ones, we obtain growing self-similar undirected networks. We obtain the fractality of our self-similar networks and find out the scale-free effect in terms of the matrix related to two fixed nodes in the initial graph.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Physica A: Statistical Mechanics and its Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
