اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA Network Model characterized by a Latent Attribute Structure with Competition
182
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The quest for a model that is able to explain, describe, analyze and simulate real-world complex networks is of uttermost practical as well as theoretical interest. In this paper we introduce and study a network model that is based on a latent attribute structure: each node is characterized by a number of features and the probability of the existence of an edge between two nodes depends on the features they share. Features are chosen according to a process of Indian-Buffet type but with an additional random fitness parameter attached to each node, that determines its ability to transmit its own features to other nodes. As a consequence, a nodes connectivity does not depend on its age alone, so also young nodes are able to compete and succeed in acquiring links. One of the advantages of our model for the latent bipartite node-attribute network is that it depends on few parameters with a straightforward interpretation. We provide some theoretical, as well experimental, results regarding the power-law behaviour of the model and the estimation of the parameters. By experimental data, we also show how the proposed model for the attribute structure naturally captures most local and global properties (e.g., degree distributions, connectivity and distance distributions) real networks exhibit. keyword: Complex network, social network, attribute matrix, Indian Buffet process
قيم البحث
اقرأ أيضاً
Community detection is an important task in network analysis, in which we aim to learn a network partition that groups together vertices with similar community-level connectivity patterns. By finding such groups of vertices with similar structural ro
les, we extract a compact representation of the networks large-scale structure, which can facilitate its scientific interpretation and the prediction of unknown or future interactions. Popular approaches, including the stochastic block model, assume edges are unweighted, which limits their utility by throwing away potentially useful information. We introduce the `weighted stochastic block model (WSBM), which generalizes the stochastic block model to networks with edge weights drawn from any exponential family distribution. This model learns from both the presence and weight of edges, allowing it to discover structure that would otherwise be hidden when weights are discarded or thresholded. We describe a Bayesian variational algorithm for efficiently approximating this models posterior distribution over latent block structures. We then evaluate the WSBMs performance on both edge-existence and edge-weight prediction tasks for a set of real-world weighted networks. In all cases, the WSBM performs as well or better than the best alternatives on these tasks.
Production in an economy is a set of firms activities as suppliers and customers; a firm buys goods from other firms, puts value added and sells products to others in a giant network of production. Empirical study is lacking despite the fact that the
structure of the production network is important to understand and make models for many aspects of dynamics in economy. We study a nation-wide production network comprising a million firms and millions of supplier-customer links by using recent statistical methods developed in physics. We show in the empirical analysis scale-free degree distribution, disassortativity, correlation of degree to firm-size, and community structure having sectoral and regional modules. Since suppliers usually provide credit to their customers, who supply it to theirs in turn, each link is actually a creditor-debtor relationship. We also study chains of failures or bankruptcies that take place along those links in the network, and corresponding avalanche-size distribution.
RNA function crucially depends on its structure. Thermodynamic models currently used for secondary structure prediction rely on computing the partition function of folding ensembles, and can thus estimate minimum free-energy structures and ensemble p
opulations. These models sometimes fail in identifying native structures unless complemented by auxiliary experimental data. Here, we build a set of models that combine thermodynamic parameters, chemical probing data (DMS, SHAPE), and co-evolutionary data (Direct Coupling Analysis, DCA) through a network that outputs perturbations to the ensemble free energy. Perturbations are trained to increase the ensemble populations of a representative set of known native RNA structures. In the chemical probing nodes of the network, a convolutional window combines neighboring reactivities, enlightening their structural information content and the contribution of local conformational ensembles. Regularization is used to limit overfitting and improve transferability. The most transferable model is selected through a cross-validation strategy that estimates the performance of models on systems on which they are not trained. With the selected model we obtain increased ensemble populations for native structures and more accurate predictions in an independent validation set. The flexibility of the approach allows the model to be easily retrained and adapted to incorporate arbitrary experimental information.
The spread of fake news, especially on online social networks, has become a matter of concern in the last few years. These platforms are also used for propagating other important authentic information. Thus, there is a need for mitigating fake news w
ithout significantly influencing the spread of real news. We leverage users inherent capabilities of identifying fake news and propose a warning-based control mechanism to curb this spread. Warnings are based on previous users responses that indicate the authenticity of the news. We use population-size dependent continuous-time multi-type branching processes to describe the spreading under the warning mechanism. We also have new results towards these branching processes. The (time) asymptotic proportions of the individual populations are derived. These results are instrumental in deriving relevant type-1, type-2 performance measures, and formulating an optimization problem to design optimal warning parameters. The fraction of copies tagged as real (fake) are considered for the type-1 (type-2) performance. We derive structural properties of the performance, which help simplify the optimization problem. We finally demonstrate that the optimal warning mechanism effectively mitigates fake news, with negligible influences on the propagation of authentic news. We validate performance measures using Monte Carlo simulations on ego-network database related to Twitter.
The mining of graphs in terms of their local substructure is a well-established methodology to analyze networks. It was hypothesized that motifs - subgraph patterns which appear significantly more often than expected at random - play a key role for t
he ability of a system to perform its task. Yet the framework commonly used for motif-detection averages over the local environments of all nodes. Therefore, it remains unclear whether motifs are overrepresented in the whole system or only in certain regions. In this contribution, we overcome this limitation by mining node-specific triad patterns. For every vertex, the abundance of each triad pattern is considered only in triads it participates in. We investigate systems of various fields and find that motifs are distributed highly heterogeneously. In particular we focus on the feed-forward loop motif which has been alleged to play a key role in biological networks.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
