arXiv subjects

Menghui Li

Publications and source records attributed to Menghui Li.

30 records · Page 2Linked to original sources

arXiv2009

Evolutionary Subnetworks in Complex Systems

Links in a practical network may have different functions, which makes the original network a combination of some functional subnetworks. Here, by a model of coupled oscillators, we investigate how such functional subnetworks are evolved and developed according to the network structure and dynamics. In particular, we study the case of evolutionary clustered networks in which the function of each link (either attractive or repulsive coupling) is updated by the local dynamics. It is found that, during the process of system evolution, the network is gradually stabilized into a particular form in which the attractive (repulsive) subnetwork consists only the intralinks (interlinks). Based on the properties of subnetwork evolution, we also propose a new algorithm for network partition which is distinguished by the convenient operation and fast computing speed.

nlin.AO↗

arXiv2008

Empirical Analysis and Evolving Model of Bipartite Networks

Many real-world networks display a natural bipartite structure. Investigating it based on the original structure is helpful to get deep understanding about the networks. In this paper, some real-world bipartite networks are collected and divided into two types, dependence bipartite networks and independence bipartite networks, according to the different relation of two sets of nodes. By analyzing them, the results show that the actors nodes have scale-free property in the dependence networks, and there is no accordant degree distribution in the independence networks for both two types of nodes. In order to understand the scale-free property of actors in dependence networks, two growing bipartite models without the preferential attachment principle are proposed. The models show the scale-free phenomena in actors' degree distribution. It also gives well qualitatively consistent behavior with the empirical results.

physics.soc-ph↗

arXiv2008

A New Comparative Definition of Community and Corresponding Identifying Algorithm

In this paper, a new comparative definition for community in networks is proposed and the corresponding detecting algorithm is given. A community is defined as a set of nodes, which satisfy that each node's degree inside the community should not be smaller than the node's degree toward any other community. In the algorithm, the attractive force of a community to a node is defined as the connections between them. Then employing attractive force based self-organizing process, without any extra parameter, the best communities can be detected. Several artificial and real-world networks, including Zachary Karate club network and College football network are analyzed. The algorithm works well in detecting communities and it also gives a nice description for network division and group formation.

physics.soc-ph↗

arXiv2007

Community Detecting By Signaling on Complex Networks

Based on signaling process on complex networks, a method for identification community structure is proposed. For a network with $n$ nodes, every node is assumed to be a system which can send, receive, and record signals. Each node is taken as the initial signal source once to inspire the whole network by exciting its neighbors and then the source node is endowed a $n$d vector which recording the effects of signaling process. So by this process, the topological relationship of nodes on networks could be transferred into the geometrical structure of vectors in $n$d Euclidian space. Then the best partition of groups is determined by $F$-statistic and the final community structure is given by Fuzzy $C$-means clustering method (FCM). This method can detect community structure both in unweighted and weighted networks without any extra parameters. It has been applied to ad hoc networks and some real networks including Zachary Karate Club network and football team network. The results are compared with that of other approaches and the evidence indicates that the algorithm based on signaling process is effective.

physics.soc-ph↗

arXiv2006

The Role of Weight on Community Structure of Networks

The role of weight on the weighted networks is investigated by studying the effect of weight on community structures. We use weighted modularity $Q^w$ to evaluate the partitions and Weighted Extremal Optimization algorithm to detect communities. Starting from idealized and empirical weighted networks, the distribution or matching between weights and edges are disturbed. Using dissimilarity function $D$ to distinguish the difference between community structures, it is found that the redistribution of weights does strongly affect the community structure especially in dense networks. This indicates that the community structure in networks is a suitable property to reflect the role of weight.

physics.soc-ph↗

arXiv2006

Accuracy and Precision of Methods for Community Identification in Weighted Networks

Based on brief review of approaches for community identification and measurement for sensitivity characterization, the accuracy and precision of several approaches for detecting communities in weighted networks are investigated. In weighted networks, the community structure should take both links and link weights into account and the partition of networks should be evaluated by weighted modularity $Q^w$. The results reveal that link weight has important effects on communities especially in dense networks. Potts model and Weighted Extremal Optimization (WEO) algorithm work well on weighted networks. Then Potts model and WEO algorithms are used to detect communities in Rhesus monkey network. The results gives nice understanding for real community structure.

