Related papers: Properties of weighted complex networks
We introduce the notion of globally updating evolution for a class of weighted networks, in which the weight of a link is characterized by the amount of data packet transport flowing through it. By noting that the packet transport over the…
In this work we study a simple evolutionary model of bipartite networks which its evolution is based on the duplication of nodes. Using analytical results along with numerical simulation of the model, we show that the above evolutionary…
Weight thresholding is a simple technique that aims at reducing the number of edges in weighted networks that are otherwise too dense for the application of standard graph theoretical methods. We show that the group structure of real…
Two versions of the susceptible-infected-susceptible epidemic model, which have different transmission rules, are analysed. Both models are considered on a weighted network to simulate a mitigation in the connection between the individuals.…
Small-world networks are highly clustered networks with small distances among the nodes. There are many biological neural networks that present this kind of connections. There are no special weightings in the connections of most existing…
Dense networks with weighted connections often exhibit a community like structure, where although most nodes are connected to each other, different patterns of edge weights may emerge depending on each node's community membership. We…
The spectral densities of the weighted Laplacian, random walk and weighted adjacency matrices associated with a random complex network are studied using the replica method. The link weights are parametrized by a weight exponent $\beta$.…
Since some realistic networks are influenced not only by increment behavior but also by tunable clustering mechanism with new nodes to be added to networks, it is interesting to characterize the model for those actual networks. In this…
A scale-free network is grown in the Euclidean space with a global directional bias. On a vertical plane, nodes are introduced at unit rate at randomly selected points and a node is allowed to be connected only to the subset of nodes which…
Tie strength prediction, sometimes named weight prediction, is vital in exploring the diversity of connectivity pattern emerged in networks. Due to the fundamental significance, it has drawn much attention in the field of network analysis…
We investigate critical behaviors of a social contagion model on weighted networks. An edge-weight compartmental approach is applied to analyze the weighted social contagion on strongly heterogenous networks with skewed degree and weight…
In this paper we study the household-structure SIS epidemic spreading on general complex networks. The household structure gives us the way to distinguish inner and the outer infection rate. Unlike household-structure models on homogenous…
A simple model is proposed to simulate the evolution of interpersonal relationships in a class. The small social network is simply assumed as an undirected and weighted graph, in which students are represented by vertices, and the extent of…
For decades, complex networks, such as social networks, biological networks, chemical networks, technological networks, have been used to study the evolution and dynamics of different kinds of complex systems. These complex systems can be…
We study scale free simple graphs with an exponent of the degree distribution $\gamma$ less than two. Generically one expects such extremely skewed networks -- which occur very frequently in systems of virtually or logically connected units…
We propose an efficient and accurate measure for ranking spreaders and identifying the influential ones in spreading processes in networks. While the edges determine the connections among the nodes, their specific role in spreading should…
A small-world topology characterizes many complex systems including the structural and functional organization of brain networks. The topology allows simultaneously for local and global efficiency in the interaction of the system…
The Internet, as well as many other networks, has a very complex connectivity recently modeled by the class of scale-free networks. This feature, which appears to be very efficient for a communications network, favors at the same time the…
We extend the merging model for undirected networks by Kim et al. [Eur. Phys. J. B 43, 369 (2004)] to directed networks and investigate the emerging scale-free networks. Two versions of the directed merging model, friendly and hostile…
A network's assortativity is the tendency of vertices to bond with others based on similarities, usually excess vertex degree. In this paper we consider assortativity in weighted networks, both directed and undirected. To this end, we…