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

On the dual nature of adoption processes in complex networks

80   0   0.0 ( 0 )
 نشر من قبل Iacopo Iacopini
 تاريخ النشر 2021
والبحث باللغة English




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

Adoption processes in socio-technological systems have been widely studied both empirically and theoretically. The way in which social norms, behaviors, and even items such as books, music, or other commercial or technological product spread in a population is usually modeled as a process of social contagion, in which the agents of a social system can infect their neighbors on the underlying network of social contacts. More recently, various models have also been proposed to reproduce the typical dynamics of a process of discovery, in which an agent explores a space of relations between ideas or items in search for novelties. In both types of processes, the structure of the underlying networks, respectively, the network of social contacts in the first case, and the network of relations among items in the second one, plays a fundamental role. However, the two processes have been traditionally seen and studied independently. Here, we provide a brief overview of the existing models of social spreading and exploration and of the latest advancements in both directions. We propose to look at them as two complementary aspects of the same adoption process: on the one hand, there are items spreading over a social network of individuals influencing each other, and on the other hand, individuals explore a network of similarities among items to adopt. The two-fold nature of the approach proposed opens up new stimulating challenges for the scientific community of network and data scientists. We conclude by outlining some possible directions that we believe may be relevant to be explored in the coming years.



قيم البحث

اقرأ أيضاً

Innovation is the driving force of human progress. Recent urn models reproduce well the dynamics through which the discovery of a novelty may trigger further ones, in an expanding space of opportunities, but neglect the effects of social interactions . Here we focus on the mechanisms of collective exploration and we propose a model in which many urns, representing different explorers, are coupled through the links of a social network and exploit opportunities coming from their contacts. We study different network structures showing, both analytically and numerically, that the pace of discovery of an explorer depends on its centrality in the social network. Our model sheds light on the role that social structures play in discovery processes.
The study of motifs in networks can help researchers uncover links between the structure and function of networks in biology, sociology, economics, and many other areas. Empirical studies of networks have identified feedback loops, feedforward loops, and several other small structures as motifs that occur frequently in real-world networks and may contribute by various mechanisms to important functions in these systems. However, these mechanisms are unknown for many of these motifs. We propose to distinguish between structure motifs (i.e., graphlets) in networks and process motifs (which we define as structured sets of walks) on networks and consider process motifs as building blocks of processes on networks. Using the steady-state covariances and steady-state correlations in a multivariate Ornstein--Uhlenbeck process on a network as examples, we demonstrate that the distinction between structure motifs and process motifs makes it possible to gain quantitative insights into mechanisms that contribute to important functions of dynamical systems on networks.
In this paper, we explore the relationship between the topological characteristics of a complex network and its robustness to sustained targeted attacks. Using synthesised scale-free, small-world and random networks, we look at a number of network me asures, including assortativity, modularity, average path length, clustering coefficient, rich club profiles and scale-free exponent (where applicable) of a network, and how each of these influence the robustness of a network under targeted attacks. We use an established robustness coefficient to measure topological robustness, and consider sustained targeted attacks by order of node degree. With respect to scale-free networks, we show that assortativity, modularity and average path length have a positive correlation with network robustness, whereas clustering coefficient has a negative correlation. We did not find any correlation between scale-free exponent and robustness, or rich-club profiles and robustness. The robustness of small-world networks on the other hand, show substantial positive correlations with assortativity, modularity, clustering coefficient and average path length. In comparison, the robustness of Erdos-Renyi random networks did not have any significant correlation with any of the network properties considered. A significant observation is that high clustering decreases topological robustness in scale-free networks, yet it increases topological robustness in small-world networks. Our results highlight the importance of topological characteristics in influencing network robustness, and illustrate design strategies network designers can use to increase the robustness of scale-free and small-world networks under sustained targeted attacks.
In this work, we investigate a heterogeneous population in the modified Hegselmann-Krause opinion model on complex networks. We introduce the Shannon information entropy about all relative opinion clusters to characterize the cluster profile in the f inal configuration. Independent of network structures, there exists the optimal stubbornness of one subpopulation for the largest number of clusters and the highest entropy. Besides, there is the optimal bounded confidence (or subpopulation ratio) of one subpopulation for the smallest number of clusters and the lowest entropy. However, network structures affect cluster profiles indeed. A large average degree favors consensus for making different networks more similar with complete graphs. The network size has limited impact on cluster profiles of heterogeneous populations on scale-free networks but has significant effects upon those on small-world networks.
A bridge in a graph is an edge whose removal disconnects the graph and increases the number of connected components. We calculate the fraction of bridges in a wide range of real-world networks and their randomized counterparts. We find that real netw orks typically have more bridges than their completely randomized counterparts, but very similar fraction of bridges as their degree-preserving randomizations. We define a new edge centrality measure, called bridgeness, to quantify the importance of a bridge in damaging a network. We find that certain real networks have very large average and variance of bridgeness compared to their degree-preserving randomizations and other real networks. Finally, we offer an analytical framework to calculate the bridge fraction , the average and variance of bridgeness for uncorrelated random networks with arbitrary degree distributions.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

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