ترغب بنشر مسار تعليمي؟ اضغط هنا

Critical Phase in Complex Networks: a Numerical Study

421   0   0.0 ( 0 )
 نشر من قبل Takehisa Hasegawa
 تاريخ النشر 2014
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

We compare phase transition and critical phenomena of bond percolation on Euclidean lattices, nonamenable graphs, and complex networks. On a Euclidean lattice, percolation shows a phase transition between the nonpercolating phase and percolating phase at the critical point. The critical point is stretched to a finite region, called the critical phase, on nonamenable graphs. To investigate the critical phase, we introduce a fractal exponent, which characterizes a subextensive order of the system. We perform the Monte Carlo simulations for percolation on two nonamenable graphs - the binary tree and the enhanced binary tree. The former shows the nonpercolating phase and the critical phase, whereas the latter shows all three phases. We also examine the possibility of critical phase in complex networks. Our conjecture is that networks with a growth mechanism have only the critical phase and the percolating phase. We study percolation on a stochastically growing network with and without a preferential attachment mechanism, and a deterministically growing network, called the decorated flower, to show that the critical phase appears in those models. We provide a finite-size scaling by using the fractal exponent, which would be a powerful method for numerical analysis of the phase transition involving the critical phase.



قيم البحث

اقرأ أيضاً

Complex networks characterized by global transport processes rely on the presence of directed paths from input to output nodes and edges, which organize in characteristic linked components. The analysis of such network-spanning structures in the fram ework of percolation theory, and in particular the key role of edge interfaces bridging the communication between core and periphery, allow us to shed light on the structural properties of real and theoretical flow networks, and to define criteria and quantities to characterize their efficiency at the interplay between structure and functionality. In particular, it is possible to assess that an optimal flow network should look like a hairy ball, so to minimize bottleneck effects and the sensitivity to failures. Moreover, the thorough analysis of two real networks, the Internet customer-provider set of relationships at the autonomous system level and the nervous system of the worm Caenorhabditis elegans --that have been shaped by very different dynamics and in very different time-scales--, reveals that whereas biological evolution has selected a structure close to the optimal layout, market competition does not necessarily tend toward the most customer efficient architecture.
We study the effect of varying wiring in excitable random networks in which connection weights change with activity to mold local resistance or facilitation due to fatigue. Dynamic attractors, corresponding to patterns of activity, are then easily de stabilized according to three main modes, including one in which the activity shows chaotic hopping among the patterns. We describe phase transitions to this regime, and show a monotonous dependence of critical parameters on the heterogeneity of the wiring distribution. Such correlation between topology and functionality implies, in particular, that tasks which require unstable behavior --such as pattern recognition, family discrimination and categorization-- can be most efficiently performed on highly heterogeneous networks. It also follows a possible explanation for the abundance in nature of scale--free network topologies.
112 - Alex Arenas 2006
We investigate the connection between the dynamics of synchronization and the modularity on complex networks. Simulating the Kuramotos model in complex networks we determine patterns of meta-stability and calculate the modularity of the partition the se patterns provide. The results indicate that the more stable the patterns are, the larger tends to be the modularity of the partition defined by them. This correlation works pretty well in homogeneous networks (all nodes have similar connectivity) but fails when networks contain hubs, mainly because the modularity is never improved where isolated nodes appear, whereas in the synchronization process the characteristic of hubs is to have a large stability when forming its own community.
Although most networks in nature exhibit complex topology the origins of such complexity remains unclear. We introduce a model of a growing network of interacting agents in which each new agents membership to the network is determined by the agents e ffect on the networks global stability. It is shown that out of this stability constraint, scale free networks emerges in a self organized manner, offering an explanation for the ubiquity of complex topological properties observed in biological networks.
We review results on the scaling of the optimal path length in random networks with weighted links or nodes. In strong disorder we find that the length of the optimal path increases dramatically compared to the known small world result for the minimu m distance. For ErdH{o}s-Renyi (ER) and scale free networks (SF), with parameter $lambda$ ($lambda >3$), we find that the small-world nature is destroyed. We also find numerically that for weak disorder the length of the optimal path scales logaritmically with the size of the networks studied. We also review the transition between the strong and weak disorder regimes in the scaling properties of the length of the optimal path for ER and SF networks and for a general distribution of weights, and suggest that for any distribution of weigths, the distribution of optimal path lengths has a universal form which is controlled by the scaling parameter $Z=ell_{infty}/A$ where $A$ plays the role of the disorder strength, and $ell_{infty}$ is the length of the optimal path in strong disorder. The relation for $A$ is derived analytically and supported by numerical simulations. We then study the minimum spanning tree (MST) and show that it is composed of percolation clusters, which we regard as super-nodes, connected by a scale-free tree. We furthermore show that the MST can be partitioned into two distinct components. One component the {it superhighways}, for which the nodes with high centrality dominate, corresponds to the largest cluster at the percolation threshold which is a subset of the MST. In the other component, {it roads}, low centrality nodes dominate. We demonstrate the significance identifying the superhighways by showing that one can improve significantly the global transport by improving a very small fraction of the network.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا