ترغب بنشر مسار تعليمي؟ اضغط هنا

Opinion Dynamics Incorporating Higher-Order Interactions

270   0   0.0 ( 0 )
 نشر من قبل Wanyue Xu
 تاريخ النشر 2021
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

The issue of opinion sharing and formation has received considerable attention in the academic literature, and a few models have been proposed to study this problem. However, existing models are limited to the interactions among nearest neighbors, ignoring those second, third, and higher-order neighbors, despite the fact that higher-order interactions occur frequently in real social networks. In this paper, we develop a new model for opinion dynamics by incorporating long-range interactions based on higher-order random walks. We prove that the model converges to a fixed opinion vector, which may differ greatly from those models without higher-order interactions. Since direct computation of the equilibrium opinion is computationally expensive, which involves the operations of huge-scale matrix multiplication and inversion, we design a theoretically convergence-guaranteed estimation algorithm that approximates the equilibrium opinion vector nearly linearly in both space and time with respect to the number of edges in the graph. We conduct extensive experiments on various social networks, demonstrating that the new algorithm is both highly efficient and effective.



قيم البحث

اقرأ أيضاً

One of the main subjects in the field of social networks is to quantify conflict, disagreement, controversy, and polarization, and some quantitative indicators have been developed to quantify these concepts. However, direct computation of these indic ators involves the operations of matrix inversion and multiplication, which make it computationally infeasible for large-scale graphs with millions of nodes. In this paper, by reducing the problem of computing relevant quantities to evaluating $ell_2$ norms of some vectors, we present a nearly linear time algorithm to estimate all these quantities. Our algorithm is based on the Laplacian solvers, and has a proved theoretical guarantee of error for each quantity. We execute extensive numerical experiments on a variety of real networks, which demonstrate that our approximation algorithm is efficient and effective, scalable to large graphs having millions of nodes.
The pervasive use of social media has grown to over two billion users to date, and is commonly utilized as a means to share information and shape world events. Evidence suggests that passive social media usage (i.e., viewing without taking action) ha s an impact on the users perspective. This empirical influence over perspective could have significant impact on social events. Therefore, it is important to understand how social media contributes to the formation of an individuals perspective. A set of experimental tasks were designed to investigate empirically derived thresholds for opinion formation as a result of passive interactions with different social media data types (i.e., videos, images, and messages). With a better understanding of how humans passively interact with social media information, a paradigm can be developed that allows the exploitation of this interaction and plays a significant role in future military plans and operations.
In social networks, interaction patterns typically change over time. We study opinion dynamics on tie-decay networks in which tie strength increases instantaneously when there is an interaction and decays exponentially between interactions. Specifica lly, we formulate continuous-time Laplacian dynamics and a discrete-time DeGroot model of opinion dynamics on these tie-decay networks, and we carry out numerical computations for the continuous-time Laplacian dynamics. We examine the speed of convergence by studying the spectral gaps of combinatorial Laplacian matrices of tie-decay networks. First, we compare the spectral gaps of the Laplacian matrices of tie-decay networks that we construct from empirical data with the spectral gaps for corresponding randomized and aggregate networks. We find that the spectral gaps for the empirical networks tend to be smaller than those for the randomized and aggregate networks. Second, we study the spectral gap as a function of the tie-decay rate and time. Intuitively, we expect small tie-decay rates to lead to fast convergence because the influence of each interaction between two nodes lasts longer for smaller decay rates. Moreover, as time progresses and more interactions occur, we expect eventual convergence. However, we demonstrate that the spectral gap need not decrease monotonically with respect to the decay rate or increase monotonically with respect to time. Our results highlight the importance of the interplay between the times that edges strengthen and decay in temporal networks.
Collective behavior plays a key role in the function of a wide range of physical, biological, and neurological systems where empirical evidence has recently uncovered the prevalence of higher-order interactions, i.e., structures that represent intera ctions between more than just two individual units, in complex network structures. Here, we study the optimization of collective behavior in networks with higher-order interactions encoded in clique complexes. Our approach involves adapting the Synchrony Alignment Function framework to a new composite Laplacian matrix that encodes multi-order interactions including, e.g., both dyadic and triadic couplings. We show that as higher-order coupling interactions are equitably strengthened, so that overall coupling is conserved, the optimal collective behavior improves. We find that this phenomenon stems from the broadening of a composite Laplacians eigenvalue spectrum, which improves the optimal collective behavior and widens the range of possible behaviors. Moreover, we find in constrained optimization scenarios that a nontrivial, ideal balance between the relative strengths of pair-wise and higher-order interactions leads to the strongest collective behavior supported by a network. This work provides insight into how systems balance interactions of different types to optimize or broaden their dynamical range of behavior, especially for self-regulating systems like the brain.
Peoples opinions evolve over time as they interact with their friends, family, colleagues, and others. In the study of opinion dynamics on networks, one often encodes interactions between people in the form of dyadic relationships, but many social in teractions in real life are polyadic (i.e., they involve three or more people). In this paper, we extend an asynchronous bounded-confidence model (BCM) on graphs, in which nodes are connected pairwise by edges, to an asynchronous BCM on hypergraphs, in which arbitrarily many nodes can be connected by a single hyperedge. We show that our hypergraph BCM converges to consensus under a wide range of initial conditions for the opinions of the nodes, including for non-uniform and asymmetric initial opinion distributions. We also show that, under suitable conditions, echo chambers can form on hypergraphs with community structure. We demonstrate that the opinions of individuals can sometimes jump from one opinion cluster to another in a single time step, a phenomenon (which we call ``opinion jumping) that is not possible in standard dyadic BCMs. Additionally, we observe that there is a phase transition in the convergence time on {a complete hypergraph} when the variance $sigma^2$ of the initial opinion distribution equals the confidence bound $c$. We prove that the convergence time grows at least exponentially fast with the number of nodes when $sigma^2 > c$ and the initial opinions are normally distributed. Therefore, to determine the convergence properties of our hypergraph BCM when the variance and the number of hyperedges are both large, it is necessary to use analytical methods instead of relying only on Monte Carlo simulations.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا