ترغب بنشر مسار تعليمي؟ اضغط هنا

Analysing degeneracies in networks spectra

68   0   0.0 ( 0 )
 نشر من قبل Sarika Jalan
 تاريخ النشر 2016
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

Many real-world networks exhibit a high degeneracy at few eigenvalues. We show that a simple transformation of the networks adjacency matrix provides an understanding of the origins of occurrence of high multiplicities in the networks spectra. We find that the eigenvectors associated with the degenerate eigenvalues shed light on the structures contributing to the degeneracy. Since these degeneracies are rarely observed in model graphs, we present results for various cancer networks. This approach gives an opportunity to search for structures contributing to degeneracy which might have an important role in a network.



قيم البحث

اقرأ أيضاً

The whole frame of interconnections in complex networks hinges on a specific set of structural nodes, much smaller than the total size, which, if activated, would cause the spread of information to the whole network [1]; or, if immunized, would preve nt the diffusion of a large scale epidemic [2,3]. Localizing this optimal, i.e. minimal, set of structural nodes, called influencers, is one of the most important problems in network science [4,5]. Despite the vast use of heuristic strategies to identify influential spreaders [6-14], the problem remains unsolved. Here, we map the problem onto optimal percolation in random networks to identify the minimal set of influencers, which arises by minimizing the energy of a many-body system, where the form of the interactions is fixed by the non-backtracking matrix [15] of the network. Big data analyses reveal that the set of optimal influencers is much smaller than the one predicted by previous heuristic centralities. Remarkably, a large number of previously neglected weakly-connected nodes emerges among the optimal influencers. These are topologically tagged as low-degree nodes surrounded by hierarchical coronas of hubs, and are uncovered only through the optimal collective interplay of all the influencers in the network. Eventually, the present theoretical framework may hold a larger degree of universality, being applicable to other hard optimization problems exhibiting a continuous transition from a known phase [16].
78 - Hyewon Kim , Meesoon Ha , 2015
The formation of network structure is mainly influenced by an individual nodes activity and its memory, where activity can usually be interpreted as the individual inherent property and memory can be represented by the interaction strength between no des. In our study, we define the activity through the appearance pattern in the time-aggregated network representation, and quantify the memory through the contact pattern of empirical temporal networks. To address the role of activity and memory in epidemics on time-varying networks, we propose temporal-pattern coarsening of activity-driven growing networks with memory. In particular, we focus on the relation between time-scale coarsening and spreading dynamics in the context of dynamic scaling and finite-size scaling. Finally, we discuss the universality issue of spreading dynamics on time-varying networks for various memory-causality tests.
We study a mechanism of activity sustaining on networks inspired by a well-known model of neuronal dynamics. Our primary focus is the emergence of self-sustaining collective activity patterns, where no single node can stay active by itself, but the a ctivity provided initially is sustained within the collective of interacting agents. In contrast to existing models of self-sustaining activity that are caused by (long) loops present in the network, here we focus on tree--like structures and examine activation mechanisms that are due to temporal memory of the nodes. This approach is motivated by applications in social media, where long network loops are rare or absent. Our results suggest that under a weak behavioral noise, the nodes robustly split into several clusters, with partial synchronization of nodes within each cluster. We also study the randomly-weighted version of the models where the nodes are allowed to change their connection strength (this can model attention redistribution), and show that it does facilitate the self-sustained activity.
Controlling complex networks is of paramount importance in science and engineering. Despite the recent development of structural-controllability theory, we continue to lack a framework to control undirected complex networks, especially given link wei ghts. Here we introduce an exact-controllability paradigm based on the maximum multiplicity to identify the minimum set of driver nodes required to achieve full control of networks with arbitrary structures and link-weight distributions. The framework reproduces the structural controllability of directed networks characterized by structural matrices. We explore the controllability of a large number of real and model networks, finding that dense networks with identical weights are difficult to be controlled. An efficient and accurate tool is offered to assess the controllability of large sparse and dense networks. The exact-controllability framework enables a comprehensive understanding of the impact of network properties on controllability, a fundamental problem towards our ultimate control of complex systems.
We present a model that takes into account the coupling between evolutionary game dynamics and social influence. Importantly, social influence and game dynamics take place in different domains, which we model as different layers of a multiplex networ k. We show that the coupling between these dynamical processes can lead to cooperation in scenarios where the pure game dynamics predicts defection. In addition, we show that the structure of the network layers and the relation between them can further increase cooperation. Remarkably, if the layers are related in a certain way, the system can reach a polarized metastable state.These findings could explain the prevalence of polarization observed in many social dilemmas.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا