اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAnalysis of data in the form of graphs
454
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We discuss the problem of extending data mining approaches to cases in which data points arise in the form of individual graphs. Being able to find the intrinsic low-dimensionality in ensembles of graphs can be useful in a variety of modeling contexts, especially when coarse-graining the detailed graph information is of interest. One of the main challenges in mining graph data is the definition of a suitable pairwise similarity metric in the space of graphs. We explore two practical solutions to solving this problem: one based on finding subgraph densities, and one using spectral information. The approach is illustrated on three test data sets (ensembles of graphs); two of these are obtained from standard graph generating algorithms, while the graphs in the third example are sampled as dynamic snapshots from an evolving network simulation.
قيم البحث
اقرأ أيضاً
Recent empirical observations suggest a heterogeneous nature of human activities. The heavy-tailed inter-event time distribution at population level is well accepted, while whether the individual acts in a heterogeneous way is still under debate. Mot
ivated by the impact of temporal heterogeneity of human activities on epidemic spreading, this paper studies the susceptible-infected model on a fully mixed population, where each individual acts in a completely homogeneous way but different individuals have different mean activities. Extensive simulations show that the heterogeneity of activities at population level remarkably affects the speed of spreading, even though each individual behaves regularly. Further more, the spreading speed of this model is more sensitive to the change of system heterogeneity compared with the model consisted of individuals acting with heavy-tailed inter-event time distribution. This work refines our understanding of the impact of heterogeneous human activities on epidemic spreading.
We introduce a contrarian opinion (CO) model in which a fraction p of contrarians within a group holds a strong opinion opposite to the opinion held by the rest of the group. At the initial stage, stable clusters of two opinions, A and B exist. Then
we introduce contrarians which hold a strong B opinion into the opinion A group. Through their interactions, the contrarians are able to decrease the size of the largest A opinion cluster, and even destroy it. We see this kind of method in operation, e.g when companies send free new products to potential customers in order to convince them to adopt the product and influence others. We study the CO model, using two different strategies, on both ER and scale-free networks. In strategy I, the contrarians are positioned at random. In strategy II, the contrarians are chosen to be the highest degrees nodes. We find that for both strategies the size of the largest A cluster decreases to zero as p increases as in a phase transition. At a critical threshold value p_c the system undergoes a second-order phase transition that belongs to the same universality class of mean field percolation. We find that even for an ER type model, where the degrees of the nodes are not so distinct, strategy II is significantly more effctive in reducing the size of the largest A opinion cluster and, at very small values of p, the largest A opinion cluster is destroyed.
Recent studies have shown that a system composed from several randomly interdependent networks is extremely vulnerable to random failure. However, real interdependent networks are usually not randomly interdependent, rather a pair of dependent nodes
are coupled according to some regularity which we coin inter-similarity. For example, we study a system composed from an interdependent world wide port network and a world wide airport network and show that well connected ports tend to couple with well connected airports. We introduce two quantities for measuring the level of inter-similarity between networks (i) Inter degree-degree correlation (IDDC) (ii) Inter-clustering coefficient (ICC). We then show both by simulation models and by analyzing the port-airport system that as the networks become more inter-similar the system becomes significantly more robust to random failure.
The problem of reconstructing nonlinear and complex dynamical systems from measured data or time series is central to many scientific disciplines including physical, biological, computer, and social sciences, as well as engineering and economics. In
this paper, we review the recent advances in this forefront and rapidly evolving field, aiming to cover topics such as compressive sensing (a novel optimization paradigm for sparse-signal reconstruction), noised-induced dynamical mapping, perturbations, reverse engineering, synchronization, inner composition alignment, global silencing, Granger Causality and alternative optimization algorithms. Often, these rely on various concepts from statistical and nonlinear physics such as phase transitions, bifurcation, stabilities, and robustness. The methodologies have the potential to significantly improve our ability to understand a variety of complex dynamical systems ranging from gene regulatory systems to social networks towards the ultimate goal of controlling such systems. Despite recent progress, many challenges remain. A purpose of this Review is then to point out the specific difficulties as they arise from different contexts, so as to stimulate further efforts in this interdisciplinary field.
When the data do not conform to the hypothesis of a known sampling-variance, the fitting of a constant to a set of measured values is a long debated problem. Given the data, fitting would require to find what measurand value is the most trustworthy.
Bayesian inference is here reviewed, to assign probabilities to the possible measurand values. Different hypothesis about the data variance are tested by Bayesian model comparison. Eventually, model selection is exemplified in deriving an estimate of the Planck constant.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
