Abstract
Fractal worlds with limited connectivity are the topological result of growing graphs from chaotic series. We show how this model presents original characteristics which cannot be detected by means of the standard network descriptors. In detail, intrinsic inaccessibility to the fully connected configuration is demonstrated to be a universal feature associated with this family of graphs and strictly related to the fractality of a specific “chaotic source”. Here we discuss the potential of our model to be a generator of fractal graphs and also a self-consistent tool for differentiating chaotic dynamics from stochastic processes.
Sign-in/Register to access full text options 
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.