physics.soc-ph↗

arXiv2006

Effects of Weight on Structure and Dynamics in Complex Networks

Link weight is crucial in weighted complex networks. It provides additional dimension for describing and adjusting the properties of networks. The topological role of weight is studied by the effects of random redistribution of link weights based on regular network with initial homogeneous weight. The small world effect emerges due to the weight randomization. Its effects on the dynamical systems coupled by weighted networks are also investigated. Randomization of weight can increase the transition temperature in Ising model and enhance the ability of synchronization of chaotic systems dramatically.

cond-mat.stat-mech↗

arXiv2005

The Community Structure of Econophysicist Collaboration Networks

This paper uses a database of collaboration recording between Econophysics Scientists to study the community structure of this collaboration network, which with a single type of vertex and a type of undirected, weighted edge. Hierarchical clustering and the algorithm of Girvan and Newman are presented to analyze the data. And it emphasizes the influence of the weight to results of communities by comparing the different results obtained in different weights. A function D is proposed to distinguish the difference between above results. At last the paper also gives explanation to the results and discussion about community structure.

physics.soc-ph↗

arXiv2005

Evolving Model of Weighted Networks Inspired by Scientific Collaboration Networks

Inspired by scientific collaboration networks, especially our empirical analysis of the network of econophysicists, an evolutionary model for weighted networks is proposed. Both degree-driven and weight-driven models are considered. Compared with the BA model and other evolving models with preferential attachment, there are two significant generalizations. First, besides the new vertex added in at every time step, old vertices can also attempt to build up new links, or to reconnect the existing links. The reconnection between both new-old and old-old nodes are recorded and the connecting times on every link is converted into the weight of the link. This provides a natural way for the evolution of edge weight. Second, besides degree and the weight of vertices, a path-related local information is also used as a reference in the preferential attachment. The path-related preferential attachment mechanism significantly increases the clustering coefficient of the network. The model shows the scale-free phenomena in degree and weight distribution. It also gives well qualitatively consistent behavior with the empirical results.

cond-mat.dis-nn↗

arXiv2004

Weighted networks of scientific communication: the measurement and geometrical role of weight

In order to take the weight of connection into consideration and to find a natural measurement of weight, we have collected papers in Econophysics and constructed a network of scientific communication to integrate idea transportation among econophysicists by collaboration, citation and personal discussion. Some basic statistics such as weight per degree are discussed in \cite{fan}. In this paper, by including the papers published recently, further statistical results for the network are reported. Clustering coefficient of weighted network is introduced and empirically studied in this network. We also compare the typical statistics on this network under different weight measurements, including random and inverse weight. The conclusion from weight-randomized network is helpful to the investigation of the geometrical role of weight.

cond-mat.other↗

arXiv2004

Increasing Returns to Scale, Dynamics of Industrial Structure and Size Distribution of Firms

A model is presented of the market dynamics to emphasis the effects of increasing returns to scale, including the description of the born and death of the adaptive producers. The evolution of market structure and its behavior with the technological shocks are discussed. Its dynamics is in good agreement with some empirical stylized facts of industrial evolution. Together with the diversities of demand and adaptive growth strategies of firms, the generalized model has reproduced the power-law distribution of firm size. Three factors mainly determine the competitive dynamics and the skewed size distributions of firms: 1. Self-reinforcing mechanism; 2. Adaptive firm grows strategies; 3. Demand diversities or widespread heterogeneity in the technological capabilities of different firms. Key words: Econophysics, Increasing returns, Industry dynamics, Size distribution of firms

cond-mat.stat-mech↗

arXiv2004

Network of Econophysicists: a weighted network to investigate the development of Econophysics

The development of Econophysics is studied from the perspective of scientific communication networks. Papers in Econophysics published from 1992 to 2003 are collected. Then a weighted and directed network of scientific communication, including collaboration, citation and personal discussion, is constructed. Its static geometrical properties, including degree distribution, weight distribution, weight per degree, and betweenness centrality, give a nice overall description of the research works. The way we introduced here to measure the weight of connections can be used as a general one to construct weighted network.

cond-mat.soft↗