scholarly journals From temporal network data to the dynamics of social relationships

2021 ◽  
Author(s):  
Valeria Gelardi ◽  
Alain Barrat ◽  
Nicolas Claidière

Networks are well-established representations of social systems, and temporal networks are widely used to study their dynamics. Temporal network data often consist in a succession of static networks over consecutive time windows whose length, however, is arbitrary, not necessarily corresponding to any intrinsic timescale of the system. Moreover, the resulting view of social network evolution is unsatisfactory: short time windows contain little information, whereas aggregating over large time windows blurs the dynamics. Going from a temporal network to a meaningful evolving representation of a social network therefore remains a challenge. Here we introduce a framework to that purpose: transforming temporal network data into an evolving weighted network where the weights of the links between individuals are updated at every interaction. Most importantly, this transformation takes into account the interdependence of social relationships due to the finite attention capacities of individuals: each interaction between two individuals not only reinforces their mutual relationship but also weakens their relationships with others. We study a concrete example of such a transformation and apply it to several data sets of social interactions. Using temporal contact data collected in schools, we show how our framework highlights specificities in their structure and temporal organization. We then introduce a synthetic perturbation into a data set of interactions in a group of baboons to show that it is possible to detect a perturbation in a social group on a wide range of timescales and parameters. Our framework brings new perspectives to the analysis of temporal social networks.

2021 ◽  
Vol 288 (1959) ◽  
Author(s):  
Valeria Gelardi ◽  
Didier Le Bail ◽  
Alain Barrat ◽  
Nicolas Claidiere

Networks are well-established representations of social systems, and temporal networks are widely used to study their dynamics. However, going from temporal network data (i.e. a stream of interactions between individuals) to a representation of the social group’s evolution remains a challenge. Indeed, the temporal network at any specific time contains only the interactions taking place at that time and aggregating on successive time-windows also has important limitations. Here, we present a new framework to study the dynamic evolution of social networks based on the idea that social relationships are interdependent: as the time we can invest in social relationships is limited, reinforcing a relationship with someone is done at the expense of our relationships with others. We implement this interdependence in a parsimonious two-parameter model and apply it to several human and non-human primates’ datasets to demonstrate that this model detects even small and short perturbations of the networks that cannot be detected using the standard technique of successive aggregated networks. Our model solves a long-standing problem by providing a simple and natural way to describe the dynamic evolution of social networks, with far-reaching consequences for the study of social networks and social evolution.


E-Marketing ◽  
2012 ◽  
pp. 185-197
Author(s):  
Przemyslaw Kazienko ◽  
Piotr Doskocz ◽  
Tomasz Kajdanowicz

The chapter describes a method how to perform a classification task without any demographic features and based only on the social network data. The concept of such collective classification facilitates to identify potential customers by means of services used or products purchased by the current customers, i.e. classes they belong to as well as using social relationships between the known and potential customers. As a result, a personalized offer can be prepared for the new clients. This innovative marketing method can boost targeted marketing campaigns.


Author(s):  
Przemyslaw Kazienko ◽  
Piotr Doskocz ◽  
Tomasz Kajdanowicz

The chapter describes a method how to perform a classification task without any demographic features and based only on the social network data. The concept of such collective classification facilitates to identify potential customers by means of services used or products purchased by the current customers, i.e. classes they belong to as well as using social relationships between the known and potential customers. As a result, a personalized offer can be prepared for the new clients. This innovative marketing method can boost targeted marketing campaigns.


2020 ◽  
Author(s):  
Daniel W. Franks ◽  
Michael N. Weiss ◽  
Matthew J. Silk ◽  
Robert J. Y. Perryman ◽  
Darren. P. Croft

