Social Networks and the Ecology of Crime: Using Social Network Data to Understand the Spatial Distribution of Crime

Author(s):  
George E. Tita ◽  
Adam Boessen
2014 ◽  
Vol 2014 (4) ◽  
pp. 146-152 ◽  
Author(s):  
Александр Подвесовский ◽  
Aleksandr Podvesovskiy ◽  
Дмитрий Будыльский ◽  
Dmitriy Budylskiy

An opinion mining monitoring model for social networks introduced. The model includes text mining processing over social network data and uses sentiment analysis approach in particular. Practical usage results of software implementation and its requirements described as well as further research directions.


Author(s):  
Ryan Light ◽  
James Moody

This chapter presents an introduction to the basic concepts central to social network analysis. Written for those with little experience in the approach, the chapter aims to provide the necessary tools to dig deeper into exploring social networks via the subsequent chapters in this volume. It begins by introducing the building blocks of networks—nodes and edges—and their characteristics. Next, it outlines several of the major dimensions of network analysis, including the implications of boundary specification and levels of analysis. It also briefly introduces statistical approaches to networks and network data collection. The chapter concludes with a discussion of ethical issues that arise when collecting and analyzing social network data.


2021 ◽  
pp. 1-15
Author(s):  
Heather Mattie ◽  
Jukka-Pekka Onnela

Abstract With the increasing availability of behavioral data from diverse digital sources, such as social media sites and cell phones, it is now possible to obtain detailed information about the structure, strength, and directionality of social interactions in varied settings. While most metrics of network structure have traditionally been defined for unweighted and undirected networks only, the richness of current network data calls for extending these metrics to weighted and directed networks. One fundamental metric in social networks is edge overlap, the proportion of friends shared by two connected individuals. Here, we extend definitions of edge overlap to weighted and directed networks and present closed-form expressions for the mean and variance of each version for the Erdős–Rényi random graph and its weighted and directed counterparts. We apply these results to social network data collected in rural villages in southern Karnataka, India. We use our analytical results to quantify the extent to which the average overlap of the empirical social network deviates from that of corresponding random graphs and compare the values of overlap across networks. Our novel definitions allow the calculation of edge overlap for more complex networks, and our derivations provide a statistically rigorous way for comparing edge overlap across networks.


Author(s):  
Mantian (Mandy) Hu

In the age of Big Data, the social network data collected by telecom operators are growing exponentially. How to exploit these data and mine value from them is an important issue. In this article, an accurate marketing strategy based on social network is proposed. The strategy intends to help telecom operators to improve their marketing efficiency. This method is based on mutual peers' influence in social network, by identifying the influential users (leaders). These users can promote the information diffusion prominently. A precise marketing is realized by taking advantage of the user's influence. Data were collected from China Mobile and analyzed. For the massive datasets, the Apache Spark was chosen for its good scalability, effectiveness and efficiency. The result shows a great increase of the telecom traffic, compared with the result without leader identification.


2017 ◽  
Vol 2 (2) ◽  
pp. 60
Author(s):  
Zainab Nayyar ◽  
Nousheen Hashmi ◽  
Nazish Rafique ◽  
Khurram Mahmood

The main purpose of analyzing the social network data is to observe the behaviors and trends that are followed by people. How people interact with each other, what they usually share, what are their interests on social networks, so that analysts can focus on new trends for the provision of those aspects which are of great interest for people so in this research article an easy approach of gathering and analyzing data through keyword based search in social networks is examined using NodeXL and data is gathered from twitter in which political trends have been analyzed. As a result the political trends among people are analyzed.


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.


Author(s):  
Janine Viol Hacker ◽  
Freimut Bodendorf ◽  
Pascal Lorenz

Enterprise Social Networks have a similar set of functionalities as social networking sites but are run as closed applications within a company's intranet. Interacting and communicating on the Enterprise Social Networks, the users, i.e. a company's employees, leave digital traces. The resulting digital record stored in the platform's back end bears great potential for enterprise big data engineering, analytics, and management. This book chapter provides an overview of research in the area of Enterprise Social Networks and categorizes Enterprise Social Network data based on typical functionalities of these platforms. It introduces exemplary metrics as well as a process for the analysis of ESN data. The resulting framework for the analysis of Enterprise Social Network data can serve as a guideline for researchers in the area of Enterprise Social Network analytics and companies interested in analyzing the data stored in the application's back end.


Author(s):  
Yamen Koubaa

The prediction of consumer behavior is largely based on the analysis of consumer data using statistics as a tool for prediction. Thanks to online social networks, large quantities of heterogeneous consumer data are now available at competitive costs. Though they have much in common with conventional data, online social network datasets display several different properties. The exploration of these unique properties is indispensable to insuring the accuracy of predictions and data analytics. This chapter presents online social data, discusses seven properties of online social network data, suggests some analysis tools, and draws implications regarding the use of social data analytics.


2003 ◽  
Vol 33 (1) ◽  
pp. 343-380 ◽  
Author(s):  
Kazuo Yamaguchi

This article introduces a modified Liang-Zeger method for the estimation of the variance-covariance matrix of parameter estimates for models of social network data that include variables to characterize dyadic nonindependence. While the pseudolikelihood method has been used recently to estimate parameters for such models, the issue of estimating their standard errors, or the variance-covariance matrix more generally, has been neglected. This article addresses the issue by proposing a method for such estimation and also presents an illustrative application of the method to empirical social network data.


Sign in / Sign up

Export Citation Format

Share Document