The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Community detection is of considerable importance for understanding both the structure and function of complex networks. In this paper, we introduced the general procedure of the community detection algorithms using global and local structural information, where the edge betweenness and the local similarity measures respectively based on local random walk dynamics and local cyclic structures were...
It is proved that the maximum eigenvalue sequence of the principal submatrices of coupling matrix is decreasing. The method of calculating the number of pinning nodes is given based on this theory. The findings reveal the relationship between the decreasing speed of maximum eigenvalue sequence of the principal submatrices for coupling matrix and the synchronizability on complex networks via pinning...
In this paper, the synchronization problem of general complex networks is investigated by using adaptive control schemes. Time-delay coupling, derivative coupling, nonlinear coupling etc. exist universally in real-world complex networks. The adaptive synchronization scheme is designed for the complex network with multiple class of coupling terms. A criterion guaranteeing synchronization of such complex...
The real network nodes are always interfered by other messages. So, how to realize the hybrid synchronization of two independent chaotic systems based on the complex network is very important. To solve this problem, two other problems should be considered. One is how the same network node of the complex network was affected by different information sources. Another is how to achieve hybrid synchronization...
Many real-world networks such as the protein–protein interaction networks and metabolic networks often display nontrivial correlations between degrees of vertices connected by edges. Here, we analyse the statistical methods used usually to describe the degree correlation in the networks, and analytically give linear relation in the degree correlation. It provides a simple and interesting perspective...
A complex network and chaos-based method, based on the visibility graph algorithm, is applied to study particle fluctuations in $$\pi ^{-}$$ π- –AgBr interactions at 350 GeV with respect to the shower multiplicity dependence. The fractal structure of the fluctuations is studied by using the power of scale freeness of visibility graph (PSVG). The selection of visibility graph as the type of complex...
It is still a crucial issue to identify influential nodes effectively in the study of complex networks. As for the existing efficiency centrality (EffC), it cannot be applied to a weighted network. In this paper, a modified efficiency centrality (EffC$$^\mathrm{m}$$ m ) is proposed by extending EffC into weighted networks. The proposed measure trades off the node degree and global structure in a weighted...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.