May 17, 2005
We will introduce two evolving models that characterize weighted complex networks. Though the microscopic dynamics are different, these models are found to bear a similar mathematical framework, and hence exhibit some common behaviors, for example, the power-law distributions and evolution of degree, weight and strength. We also study the nontrivial clustering coefficient C and tunable degree assortativity coefficient r, depending on specific parameters. Most results are supp...
August 17, 2011
We propose a natural model of evolving weighted networks in which new links are not necessarily connected to new nodes. The model allows a newly added link to connect directly two nodes already present in the network. This is plausible in modeling many real-world networks. Such a link is called an inner link, while a link connected to a new node is called an outer link. In view of interrelations between inner and outer links, we investigate power-laws for the strength, degree...
November 8, 2005
We proposed an evolving network model constituted by the same nodes but different edges. The competition between nodes and different links were introduced. Scale free properties have been found in this model by continuum theory. Different network topologies can be generated by some tunable parameters. Simulation results consolidate the prediction.
November 5, 2007
I start by reviewing some basic properties of random graphs. I then consider the role of random walks in complex networks and show how they may be used to explain why so many long tailed distributions are found in real data sets. The key idea is that in many cases the process involves copying of properties of near neighbours in the network and this is a type of short random walk which in turn produce a natural preferential attachment mechanism. Applying this to networks of fi...
July 13, 2017
We introduce a model for the emergence of innovations, in which cognitive processes are described as random walks on the network of links among ideas or concepts, and an innovation corresponds to the first visit of a node. The transition matrix of the random walk depends on the network weights, while in turn the weight of an edge is reinforced by the passage of a walker. The presence of the network naturally accounts for the mechanism of the adjacent possible, and the model r...
December 24, 2014
Relevance and importance are the main factors when humans build network connections. We propose an evolutionary network model based on preferential attachment(PA) considering these factors. We analyze and compute several important features of the network class generated by this algorithm including scale free degree distribution, high clustering coefficient, small world property and core-periphery structure. We then compare this model with other network models and empirical da...
November 17, 2013
A remarkable phenomenon in the time evolution of many networks such as cultural, political, national and economic systems, is the recurrent transition between the states of union and division of nodes. In this work, we propose a phenomenological modeling, inspired by the maxim "long union divides and long division unites", in order to investigate the evolutionary characters of these networks composed of the entities whose behaviors are dominated by these two events. The nodes...
June 26, 2018
The ever increasing availability of data demands for techniques to extract relevant information from complex interacting systems, which can often be represented as weighted networks. In recent years, a number of approaches have been proposed to extract network backbones by assessing the statistical significance of links against null hypotheses of random interaction. Yet, it is well known that the growth of most real-world networks is highly non-random, as past interactions be...
August 4, 1998
A survey is made of several aspects of the dynamics of networks, with special emphasis on unsupervised learning processes, non-Gaussian data analysis and pattern recognition in networks with complex nodes.
January 15, 2003
Complex networks as the World Wide Web, the web of human sexual contacts or criminal networks often do not have an engineered architecture but instead are self-organized by the actions of a large number of individuals. From these local interactions non-trivial global phenomena can emerge as small-world properties or scale-free degree distributions. A simple model for the evolution of acquaintance networks highlights the essential dynamical ingredients necessary to obtain such...