Functionalities of a variety of complex systems involve cooperations among multiple components; for example, a transportation system provides convenient transfers among airlines, railways, roads, and shipping lines. A layered model with interacting networks can facilitate the description and analysis of such systems. In this paper we propose a model of traffic dynamics and reveal a transition at the onset of cooperation between layered networks. The cooperation strength, treated as an order parameter, changes from zero to positive at the transition point. Numerical results on artificial networks as well as two real networks, Chinese and European railway-airline transportation networks, agree well with our analysis.
In a network described by a graph, only topological structure information is considered to determine how the nodes are connected by edges. Non-topological information denotes that which cannot be determined directly from topological information. This paper shows, by a simple example where scientists in three research groups and one external group form four communities, that in some real world networks non-topological information (in this example, the research group affiliation) dominates community division. If the information has some influence on the network topological structure, the question arises as to how to find a suitable algorithm to identify the communities based only on the network topology. We show that weighted Newman algorithm may be the best choice for this example. We believe that this idea is general for real-world complex networks.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.