AbstractBecause of the nature of social interaction or association data, when testing hypotheses using social network data it is common for network studies to rely on permutations to control for confounding variables, and to not also control for them in the fitted statistical model. This can be a problem because it does not adjust for any bias in effect sizes generated by these confounding effects, and thus the effect sizes are not informative in the presence of counfouding variables.We implemented two network simulation examples and analysed an empirical data set to demonstrate how relying solely on permutations to control for confounding variables can result in highly biased effect size estimates of animal social preferences that are uninformative when quantifying differences in behaviour.Using these simulations, we show that this can sometimes even lead to effect sizes that have the wrong sign and are thus the effect size is not biologically interpretable. We demonstrate how this problem can be addressed by controlling for confounding variables in the statistical dyadic or nodal model.We recommend this approach should be adopted as standard practice in the statistical analysis of animal social network data.


2019 ◽  
Vol 6 (1) ◽  
Author(s):  
Luca Pappalardo ◽  
Paolo Cintia ◽  
Alessio Rossi ◽  
Emanuele Massucco ◽  
Paolo Ferragina ◽  
...  

Abstract Soccer analytics is attracting increasing interest in academia and industry, thanks to the availability of sensing technologies that provide high-fidelity data streams for every match. Unfortunately, these detailed data are owned by specialized companies and hence are rarely publicly available for scientific research. To fill this gap, this paper describes the largest open collection of soccer-logs ever released, containing all the spatio-temporal events (passes, shots, fouls, etc.) that occured during each match for an entire season of seven prominent soccer competitions. Each match event contains information about its position, time, outcome, player and characteristics. The nature of team sports like soccer, halfway between the abstraction of a game and the reality of complex social systems, combined with the unique size and composition of this dataset, provide an ideal ground for tackling a wide range of data science problems, including the measurement and evaluation of performance, both at individual and at collective level, and the determinants of success and failure.


Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-15
Author(s):  
Shun Cao ◽  
Hiroki Sayama

Many temporal networks exhibit multiple system states, such as weekday and weekend patterns in social contact networks. The detection of such distinct states in temporal network data has recently been studied as it helps reveal underlying dynamical processes. A commonly used method is network aggregation over a time window, which aggregates a subsequence of multiple network snapshots into one static network. This method, however, necessarily discards temporal dynamics within the time window. Here we propose a new method for detecting dynamic states in temporal networks using connection series (i.e., time series of connection status) between nodes. Our method consists of the construction of connection series tensors over nonoverlapping time windows, similarity measurement between these tensors, and community detection in the similarity network of those time windows. Experiments with empirical temporal network data demonstrated that our method outperformed the conventional approach using simple network aggregation in revealing interpretable system states. In addition, our method allows users to analyze hierarchical temporal structures and to uncover dynamic states at different spatial/temporal resolutions.


Author(s):  
Preeti Gupta ◽  
Vishal Bhatnagar

The social network analysis is of significant interest in various application domains due to its inherent richness. Social network analysis like any other data analysis is limited by the quality and quantity of data and for which data preprocessing plays the key role. Before the discovery of useful information or pattern from the social network data set, the original data set must be converted to a suitable format. In this chapter we present various phases of social network data preprocessing. In this context, the authors discuss various challenges in each phase. The goal of this chapter is to illustrate the importance of data preprocessing for social network analysis.


2021 ◽  
Author(s):  
Abigail Z. Jacobs ◽  
Duncan J. Watts

Theories of organizations are sympathetic to long-standing ideas from network science that organizational networks should be regarded as multiscale and capable of displaying emergent properties. However, the historical difficulty of collecting individual-level network data for many (N ≫ 1) organizations, each of which comprises many (n ≫ 1) individuals, has hobbled efforts to develop specific, theoretically motivated hypotheses connecting micro- (i.e., individual-level) network structure with macro-organizational properties. In this paper we seek to stimulate such efforts with an exploratory analysis of a unique data set of aggregated, anonymized email data from an enterprise email system that includes 1.8 billion messages sent by 1.4 million users from 65 publicly traded U.S. firms spanning a wide range of sizes and 7 industrial sectors. We uncover wide heterogeneity among firms with respect to all measured network characteristics, and we find robust network and organizational variation as a result of size. Interestingly, we find no clear associations between organizational network structure and firm age, industry, or performance; however, we do find that centralization increases with geographical dispersion—a result that is not explained by network size. Although preliminary, these results raise new questions for organizational theory as well as new issues for collecting, processing, and interpreting digital network data. This paper was accepted by David Simchi-Levi, Special Issue of Management Science: 65th Anniversary.


