scholarly journals Cooperation, clustering, and assortative mixing in dynamic networks

2018 ◽  
Vol 115 (5) ◽  
pp. 951-956 ◽  
Author(s):  
David Melamed ◽  
Ashley Harrell ◽  
Brent Simpson

Humans’ propensity to cooperate is driven by our embeddedness in social networks. A key mechanism through which networks promote cooperation is clustering. Within clusters, conditional cooperators are insulated from exploitation by noncooperators, allowing them to reap the benefits of cooperation. Dynamic networks, where ties can be shed and new ties formed, allow for the endogenous emergence of clusters of cooperators. Although past work suggests that either reputation processes or network dynamics can increase clustering and cooperation, existing work on network dynamics conflates reputations and dynamics. Here we report results from a large-scale experiment (total n = 2,675) that embedded participants in clustered or random networks that were static or dynamic, with varying levels of reputational information. Results show that initial network clustering predicts cooperation in static networks, but not in dynamic ones. Further, our experiment shows that while reputations are important for partner choice, cooperation levels are driven purely by dynamics. Supplemental conditions confirmed this lack of a reputation effect. Importantly, we find that when participants make individual choices to cooperate or defect with each partner, as opposed to a single decision that applies to all partners (as is standard in the literature on cooperation in networks), cooperation rates in static networks are as high as cooperation rates in dynamic networks. This finding highlights the importance of structured relations for sustained cooperation, and shows how giving experimental participants more realistic choices has important consequences for whether dynamic networks promote higher levels of cooperation than static networks.

2022 ◽  
Vol 16 (1) ◽  
pp. 1-34
Author(s):  
Yiji Zhao ◽  
Youfang Lin ◽  
Zhihao Wu ◽  
Yang Wang ◽  
Haomin Wen

Dynamic networks are widely used in the social, physical, and biological sciences as a concise mathematical representation of the evolving interactions in dynamic complex systems. Measuring distances between network snapshots is important for analyzing and understanding evolution processes of dynamic systems. To the best of our knowledge, however, existing network distance measures are designed for static networks. Therefore, when measuring the distance between any two snapshots in dynamic networks, valuable context structure information existing in other snapshots is ignored. To guide the construction of context-aware distance measures, we propose a context-aware distance paradigm, which introduces context information to enrich the connotation of the general definition of network distance measures. A Context-aware Spectral Distance (CSD) is then given as an instance of the paradigm by constructing a context-aware spectral representation to replace the core component of traditional Spectral Distance (SD). In a node-aligned dynamic network, the context effectively helps CSD gain mainly advantages over SD as follows: (1) CSD is not affected by isospectral problems; (2) CSD satisfies all the requirements of a metric, while SD cannot; and (3) CSD is computationally efficient. In order to process large-scale networks, we develop a kCSD that computes top- k eigenvalues to further reduce the computational complexity of CSD. Although kCSD is a pseudo-metric, it retains most of the advantages of CSD. Experimental results in two practical applications, i.e., event detection and network clustering in dynamic networks, show that our context-aware spectral distance performs better than traditional spectral distance in terms of accuracy, stability, and computational efficiency. In addition, context-aware spectral distance outperforms other baseline methods.


Author(s):  
Yifeng Zhao ◽  
Xiangwei Wang ◽  
Hongxia Yang ◽  
Le Song ◽  
Jie Tang

Analyzing large-scale evolving graphs are crucial for understanding the dynamic and evolutionary nature of social networks. Most existing works focus on discovering repeated and consistent temporal patterns, however, such patterns cannot fully explain the complexity observed in dynamic networks. For example, in recommendation scenarios, users sometimes purchase products on a whim during a window shopping.Thus, in this paper, we design and implement a novel framework called BurstGraph which can capture both recurrent and consistent patterns, and especially unexpected bursty network changes. The performance of the proposed algorithm is demonstrated on both a simulated dataset and a world-leading E-Commerce company dataset, showing that they are able to discriminate recurrent events from extremely bursty events in terms of action propensity.


2020 ◽  
Vol 117 (37) ◽  
pp. 22787-22792 ◽  
Author(s):  
Alexander Ehlert ◽  
Martin Kindschi ◽  
René Algesheimer ◽  
Heiko Rauhut

