Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userTransition from fractal to non-fractal scalings in growing scale-free networks
124
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Real networks can be classified into two categories: fractal networks and non-fractal networks. Here we introduce a unifying model for the two types of networks. Our model network is governed by a parameter $q$. We obtain the topological properties of the network including the degree distribution, average path length, diameter, fractal dimensions, and betweenness centrality distribution, which are controlled by parameter $q$. Interestingly, we show that by adjusting $q$, the networks undergo a transition from fractal to non-fractal scalings, and exhibit a crossover from `large to small worlds at the same time. Our research may shed some light on understanding the evolution and relationships of fractal and non-fractal networks.
rate research
Read More
It is generally accepted that scale-free networks is prone to epidemic spreading allowing the onset of large epidemics whatever the spreading rate of the infection. In the paper, we show that disease propagation may be suppressed in particular fractal scale-free networks. We first study analytically the topological characteristics of a network model and show that it is simultaneously scale-free, highly clustered, large-world, fractal and disassortative. Any previous model does not have all the properties as the one under consideration. Then, by using the renormalization group technique we analyze the dynamic susceptible-infected-removed (SIR) model for spreading of infections. Interestingly, we find the existence of an epidemic threshold, as compared to the usual epidemic behavior without a finite threshold in uncorrelated scale-free networks. This phenomenon indicates that degree distribution of scale-free networks does not suffice to characterize the epidemic dynamics on top of them. Our results may shed light in the understanding of the epidemics and other spreading phenomena on real-life networks with similar structural features as the considered model.
Self-similarity is a property of fractal structures, a concept introduced by Mandelbrot and one of the fundamental mathematical results of the 20th century. The importance of fractal geometry stems from the fact that these structures were recognized in numerous examples in Nature, from the coexistence of liquid/gas at the critical point of evaporation of water, to snowflakes, to the tortuous coastline of the Norwegian fjords, to the behavior of many complex systems such as economic data, or the complex patterns of human agglomeration. Here we review the recent advances in self-similarity of complex networks and its relation to transport, diffusion, percolations and other topological properties such us degree distribution, modularity, and degree-degree correlations.
We study the betweenness centrality of fractal and non-fractal scale-free network models as well as real networks. We show that the correlation between degree and betweenness centrality $C$ of nodes is much weaker in fractal network models compared to non-fractal models. We also show that nodes of both fractal and non-fractal scale-free networks have power law betweenness centrality distribution $P(C)sim C^{-delta}$. We find that for non-fractal scale-free networks $delta = 2$, and for fractal scale-free networks $delta = 2-1/d_{B}$, where $d_{B}$ is the dimension of the fractal network. We support these results by explicit calculations on four real networks: pharmaceutical firms (N=6776), yeast (N=1458), WWW (N=2526), and a sample of Internet network at AS level (N=20566), where $N$ is the number of nodes in the largest connected component of a network. We also study the crossover phenomenon from fractal to non-fractal networks upon adding random edges to a fractal network. We show that the crossover length $ell^{*}$, separating fractal and non-fractal regimes, scales with dimension $d_{B}$ of the network as $p^{-1/d_{B}}$, where $p$ is the density of random edges added to the network. We find that the correlation between degree and betweenness centrality increases with $p$.
We explore the concepts of self-similarity, dimensionality, and (multi)scaling in a new family of recursive scale-free nets that yield themselves to exact analysis through renormalization techniques. All nets in this family are self-similar and some are fractals - possessing a finite fractal dimension - while others are small world (their diameter grows logarithmically with their size) and are infinite-dimensional. We show how a useful measure of transfinite dimension may be defined and applied to the small world nets. Concerning multiscaling, we show how first-passage time for diffusion and resistance between hub (the most connected nodes) scale differently than for other nodes. Despite the different scalings, the Einstein relation between diffusion and conductivity holds separately for hubs and nodes. The transfinite exponents of small world nets obey Einstein relations analogous to those in fractal nets.
The evolution and spatial structure of displacement fronts in fractures with self-affine rough walls are studied by numerical simulations. The fractures are open and the two faces are identical but shifted along their mean plane, either parallel or perpendicular to the flow. An initially flat front advected by the flow is progressively distorted into a self-affine front with Hurst exponent equal to that of the fracture walls. The lower cutoff of the self-affine regime depends on the aperture and lateral shift, while the upper cutoff grows linearly with the width of the front.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