Author(s):  
Jonathan F. Donges ◽  
Jakob H. Lochner ◽  
Niklas H. Kitzmann ◽  
Jobst Heitzig ◽  
Sune Lehmann ◽  
...  

AbstractSpreading dynamics and complex contagion processes on networks are important mechanisms underlying the emergence of critical transitions, tipping points and other non-linear phenomena in complex human and natural systems. Increasing amounts of temporal network data are now becoming available to study such spreading processes of behaviours, opinions, ideas, diseases and innovations to test hypotheses regarding their specific properties. To this end, we here present a methodology based on dose–response functions and hypothesis testing using surrogate data models that randomise most aspects of the empirical data while conserving certain structures relevant to contagion, group or homophily dynamics. We demonstrate this methodology for synthetic temporal network data of spreading processes generated by the adaptive voter model. Furthermore, we apply it to empirical temporal network data from the Copenhagen Networks Study. This data set provides a physically-close-contact network between several hundreds of university students participating in the study over the course of 3 months. We study the potential spreading dynamics of the health-related behaviour “regularly going to the fitness studio” on this network. Based on a hierarchy of surrogate data models, we find that our method neither provides significant evidence for an influence of a dose–response-type network spreading process in this data set, nor significant evidence for homophily. The empirical dynamics in exercise behaviour are likely better described by individual features such as the disposition towards the behaviour, and the persistence to maintain it, as well as external influences affecting the whole group, and the non-trivial network structure. The proposed methodology is generic and promising also for applications to other temporal network data sets and traits of interest.


Information ◽  
2020 ◽  
Vol 11 (6) ◽  
pp. 306
Author(s):  
Nikolaus Nova Parulian ◽  
Tiffany Lu ◽  
Shubhanshu Mishra ◽  
Mihai Avram ◽  
Jana Diesner

Observed social networks are often considered as proxies for underlying social networks. The analysis of observed networks oftentimes involves the identification of influential nodes via various centrality measures. This paper brings insights from research on adversarial attacks on machine learning systems to the domain of social networks by studying strategies by which an adversary can minimally perturb the observed network structure to achieve their target function of modifying the ranking of a target node according to centrality measures. This can represent the attempt of an adversary to boost or demote the degree to which others perceive individual nodes as influential or powerful. We study the impact of adversarial attacks on targets and victims, and identify metric-based security strategies to mitigate such attacks. We conduct a series of controlled experiments on synthetic network data to identify attacks that allow the adversary to achieve their objective with a single move. We then replicate the experiments with empirical network data. We run our experiments on common network topologies and use common centrality measures. We identify a small set of moves that result in the adversary achieving their objective. This set is smaller for decreasing centrality measures than for increasing them. For both synthetic and empirical networks, we observe that larger networks are less prone to adversarial attacks than smaller ones. Adversarial moves have a higher impact on cellular and small-world networks, while random and scale-free networks are harder to perturb. Also, empirical networks are harder to attack than synthetic networks. Using correlation analysis on our experimental results, we identify how combining measures with low correlation can aid in reducing the effectiveness of adversarial moves. Our results also advance the knowledge about the robustness of centrality measures to network perturbations. The notion of changing social network data to yield adversarial outcomes has practical implications, e.g., for information diffusion on social media, influence and power dynamics in social systems, and developing solutions to improving network security.


Sign in / Sign up

Export Citation Format

Share Document