Graph Theoretic Approaches For Analyzing Large Scale Social Networks

Social network analysis has created novel opportunities within the field of data science. The complexity of these networks requires new techniques to optimize the extraction of useful information. Graph Theoretic Approaches for Analyzing Large-Scale Social Networks is a pivotal reference source for the latest academic research on emerging algorithms and methods for the analysis of social networks. Highlighting a range of pertinent topics such as influence maximization, probabilistic exploration, and distributed memory, this book is ideally designed for academics, graduate students, professionals, and practitioners actively involved in the field of data science.

Social network analysis increasingly bridges the discovery of patterns in diverse areas of study as more data becomes available and complex. Yet the construction of huge networks from large data often requires entirely different approaches for analysis including; graph theory, statistics, machine learning and data mining. This work covers frontier studies on social network analysis and mining from different perspectives such as social network sites, financial data, e-mails, forums, academic research funds, XML technology, blog content, community detection and clique finding, prediction of user’s- behavior, privacy in social network analysis, mobility from spatio-temporal point of view, agent technology and political parties in parliament. These topics will be of interest to researchers and practitioners from different disciplines including, but not limited to, social sciences and engineering.

This brief textbook explains the principles of social network analysis. The book goes beyond theoretical concepts and gives the reader complete knowledge about how to apply analytical techniques using Pajek to perform a large-scale network analysis. The book covers the topic in 2 sections – the first detailing fundamentals of research design and the next one about methods and applications. Readers can then apply the techniques in this book to other online communities, such as Facebook and Twitter. The book is intended for networking students and general readers who want to learn the basics without going deep into mathematical methods. It is also useful for researchers and professionals from other fields seeking to understand the basics of large-scale social network analysis.

Due to the growing use of web applications and communication devices, the use of data has increased throughout various industries. It is necessary to develop new techniques for managing data in order to ensure adequate usage. The Handbook of Research on Pattern Engineering System Development for Big Data Analytics is a critical scholarly resource that examines the incorporation of pattern management in business technologies as well as decision making and prediction process through the use of data management and analysis. Featuring coverage on a broad range of topics such as business intelligence, feature extraction, and data collection, this publication is geared towards professionals, academicians, practitioners, and researchers seeking current research on the development of pattern management systems for business applications.

The book studies the existing and potential connections between Social Network Analysis (SNA) and Formal Concept Analysis (FCA) by showing how standard SNA techniques, usually based on graph theory, can be supplemented by FCA methods, which rely on lattice theory. The book presents contributions to the following areas: acquisition of terminological knowledge from social networks, knowledge communities, individuality computation, other types of FCA-based analysis of bipartite graphs (two-mode networks), multimodal clustering, community detection and description in one-mode and multi-mode networks, adaptation of the dual-projection approach to weighted bipartite graphs, extensions to the Kleinberg's HITS algorithm as well as attributed graph analysis.

This book provides a comprehensive introduction to the use of graph analysis in the study of social media and digital media. It covers the following topics: graphs in social media, graph theory, algebraic analysis of graphs, graph clustering, diffusion in social media, label propagation in graphs, graphs in pattern recognition and machine learning, tensors in graph analysis, recommendation systems based on hypergraphs, big data approaches for social media and graph clustering and graph-based approaches for evolving social data.

This book presents a foray into the fascinating process of risk management, beginning from classical methods and approaches to understanding risk all the way into cutting-age thinking. Risk management by necessity must lie at the heart of governing our ever more complex digital societies. New phenomena and activities necessitate a new look at how individuals, firms, and states manage the uncertainty they must operate in. Initial chapters provide an introduction to traditional methods and show how they can be built upon to better understand the workings of the modern economy. Later chapters review digital activities and assets like cryptocurrencies showing how such emergent risks can be conceptualized better. Network theory figures prominently and the book demonstrates how it can be used to gauge the risk in the digital sectors of the economy. Predicting the unpredictable black swan events is also discussed in view of a wider adoption of economic simulations. The journey concludes by looking at how individuals perceive risk and make decisions as they operate in a virtual social network. This book interests the academic audience, but it also features insights and novel research results that are relevant for practitioners and policymakers.

What does the Web look like? How can we find patterns, communities, outliers, in a social network? Which are the most central nodes in a network? These are the questions that motivate this work. Networks and graphs appear in many diverse settings, for example in social networks, computer-communication networks (intrusion detection, traffic management), protein-protein interaction networks in biology, document-text bipartite graphs in text retrieval, person-account graphs in financial fraud detection, and others. In this work, first we list several surprising patterns that real graphs tend to follow. Then we give a detailed list of generators that try to mirror these patterns. Generators are important, because they can help with "what if" scenarios, extrapolations, and anonymization. Then we provide a list of powerful tools for graph analysis, and specifically spectral methods (Singular Value Decomposition (SVD)), tensors, and case studies like the famous "pageRank" algorithm and the "HITS" algorithm for ranking web search results. Finally, we conclude with a survey of tools and observations from related fields like sociology, which provide complementary viewpoints. Table of Contents: Introduction / Patterns in Static Graphs / Patterns in Evolving Graphs / Patterns in Weighted Graphs / Discussion: The Structure of Specific Graphs / Discussion: Power Laws and Deviations / Summary of Patterns / Graph Generators / Preferential Attachment and Variants / Incorporating Geographical Information / The RMat / Graph Generation by Kronecker Multiplication / Summary and Practitioner's Guide / SVD, Random Walks, and Tensors / Tensors / Community Detection / Influence/Virus Propagation and Immunization / Case Studies / Social Networks / Other Related Work / Conclusions