اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMotif-based communities in complex networks
81
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Community definitions usually focus on edges, inside and between the communities. However, the high density of edges within a community determines correlations between nodes going beyond nearest-neighbours, and which are indicated by the presence of motifs. We show how motifs can be used to define general classes of nodes, including communities, by extending the mathematical expression of Newman-Girvan modularity. We construct then a general framework and apply it to some synthetic and real networks.
قيم البحث
اقرأ أيضاً
As a fundamental challenge in vast disciplines, link prediction aims to identify potential links in a network based on the incomplete observed information, which has broad applications ranging from uncovering missing protein-protein interaction to pr
edicting the evolution of networks. One of the most influential methods rely on similarity indices characterized by the common neighbors or its variations. We construct a hidden space mapping a network into Euclidean space based solely on the connection structures of a network. Compared with real geographical locations of nodes, our reconstructed locations are in conformity with those real ones. The distances between nodes in our hidden space could serve as a novel similarity metric in link prediction. In addition, we hybrid our hidden space method with other state-of-the-art similarity methods which substantially outperforms the existing methods on the prediction accuracy. Hence, our hidden space reconstruction model provides a fresh perspective to understand the network structure, which in particular casts a new light on link prediction.
Sun et al. provided an insightful comment arXiv:1108.5739v1 on our manuscript entitled Controllability of Complex Networks with Nonlinear Dynamics on arXiv. We agree on their main point that linearization about locally desired states can be violated
in general by the breakdown of local control of the linearized complex network with nonlinear state. Therefore, we withdraw our manuscript. However, other than nonlinear dynamics, our claim that a single-node-control can fully control the general bidirectional/undirected linear network with 1D self-dynamics is still valid, which is similar to (but different from) the conclusion of arXiv:1106.2573v3 that all-node-control with a single signal can fully control any direct linear network with nodal-dynamics (1D self-dynamics).
We analyze the complex networks associated with brain electrical activity. Multichannel EEG measurements are first processed to obtain 3D voxel activations using the tomographic algorithm LORETA. Then, the correlation of the current intensity activat
ion between voxel pairs is computed to produce a voxel cross-correlation coefficient matrix. Using several correlation thresholds, the cross-correlation matrix is then transformed into a network connectivity matrix and analyzed. To study a specific example, we selected data from an earlier experiment focusing on the MMN brain wave. The resulting analysis highlights significant differences between the spatial activations associated with Standard and Deviant tones, with interesting physiological implications. When compared to random data networks, physiological networks are more connected, with longer links and shorter path lengths. Furthermore, as compared to the Deviant case, Standard data networks are more connected, with longer links and shorter path lengths--i.e., with a stronger ``small worlds character. The comparison between both networks shows that areas known to be activated in the MMN wave are connected. In particular, the analysis supports the idea that supra-temporal and inferior frontal data work together in the processing of the differences between sounds by highlighting an increased connectivity in the response to a novel sound.
Spatially embedded networks have attracted increasing attention in the last decade. In this context, new types of network characteristics have been introduced which explicitly take spatial information into account. Among others, edge directionality p
roperties have recently gained particular interest. In this work, we investigate the applicability of mean edge direction, anisotropy and local mean angle as geometric characteristics in complex spherical networks. By studying these measures, both analytically and numerically, we demonstrate the existence of a systematic bias in spatial networks where individual nodes represent different shares on a spherical surface, and describe a strategy for correcting for this effect. Moreover, we illustrate the application of the mentioned edge directionality properties to different examples of real-world spatial networks in spherical geometry (with or without the geometric correction depending on each specific case), including functional climate networks, transportation and trade networks. In climate networks, our approach highlights relevant patterns like large-scale circulation cells, the El Ni~{n}o--Southern Oscillation and the Atlantic Ni~{n}o. In an air transportation network, we are able to characterize distinct air transportation zones, while we confirm the important role of the European Union for the global economy by identifying convergent edge directionality patterns in the world trade network.
We consider a dynamical network model in which two competitors have fixed and different states, and each normal agent adjusts its state according to a distributed consensus protocol. The state of each normal agent converges to a steady value which is
a convex combination of the competitors states, and is independent of the initial states of agents. This implies that the competition result is fully determined by the network structure and positions of competitors in the network. We compute an Influence Matrix (IM) in which each element characterizing the influence of an agent on another agent in the network. We use the IM to predict the bias of each normal agent and thus predict which competitor will win. Furthermore, we compare the IM criterion with seven node centrality measures to predict the winner. We find that the competitor with higher Katz Centrality in an undirected network or higher PageRank in a directed network is much more likely to be the winner. These findings may shed new light on the role of network structure in competition and to what extent could competitors adjust network structure so as to win the competition.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
