Abstract
In this paper, we consider the networks modeled by several self-affine sets based on the Bedford–Mcmullen carpet. We calculate three properties of the networks, including the cumulative degree distribution, the average clustering coefficient and the average path length. We show that such networks have scale-free and small-world effects.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
