اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDynamic Network Models
511
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We analyze random networks that change over time. First we analyze a dynamic Erdos-Renyi model, whose edges change over time. We describe its stationary distribution, its convergence thereto, and the SI contact process on the network, which has relevance for connectivity and the spread of infections. Second, we analyze the effect of node turnover, when nodes enter and leave the network, which has relevance for network models incorporating births, deaths, aging, and other demographic factors.
قيم البحث
اقرأ أيضاً
Non-Markovian processes are widespread in natural and human-made systems, yet explicit model- ling and analysis of such systems is underdeveloped. We consider a non-Markovian dynamic network with random link activation and deletion (RLAD) and heavy t
ailed Mittag-Leffler distribution for the inter-event times. We derive an analytically and computationally tractable system of Kolmogorov- like forward equations utilising the Caputo derivative for the probability of having a given number of active links in the network and solve them. Simulations for the RLAD are also studied for power-law inter-event times and we show excellent agreement with the Mittag-Leffler model. This agreement holds even when the RLAD network dynamics is coupled with the susceptible-infected-susceptible (SIS) spreading dynamics. Thus, the analytically solvable Mittag-Leffler model provides an excel- lent approximation to the case when the network dynamics is characterised by power-law distributed inter-event times. We further discuss possible generalizations of our result.
We derive asymptotic properties for a stochastic dynamic network model in a stochastic dynamic population. In the model, nodes give birth to new nodes until they die, each node being equipped with a social index given at birth. During the life of a n
ode it creates edges to other nodes, nodes with high social index at higher rate, and edges disappear randomly in time. For this model we derive criterion for when a giant connected component exists after the process has evolved for a long period of time, assuming the node population grows to infinity. We also obtain an explicit expression for the degree correlation $rho$ (of neighbouring nodes) which shows that $rho$ is always positive irrespective of parameter values in one of the two treated submodels, and may be either positive or negative in the other model, depending on the parameters.
Models of complex networks often incorporate node-intrinsic properties abstracted as hidden variables. The probability of connections in the network is then a function of these variables. Real-world networks evolve over time, and many exhibit dynamic
s of node characteristics as well as of linking structure. Here we introduce and study natural temporal extensions of static hidden-variable network models with stochastic dynamics of hidden variables and links. The rates of the hidden variable dynamics and link dynamics are controlled by two parameters, and snapshots of networks in the dynamic models may or may not be equivalent to a static model, depending on the location in the parameter phase diagram. We quantify deviations from static-like behavior, and examine the level of structural persistence in the considered models. We explore tempor
To analyze whole-genome genetic data inherited in families, the likelihood is typically obtained from a Hidden Markov Model (HMM) having a state space of 2^n hidden states where n is the number of meioses or edges in the pedigree. There have been sev
eral attempts to speed up this calculation by reducing the state-space of the HMM. One of these methods has been automated in a calculation that is more efficient than the naive HMM calculation; however, that method treats a special case and the efficiency gain is available for only those rare pedigrees containing long chains of single-child lineages. The other existing state-space reduction method treats the general case, but the existing algorithm has super-exponential running time. We present three formulations of the state-space reduction problem, two dealing with groups and one with partitions. One of these problems, the maximum isometry group problem was discussed in detail by Browning and Browning. We show that for pedigrees, all three of these problems have identical solutions. Furthermore, we are able to prove the uniqueness of the solution using the algorithm that we introduce. This algorithm leverages the insight provided by the equivalence between the partition and group formulations of the problem to quickly find the optimal state-space reduction for general pedigrees. We propose a new likelihood calculation which is a two-stage process: find the optimal state-space, then run the HMM forward-backward algorithm on the optimal state-space. In comparison with the one-stage HMM calculation, this new method more quickly calculates the exact pedigree likelihood.
Bayesian networks are a versatile and powerful tool to model complex phenomena and the interplay of their components in a probabilistically principled way. Moving beyond the comparatively simple case of completely observed, static data, which has rec
eived the most attention in the literature, in this paper we will review how Bayesian networks can model dynamic data and data with incomplete observations. Such data are the norm at the forefront of research and in practical applications, and Bayesian networks are uniquely positioned to model them due to their explainability and interpretability.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
