10,109 research outputs found
Community detection in multiplex networks using locally adaptive random walks
Multiplex networks, a special type of multilayer networks, are increasingly
applied in many domains ranging from social media analytics to biology. A
common task in these applications concerns the detection of community
structures. Many existing algorithms for community detection in multiplexes
attempt to detect communities which are shared by all layers. In this article
we propose a community detection algorithm, LART (Locally Adaptive Random
Transitions), for the detection of communities that are shared by either some
or all the layers in the multiplex. The algorithm is based on a random walk on
the multiplex, and the transition probabilities defining the random walk are
allowed to depend on the local topological similarity between layers at any
given node so as to facilitate the exploration of communities across layers.
Based on this random walk, a node dissimilarity measure is derived and nodes
are clustered based on this distance in a hierarchical fashion. We present
experimental results using networks simulated under various scenarios to
showcase the performance of LART in comparison to related community detection
algorithms
Analysis of Multiplex Social Networks with R
Multiplex social networks are characterized by a common set of actors connected through multiple types of relations. The multinet package provides a set of R functions to analyze multiplex social networks within the more general framework of multilayer networks, where each type of relation is represented as a layer in the network. The package contains functions to import/export, create and manipulate multilayer networks, implementations of several state-of-the-art multiplex network analysis algorithms, e.g., for centrality measures, layer comparison, community detection and visualization. Internally, the package is mainly written in native C++ and integrated with R using the Rcpp package
Multiplex Communities and the Emergence of International Conflict
Advances in community detection reveal new insights into multiplex and
multilayer networks. Less work, however, investigates the relationship between
these communities and outcomes in social systems. We leverage these advances to
shed light on the relationship between the cooperative mesostructure of the
international system and the onset of interstate conflict. We detect
communities based upon weaker signals of affinity expressed in United Nations
votes and speeches, as well as stronger signals observed across multiple layers
of bilateral cooperation. Communities of diplomatic affinity display an
expected negative relationship with conflict onset. Ties in communities based
upon observed cooperation, however, display no effect under a standard model
specification and a positive relationship with conflict under an alternative
specification. These results align with some extant hypotheses but also point
to a paucity in our understanding of the relationship between community
structure and behavioral outcomes in networks.Comment: arXiv admin note: text overlap with arXiv:1802.0039
Learning Dynamic Network Models for Complex Social Systems
Human societies are inherently complex and highly dynamic, resulting in rapidly changing social networks, containing multiple types of dyadic interactions. Analyzing these time-varying multiplex networks with approaches developed for static, single layer networks often produces poor results. To address this problem, our approach is to explicitly learn the dynamics of these complex networks. This dissertation focuses on five problems: 1) learning link formation rates; 2) predicting changes in community membership; 3) using time series to predict changes in network structure; 4) modeling coevolution patterns across network layers and 5) extracting information from negative layers of a multiplex network. To study these problems, we created a rich dataset extracted from observing social interactions in the massively multiplayer online game Travian. Most online social media platforms are optimized to support a limited range of social interactions, primarily focusing on communication and information sharing. In contrast, relations in massively-multiplayer online games (MMOGs) are often formed during the course of gameplay and evolve as the game progresses. To analyze the players\u27 behavior, we constructed multiplex networks with link types for raid, communication, and trading. The contributions of this dissertation include 1) extensive experiments on the dynamics of networks formed from diverse social processes; 2) new game theoretic models for community detection in dynamic networks; 3) supervised and unsupervised methods for link prediction in multiplex coevolving networks for both positive and negative links. We demonstrate that our holistic approach for modeling network dynamics in coevolving, multiplex networks outperforms factored methods that separately consider temporal and cross-layer patterns
Identifying modular flows on multilayer networks reveals highly overlapping organization in social systems
Unveiling the community structure of networks is a powerful methodology to
comprehend interconnected systems across the social and natural sciences. To
identify different types of functional modules in interaction data aggregated
in a single network layer, researchers have developed many powerful methods.
For example, flow-based methods have proven useful for identifying modular
dynamics in weighted and directed networks that capture constraints on flow in
the systems they represent. However, many networked systems consist of agents
or components that exhibit multiple layers of interactions. Inevitably,
representing this intricate network of networks as a single aggregated network
leads to information loss and may obscure the actual organization. Here we
propose a method based on compression of network flows that can identify
modular flows in non-aggregated multilayer networks. Our numerical experiments
on synthetic networks show that the method can accurately identify modules that
cannot be identified in aggregated networks or by analyzing the layers
separately. We capitalize on our findings and reveal the community structure of
two multilayer collaboration networks: scientists affiliated to the Pierre
Auger Observatory and scientists publishing works on networks on the arXiv.
Compared to conventional aggregated methods, the multilayer method reveals
smaller modules with more overlap that better capture the actual organization
- …