Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userMaster equation for the degree distribution of a Duplication and Divergence network
76
0
0.0
(
0
)
Added by
Daniel Gamermann Dr.
Publication date
2017
fields
Physics
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Network growth as described by the Duplication-Divergence model proposes a simple general idea for the evolution dynamics of natural networks. In particular it is an alternative to the well known Barabasi-Albert model when applied to protein-protein interaction networks. In this work we derive a master equation for the node degree distribution of networks growing via Duplication and Divergence and we obtain an expression for the total number of links and for the degree distribution as a function of the number of nodes. Using algebra tools we investigate the degree distribution asymptotic behavior. Analytic results show that the network nodes average degree converges if the total mutation rate is greater than 0.5 and diverges otherwise. Treating original and duplicated node mutation rates as independent parameters has no effect on this result. However, difference in these parameters results in a slower rate of convergence and in different degree distributions. The more different these parameters are, the denser the tail of the distribution. We compare the solutions obtained with simulated networks. These results are in good agreement with the expected values from the derived expressions. The method developed is a robust tool to investigate other models for network growing dynamics.
rate research
Read More
In many real-world networks, the rates of node and link addition are time dependent. This observation motivates the definition of accelerating networks. There has been relatively little investigation of accelerating networks and previous efforts at analyzing their degree distributions have employed mean-field techniques. By contrast, we show that it is possible to apply a master-equation approach to such network development. We provide full time-dependent expressions for the evolution of the degree distributions for the canonical situations of random and preferential attachment in networks undergoing constant acceleration. These results are in excellent agreement with results obtained from simulations. We note that a growing, non-equilibrium network undergoing constant acceleration with random attachment is equivalent to a classical random graph, bridging the gap between non-equilibrium and classical equilibrium networks.
Individual heterogeneity is a key characteristic of many real-world systems, from organisms to humans. However its role in determining the systems collective dynamics is typically not well understood. Here we study how individual heterogeneity impacts the system network dynamics by comparing linking mechanisms that favor similar or dissimilar individuals. We find that this heterogeneity-based evolution can drive explosive network behavior and dictates how a polarized population moves toward consensus. Our model shows good agreement with data from both biological and social science domains. We conclude that individual heterogeneity likely plays a key role in the collective development of real-world networks and communities, and cannot be ignored.
We study the robustness properties of multiplex networks consisting of multiple layers of distinct types of links, focusing on the role of correlations between degrees of a node in different layers. We use generating function formalism to address various notions of the network robustness relevant to multiplex networks such as the resilience of ordinary- and mutual connectivity under random or targeted node removals as well as the biconnectivity. We found that correlated coupling can affect the structural robustness of multiplex networks in diverse fashion. For example, for maximally-correlated duplex networks, all pairs of nodes in the giant component are connected via at least two independent paths and network structure is highly resilient to random failure. In contrast, anti-correlated duplex networks are on one hand robust against targeted attack on high-degree nodes, but on the other hand they can be vulnerable to random failure.
The master equation approach is proposed to describe the evolution of passengers in a subway system. With the transition rate constructed from simple geographical consideration, the evolution equation for the distribution of subway passengers is found to bear skew distributions including log-normal, Weibull, and power-law distributions. This approach is then applied to the Metropolitan Seoul Subway system: Analysis of the trip data of all passengers in a day reveals that the data in most cases fit well to the log-normal distributions. Implications of the results are also discussed.
We present a general quantum fluctuation theorem for the entropy production of an open quantum system whose evolution is described by a Lindblad master equation. Such theorem holds for both local and global master equations, thus settling the dispute on the thermodynamic consistency of the local quantum master equations. The theorem is genuinely quantum, as it can be expressed in terms of conservation of an Hermitian operator, describing the dynamics of the system state operator and of the entropy change in the baths. The integral fluctuation theorem follows from the properties of such an operator. Furthermore, it is valid for arbitrary number of baths and for time-dependent Hamiltonians. As such, the quantum Jarzynski equality is a particular case of the general result presented here. Moreover, our result can be extended to non-thermal baths, as long as microreversibility is preserved. We finally present some numerical examples to showcase the exact results previously obtained.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
