اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDetecting Communities in a Gossip Model with Stubborn Agents
115
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We consider a community detection problem in a gossip model, where agents randomly interact pairwise, with stubborn agents never changing their states. It is assumed that the agents can be divided into two communities based on their interaction probability with others. Such a model can illustrate how disagreement and opinion fluctuation arise in a social network. The considered problem is twofold: to infer which community each agent belongs to, and to estimate interaction probabilities between agents, by only observing their state evolution. First, stability and limit theorems of the model are derived. An integrated detection and estimation algorithm is then proposed to infer the two communities and to estimate the interaction probabilities, based on agent states. It is verified that the community detector of the algorithm converges in finite time, and the interaction estimator converges almost surely. In addition, non-asymptotic property is obtained for the former, and convergence rate is analyzed for the latter. Simulations are presented to illustrate the performance of the proposed algorithm.
قيم البحث
اقرأ أيضاً
We consider a community detection problem for gossip dynamics with stubborn agents in this paper. It is assumed that the communication probability matrix for agent pairs has a block structure. More specifically, we assume that the network can be divi
ded into two communities, and the communication probability of two agents depends on whether they are in the same community. Stability of the model is investigated, and expectation of stationary distribution is characterized, indicating under the block assumption, the stationary behaviors of agents in the same community are similar. It is also shown that agents in different communities display distinct behaviors if and only if state averages of stubborn agents in different communities are not identical. A community detection algorithm is then proposed to recover community structure and to estimate communication probability parameters. It is verified that the community detection part converges in finite time, and the parameter estimation part converges almost surely. Simulations are given to illustrate algorithm performance.
We consider optimizing the placement of stubborn agents in a social network in order to maximally influence the population. We assume individuals in a directed social network each have a latent opinion that evolves over time in response to social med
ia posts by their neighbors. The individuals randomly communicate noi
This paper studies regulated state synchronization of homogeneous networks of non-introspective agents in presence of unknown nonuniform input delays. A scale-free protocol is designed based on additional information exchange, which does not need any
knowledge of the directed network topology and the spectrum of the associated Laplacian matrix. The proposed protocol is scalable and achieves state synchronization for any arbitrary number of agents. Meanwhile, an upper bound for the input delay tolerance is obtained, which explicitly depends on the agent dynamics.
This paper studies regulated state synchronization of discrete-time homogeneous networks of non-introspective agents in presence of unknown non-uniform input delays. A scale free protocol is designed based on additional information exchange, which do
es not need any knowledge of the directed network topology and the spectrum of the associated Laplacian matrix. The proposed protocol is scalable and achieves state synchronization for any arbitrary number of agents. Meanwhile, an upper bound for the input delay tolerance is obtained, which explicitly depends on the agent dynamics.
The ionosphere is the propagation medium for radio waves transmitted by an over-the-horizon radar (OTHR). Ionospheric parameters, typically, virtual ionospheric heights (VIHs), are required to perform coordinate registration for OTHR multitarget trac
king and localization. The inaccuracy of ionospheric parameters has a significant deleterious effect on the target localization of OTHR. Therefore, to improve the localization accuracy of OTHR, it is important to develop accurate models and estimation methods of ionospheric parameters and the corresponding target tracking algorithms. In this paper, we consider the variation of the ionosphere with location and the spatial correlation of the ionosphere in OTHR target tracking. We use a Gaussian Markov random field (GMRF) to model the VIHs, providing a more accurate representation of the VIHs for OTHR target tracking. Based on expectation-conditional maximization and GMRF modeling of the VIHs, we propose a novel joint optimization solution, called ECM-GMRF, to perform target state estimation, multipath data association and VIHs estimation simultaneously. In ECM-GMRF, the measurements from both ionosondes and OTHR are exploited to estimate the VIHs, leading to a better estimation of the VIHs which improves the accuracy of data association and target state estimation, and vice versa. The simulation indicates the effectiveness of the proposed algorithm.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