While it is undeniable that the ability of humans to cooperate in large-scale societies is unique in animal life, it remains open how such a degree of prosociality is possible despite the risks of exploitation. Recent evidence suggests that social networks play a crucial role in the development of prosociality and large-scale cooperation by allowing cooperators to cluster; however, it is not well understood if and how this also applies to real-world social networks in the field. We study intrinsic social preferences alongside emerging friendship patterns in 57 freshly formed school classes (n = 1,217), using incentivized measures. We demonstrate the existence of cooperative clusters in society, examine their emergence, and expand the evidence from controlled experiments to real-world social networks. Our results suggest that being embedded in cooperative environments substantially enhances the social preferences of individuals, thus contributing to the formation of cooperative clusters. Partner choice, in contrast, only marginally contributes to their emergence. We conclude that cooperative preferences are contagious; social and cultural learning plays an important role in the development and evolution of cooperation.


2018 ◽  
Vol 9 (1) ◽  
pp. 117 ◽  
Author(s):  
Pieter Audenaert ◽  
Didier Colle ◽  
Mario Pickavet

Networks and graphs are highly relevant in modeling real-life communities and their interactions. In order to gain insight in their structure, different roles are attributed to vertices, effectively clustering them in equivalence classes. A new formal definition of regular equivalence is presented in this paper, and the relation with other equivalence types is investigated and mathematically proven. An efficient algorithm is designed, able to detect all regularly equivalent roles in large-scale complex networks. We apply it to both Barabási–Albert random networks, as well as real-life social networks, which leads to interesting insights.


2020 ◽  
Vol 20 (4) ◽  
pp. 1-24
Author(s):  
Weichao Gao ◽  
James Nguyen ◽  
Yalong Wu ◽  
William G. Hatcher ◽  
Wei Yu
Keyword(s):  

2021 ◽  
Vol 5 (1) ◽  
pp. 14
Author(s):  
Christos Makris ◽  
Georgios Pispirigos

Nowadays, due to the extensive use of information networks in a broad range of fields, e.g., bio-informatics, sociology, digital marketing, computer science, etc., graph theory applications have attracted significant scientific interest. Due to its apparent abstraction, community detection has become one of the most thoroughly studied graph partitioning problems. However, the existing algorithms principally propose iterative solutions of high polynomial order that repetitively require exhaustive analysis. These methods can undoubtedly be considered resource-wise overdemanding, unscalable, and inapplicable in big data graphs, such as today’s social networks. In this article, a novel, near-linear, and highly scalable community prediction methodology is introduced. Specifically, using a distributed, stacking-based model, which is built on plain network topology characteristics of bootstrap sampled subgraphs, the underlined community hierarchy of any given social network is efficiently extracted in spite of its size and density. The effectiveness of the proposed methodology has diligently been examined on numerous real-life social networks and proven superior to various similar approaches in terms of performance, stability, and accuracy.


2018 ◽  
Vol 2018 ◽  
pp. 1-22 ◽  
Author(s):  
Shuang Zhao ◽  
Xiapu Luo ◽  
Xiaobo Ma ◽  
Bo Bai ◽  
Yankang Zhao ◽  
...  

Proximity-based apps have been changing the way people interact with each other in the physical world. To help people extend their social networks, proximity-based nearby-stranger (NS) apps that encourage people to make friends with nearby strangers have gained popularity recently. As another typical type of proximity-based apps, some ridesharing (RS) apps allowing drivers to search nearby passengers and get their ridesharing requests also become popular due to their contribution to economy and emission reduction. In this paper, we concentrate on the location privacy of proximity-based mobile apps. By analyzing the communication mechanism, we find that many apps of this type are vulnerable to large-scale location spoofing attack (LLSA). We accordingly propose three approaches to performing LLSA. To evaluate the threat of LLSA posed to proximity-based mobile apps, we perform real-world case studies against an NS app named Weibo and an RS app called Didi. The results show that our approaches can effectively and automatically collect a huge volume of users’ locations or travel records, thereby demonstrating the severity of LLSA. We apply the LLSA approaches against nine popular proximity-based apps with millions of installations to evaluate the defense strength. We finally suggest possible countermeasures for the proposed attacks.


2011 ◽  
Vol 10 (4) ◽  
pp. 45-53 ◽  
Author(s):  
Nicholas D. Lane ◽  
Ye Xu ◽  
Hong Lu ◽  
Andrew T. Campbell ◽  
Tanzeem Choudhury ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document