اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAnalyzing Network Reliability Using Structural Motifs
299
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This paper uses the reliability polynomial, introduced by Moore and Shannon in 1956, to analyze the effect of network structure on diffusive dynamics such as the spread of infectious disease. We exhibit a representation for the reliability polynomial in terms of what we call {em structural motifs} that is well suited for reasoning about the effect of a networks structural properties on diffusion across the network. We illustrate by deriving several general results relating graph structure to dynamical phenomena.
قيم البحث
اقرأ أيضاً
Investigating the frequency and distribution of small subgraphs with a few nodes/edges, i.e., motifs, is an effective analysis method for static networks. Motif-driven analysis is also useful for temporal networks where the spectrum of motifs is sign
ificantly larger due to the additional temporal information on edges. This variety makes it challenging to design a temporal motif model that can consider all aspects of temporality. In the literature, previous works have introduced various models that handle different characteristics. In this work, we compare the existing temporal motif models and evaluate the facets of temporal networks that are overlooked in the literature. We first survey four temporal motif models and highlight their differences. Then, we evaluate the advantages and limitations of these models with respect to the temporal inducedness and timing constraints. In addition, we suggest a new lens, event pairs, to investigate temporal correlations. We believe that our comparative survey and extensive evaluation will catalyze the research on temporal network motif models.
The structure of nanoclusters is complex to describe due to their noncrystallinity, even though bonding and packing constraints limit the local atomic arrangements to only a few types. A computational scheme is presented to extract coordination motif
s from sample atomic configurations. The method is based on a clustering analysis of multipole moments for atoms in the first coodination shell. Its power to capture large-scale structural properties is demonstrated by scanning through the ground state of the Lennard-Jones and C$_{60}$ clusters collected at the Cambridge Cluster Database.
Higher-order proximity (HOP) is fundamental for most network embedding methods due to its significant effects on the quality of node embedding and performance on downstream network analysis tasks. Most existing HOP definitions are based on either hom
ophily to place close and highly interconnected nodes tightly in embedding space or heterophily to place distant but structurally similar nodes together after embedding. In real-world networks, both can co-exist, and thus considering only one could limit the prediction performance and interpretability. However, there is no general and universal solution that takes both into consideration. In this paper, we propose such a simple yet powerful framework called homophily and heterophliy preserving network transformation (H2NT) to capture HOP that flexibly unifies homophily and heterophily. Specifically, H2NT utilises motif representations to transform a network into a new network with a hybrid assumption via micro-level and macro-level walk paths. H2NT can be used as an enhancer to be integrated with any existing network embedding methods without requiring any changes to latter methods. Because H2NT can sparsify networks with motif structures, it can also improve the computational efficiency of existing network embedding methods when integrated. We conduct experiments on node classification, structural role classification and motif prediction to show the superior prediction performance and computational efficiency over state-of-the-art methods. In particular, DeepWalk-based H2 NT achieves 24% improvement in terms of precision on motif prediction, while reducing 46% computational time compared to the original DeepWalk.
Cellular processes do not follow deterministic rules; even in identical environments genetically identical cells can make random choices leading to different phenotypes. This randomness originates from fluctuations present in the biomolecular interac
tion networks. Most previous work has been focused on the intrinsic noise (IN) of these networks. Yet, especially for high-copy-number biomolecules, extrinsic or environmental noise (EN) has been experimentally shown to dominate the variation. Here, we develop an analytical formalism that allows for calculation of the effect of EN on gene-expression motifs. We introduce a method for modeling bounded EN as an auxiliary species in the master equation. The method is fully generic and is not limited to systems with small EN magnitudes. We focus our study on motifs that can be viewed as the building blocks of genetic switches: a nonregulated gene, a self-inhibiting gene, and a self-promoting gene. The role of the EN properties (magnitude, correlation time, and distribution) on the statistics of interest are systematically investigated, and the effect of fluctuations in different reaction rates is compared. Due to its analytical nature, our formalism can be used to quantify the effect of EN on the dynamics of biochemical networks and can also be used to improve the interpretation of data from single-cell gene-expression experiments.
The study of temporal networks in discrete time has yielded numerous insights into time-dependent networked systems in a wide variety of applications. For many complex systems, however, it is useful to develop continuous-time models of networks and t
o compare them to associated discrete models. In this paper, we study several continuous-time network models and examine discrete approximations of them both numerically and analytically. To consider continuous-time networks, we associate each edge in a graph with a time-dependent tie strength that can take continuous non-negative values and decays in time after the most recent interaction. We investigate how the mean tie strength evolves with time in several models, and we explore -- both numerically and analytically -- criteria for the emergence of a giant connected component in some of these models. We also briefly examine the effects of interaction patterns of our continuous-time networks on contagion dynamics in a susceptible-infected-recovered model of an infectious disease.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
