Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userPriority diffusion model in lattices and complex networks
173
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We introduce a model for diffusion of two classes of particles ($A$ and $B$) with priority: where both species are present in the same site the motion of $A$s takes precedence over that of $B$s. This describes realistic situations in wireless and communication networks. In regular lattices the diffusion of the two species is normal but the $B$ particles are significantly slower, due to the presence of the $A$ particles. From the fraction of sites where the $B$ particles can move freely, which we compute analytically, we derive the diffusion coefficients of the two species. In heterogeneous networks the fraction of sites where $B$ is free decreases exponentially with the degree of the sites. This, coupled with accumulation of particles in high-degree nodes leads to trapping of the low priority particles in scale-free networks.
rate research
Read More
The Potts model is one of the most popular spin models of statistical physics. The prevailing majority of work done so far corresponds to the lattice version of the model. However, many natural or man-made systems are much better described by the topology of a network. We consider the q-state Potts model on an uncorrelated scale-free network for which the node-degree distribution manifests a power-law decay governed by the exponent lambda. We work within the mean-field approximation, since for systems on random uncorrelated scale-free networks this method is known to often give asymptotically exact results. Depending on particular values of q and lambda one observes either a first-order or a second-order phase transition or the system is ordered at any finite temperature. In a case study, we consider the limit q=1 (percolation) and find a correspondence between the magnetic exponents and those describing percolation on a scale-free network. Interestingly, logarithmic corrections to scaling appear at lambda=4 in this case.
We show that heterogeneous degree distributions in observed scale-free topologies of complex networks can emerge as a consequence of the exponential expansion of hidden hyperbolic space. Fermi-Dirac statistics provides a physical interpretation of hyperbolic distances as energies of links. The hidden space curvature affects the heterogeneity of the degree distribution, while clustering is a function of temperature. We embed the Internet into the hyperbolic plane, and find a remarkable congruency between the embedding and our hyperbolic model. Besides proving our model realistic, this embedding may be used for routing with only local information, which holds significant promise for improving the performance of Internet routing.
We study anomalous heat conduction and anomalous diffusion in low dimensional systems ranging from nonlinear lattices, single walled carbon nanotubes, to billiard gas channels. We find that in all discussed systems, the anomalous heat conductivity can be connected with the anomalous diffusion, namely, if energy diffusion is $sigma^2(t)equiv <Delta x^2> =2Dt^{alpha} (0<alphale 2)$, then the thermal conductivity can be expressed in terms of the system size $L$ as $kappa = cL^{beta}$ with $beta=2-2/alpha$. This result predicts that a normal diffusion ($alpha =1$) implies a normal heat conduction obeying the Fourier law ($beta=0$), a superdiffusion ($alpha>1$) implies an anomalous heat conduction with a divergent thermal conductivity ($beta>0$), and more interestingly, a subdiffusion ($alpha <1$) implies an anomalous heat conduction with a convergent thermal conductivity ($beta<0$), consequently, the system is a thermal insulator in the thermodynamic limit. Existing numerical data support our theoretical prediction.
A condensation transition was predicted for growing technological networks evolving by preferential attachment and competing quality of their nodes, as described by the fitness model. When this condensation occurs a node acquires a finite fraction of all the links of the network. Earlier studies based on steady state degree distribution and on the mapping to Bose-Einstein condensation, were able to identify the critical point. Here we characterize the dynamics of condensation and we present evidence that below the condensation temperature there is a slow down of the dynamics and that a single node (not necessarily the best node in the network) emerges as the winner for very long times. The characteristic time t* at which this phenomenon occurs diverges both at the critical point and at $T -> 0$ when new links are attached deterministically to the highest quality node of the network.
We develop a geometric framework to study the structure and function of complex networks. We assume that hyperbolic geometry underlies these networks, and we show that with this assumption, heterogeneous degree distributions and strong clustering in complex networks emerge naturally as simple reflections of the negative curvature and metric property of the underlying hyperbolic geometry. Conversely, we show that if a network has some metric structure, and if the network degree distribution is heterogeneous, then the network has an effective hyperbolic geometry underneath. We then establish a mapping between our geometric framework and statistical mechanics of complex networks. This mapping interprets edges in a network as non-interacting fermions whose energies are hyperbolic distances between nodes, while the auxiliary fields coupled to edges are linear functions of these energies or distances. The geometric network ensemble subsumes the standard configuration model and classical random graphs as two limiting cases with degenerate geometric structures. Finally, we show that targeted transport processes without global topology knowledge, made possible by our geometric framework, are maximally efficient, according to all efficiency measures, in networks with strongest heterogeneity and clustering, and that this efficiency is remarkably robust with respect to even catastrophic disturbances and damages to the network structure.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
