214,300 research outputs found
The Naming Game in Social Networks: Community Formation and Consensus Engineering
We study the dynamics of the Naming Game [Baronchelli et al., (2006) J. Stat.
Mech.: Theory Exp. P06014] in empirical social networks. This stylized
agent-based model captures essential features of agreement dynamics in a
network of autonomous agents, corresponding to the development of shared
classification schemes in a network of artificial agents or opinion spreading
and social dynamics in social networks. Our study focuses on the impact that
communities in the underlying social graphs have on the outcome of the
agreement process. We find that networks with strong community structure hinder
the system from reaching global agreement; the evolution of the Naming Game in
these networks maintains clusters of coexisting opinions indefinitely. Further,
we investigate agent-based network strategies to facilitate convergence to
global consensus.Comment: The original publication is available at
http://www.springerlink.com/content/70370l311m1u0ng3
Statistical Mechanics of Community Detection
Starting from a general \textit{ansatz}, we show how community detection can
be interpreted as finding the ground state of an infinite range spin glass. Our
approach applies to weighted and directed networks alike. It contains the
\textit{at hoc} introduced quality function from \cite{ReichardtPRL} and the
modularity as defined by Newman and Girvan \cite{Girvan03} as special
cases. The community structure of the network is interpreted as the spin
configuration that minimizes the energy of the spin glass with the spin states
being the community indices. We elucidate the properties of the ground state
configuration to give a concise definition of communities as cohesive subgroups
in networks that is adaptive to the specific class of network under study.
Further we show, how hierarchies and overlap in the community structure can be
detected. Computationally effective local update rules for optimization
procedures to find the ground state are given. We show how the \textit{ansatz}
may be used to discover the community around a given node without detecting all
communities in the full network and we give benchmarks for the performance of
this extension. Finally, we give expectation values for the modularity of
random graphs, which can be used in the assessment of statistical significance
of community structure
Network Structure, Efficiency, and Performance in WikiProjects
The internet has enabled collaborations at a scale never before possible, but
the best practices for organizing such large collaborations are still not
clear. Wikipedia is a visible and successful example of such a collaboration
which might offer insight into what makes large-scale, decentralized
collaborations successful. We analyze the relationship between the structural
properties of WikiProject coeditor networks and the performance and efficiency
of those projects. We confirm the existence of an overall
performance-efficiency trade-off, while observing that some projects are higher
than others in both performance and efficiency, suggesting the existence
factors correlating positively with both. Namely, we find an association
between low-degree coeditor networks and both high performance and high
efficiency. We also confirm results seen in previous numerical and small-scale
lab studies: higher performance with less skewed node distributions, and higher
performance with shorter path lengths. We use agent-based models to explore
possible mechanisms for degree-dependent performance and efficiency. We present
a novel local-majority learning strategy designed to satisfy properties of
real-world collaborations. The local-majority strategy as well as a localized
conformity-based strategy both show degree-dependent performance and
efficiency, but in opposite directions, suggesting that these factors depend on
both network structure and learning strategy. Our results suggest possible
benefits to decentralized collaborations made of smaller, more tightly-knit
teams, and that these benefits may be modulated by the particular learning
strategies in use.Comment: 11 pages, 5 figures, to appear in ICWSM 201
Opinion Polarization by Learning from Social Feedback
We explore a new mechanism to explain polarization phenomena in opinion
dynamics in which agents evaluate alternative views on the basis of the social
feedback obtained on expressing them. High support of the favored opinion in
the social environment, is treated as a positive feedback which reinforces the
value associated to this opinion. In connected networks of sufficiently high
modularity, different groups of agents can form strong convictions of competing
opinions. Linking the social feedback process to standard equilibrium concepts
we analytically characterize sufficient conditions for the stability of
bi-polarization. While previous models have emphasized the polarization effects
of deliberative argument-based communication, our model highlights an affective
experience-based route to polarization, without assumptions about negative
influence or bounded confidence.Comment: Presented at the Social Simulation Conference (Dublin 2017
Consensus formation on adaptive networks
The structure of a network can significantly influence the properties of the
dynamical processes which take place on them. While many studies have been
devoted to this influence, much less attention has been devoted to the
interplay and feedback mechanisms between dynamical processes and network
topology on adaptive networks. Adaptive rewiring of links can happen in real
life systems such as acquaintance networks where people are more likely to
maintain a social connection if their views and values are similar. In our
study, we consider different variants of a model for consensus formation. Our
investigations reveal that the adaptation of the network topology fosters
cluster formation by enhancing communication between agents of similar opinion,
though it also promotes the division of these clusters. The temporal behavior
is also strongly affected by adaptivity: while, on static networks, it is
influenced by percolation properties, on adaptive networks, both the early and
late time evolution of the system are determined by the rewiring process. The
investigation of a variant of the model reveals that the scenarios of
transitions between consensus and polarized states are more robust on adaptive
networks.Comment: 11 pages, 14 figure
The Impact of Network Flows on Community Formation in Models of Opinion Dynamics
We study dynamics of opinion formation in a network of coupled agents. As the
network evolves to a steady state, opinions of agents within the same community
converge faster than those of other agents. This framework allows us to study
how network topology and network flow, which mediates the transfer of opinions
between agents, both affect the formation of communities. In traditional models
of opinion dynamics, agents are coupled via conservative flows, which result in
one-to-one opinion transfer. However, social interactions are often
non-conservative, resulting in one-to-many transfer of opinions. We study
opinion formation in networks using one-to-one and one-to-many interactions and
show that they lead to different community structure within the same network.Comment: accepted for publication in The Journal of Mathematical Sociology.
arXiv admin note: text overlap with arXiv:1201.238
- …