Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Collective phenomena and non-finite state computation in a human social system.

ABSTRACT: We investigate the computational structure of a paradigmatic example of distributed social interaction: that of the open-source Wikipedia community. We examine the statistical properties of its cooperative behavior, and perform model selection to determine whether this aspect of the system can be described by a finite-state process, or whether reference to an effectively unbounded resource allows for a more parsimonious description. We find strong evidence, in a majority of the most-edited pages, in favor of a collective-state model, where the probability of a "revert" action declines as the square root of the number of non-revert actions seen since the last revert. We provide evidence that the emergence of this social counter is driven by collective interaction effects, rather than properties of individual users.

SUBMITTER: DeDeo S

PROVIDER: S-EPMC3794014 | biostudies-literature | 2013

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Collective phenomena and non-finite state computation in a human social system.

DeDeo Simon S

PloS one 20131009 10

We investigate the computational structure of a paradigmatic example of distributed social interaction: that of the open-source Wikipedia community. We examine the statistical properties of its cooperative behavior, and perform model selection to determine whether this aspect of the system can be described by a finite-state process, or whether reference to an effectively unbounded resource allows for a more parsimonious description. We find strong evidence, in a majority of the most-edited pages ...[more]

PMID: 24130745

Similar Datasets

Correction: Collective Phenomena and Non-Finite State Computation in a Human Social System

Project description: Not available

| S-EPMC4067411 | biostudies-literature

Collective phenomena in crowds-Where pedestrian dynamics need social psychology.

Project description:This article is on collective phenomena in pedestrian dynamics during the assembling and dispersal of gatherings. To date pedestrian dynamics have been primarily studied in the natural and engineering sciences. Pedestrians are analyzed and modeled as driven particles revealing self-organizing phenomena and complex transport characteristics. However, pedestrians in crowds also behave as living beings according to stimulus-response mechanisms or act as human subjects on the basis of social norms, social identities or strategies. To show where pedestrian dynamics need social psychology in addition to the natural sciences we propose the application of three categories-phenomena, behavior and action. They permit a clear discrimination between situations in which minimal models from the natural sciences are appropriate and those in which sociological and psychological concepts are needed. To demonstrate the necessity of this framework, an experiment in which a large group of people (n = 270) enters a concert hall through two different spatial barrier structures is analyzed. These two structures correspond to everyday situations such as boarding trains and access to immigration desks. Methods from the natural and social sciences are applied. Firstly, physical measurements show the influence of the spatial structure on the dynamics of the entrance procedure. Density, waiting time and speed of progress show large variations. Secondly, a questionnaire study (n = 60) reveals how people perceive and evaluate these entrance situations. Markedly different expectations, social norms and strategies are associated with the two spatial structures. The results from the questionnaire study do not always conform to objective physical measures, indicating the limitations of models which are based on objective physical measures alone and which neglect subjective perspectives.

| S-EPMC5462364 | biostudies-literature

Conflicts of interest improve collective computation of adaptive social structures.

Project description:In many biological systems, the functional behavior of a group is collectively computed by the system's individual components. An example is the brain's ability to make decisions via the activity of billions of neurons. A long-standing puzzle is how the components' decisions combine to produce beneficial group-level outputs, despite conflicts of interest and imperfect information. We derive a theoretical model of collective computation from mechanistic first principles, using results from previous work on the computation of power structure in a primate model system. Collective computation has two phases: an information accumulation phase, in which (in this study) pairs of individuals gather information about their fighting abilities and make decisions about their dominance relationships, and an information aggregation phase, in which these decisions are combined to produce a collective computation. To model information accumulation, we extend a stochastic decision-making model-the leaky integrator model used to study neural decision-making-to a multiagent game-theoretic framework. We then test alternative algorithms for aggregating information-in this study, decisions about dominance resulting from the stochastic model-and measure the mutual information between the resultant power structure and the "true" fighting abilities. We find that conflicts of interest can improve accuracy to the benefit of all agents. We also find that the computation can be tuned to produce different power structures by changing the cost of waiting for a decision. The successful application of a similar stochastic decision-making model in neural and social contexts suggests general principles of collective computation across substrates and scales.

| S-EPMC5777398 | biostudies-literature

Collective Computation in Animal Fission-Fusion Dynamics.

Project description:Recent work suggests that collective computation of social structure can minimize uncertainty about the social and physical environment, facilitating adaptation. We explore these ideas by studying how fission-fusion social structure arises in spider monkey (Ateles geoffroyi) groups, exploring whether monkeys use social knowledge to collectively compute subgroup size distributions adaptive for foraging in variable environments. We assess whether individual decisions to stay in or leave subgroups are conditioned on strategies based on the presence or absence of others. We search for this evidence in a time series of subgroup membership. We find that individuals have multiple strategies, suggesting that the social knowledge of different individuals is important. These stay-leave strategies provide microscopic inputs to a stochastic model of collective computation encoded in a family of circuits. Each circuit represents an hypothesis for how collectives combine strategies to make decisions, and how these produce various subgroup size distributions. By running these circuits forward in simulation we generate new subgroup size distributions and measure how well they match food abundance in the environment using transfer entropies. We find that spider monkeys decide to stay or go using information from multiple individuals and that they can collectively compute a distribution of subgroup size that makes efficient use of ephemeral sources of nutrition. We are able to artificially tune circuits with subgroup size distributions that are a better fit to the environment than the observed. This suggests that a combination of measurement error, constraint, and adaptive lag are diminishing the power of collective computation in this system. These results are relevant for a more general understanding of the emergence of ordered states in multi-scale social systems with adaptive properties-both natural and engineered.

| S-EPMC7805913 | biostudies-literature

Control of finite critical behaviour in a small-scale social system.

Project description:Many adaptive systems sit near a tipping or critical point. For systems near a critical point small changes to component behaviour can induce large-scale changes in aggregate structure and function. Criticality can be adaptive when the environment is changing, but entails reduced robustness through sensitivity. This tradeoff can be resolved when criticality can be tuned. We address the control of finite measures of criticality using data on fight sizes from an animal society model system (Macaca nemestrina, n=48). We find that a heterogeneous, socially organized system, like homogeneous, spatial systems (flocks and schools), sits near a critical point; the contributions individuals make to collective phenomena can be quantified; there is heterogeneity in these contributions; and distance from the critical point (DFC) can be controlled through biologically plausible mechanisms exploiting heterogeneity. We propose two alternative hypotheses for why a system decreases the distance from the critical point.

| S-EPMC5309824 | biostudies-literature

Dynamical system model predicts when social learners impair collective performance.

Project description:A key question concerning collective decisions is whether a social system can settle on the best available option when some members learn from others instead of evaluating the options on their own. This question is challenging to study, and previous research has reached mixed conclusions, because collective decision outcomes depend on the insufficiently understood complex system of cognitive strategies, task properties, and social influence processes. This study integrates these complex interactions together in one general yet partially analytically tractable mathematical framework using a dynamical system model. In particular, it investigates how the interplay of the proportion of social learners, the relative merit of options, and the type of conformity response affect collective decision outcomes in a binary choice. The model predicts that, when the proportion of social learners exceeds a critical threshold, a bistable state appears in which the majority can end up favoring either the higher- or lower-merit option, depending on fluctuations and initial conditions. Below this threshold, the high-merit option is chosen by the majority. The critical threshold is determined by the conformity response function and the relative merits of the two options. The study helps reconcile disagreements about the effect of social learners on collective performance and proposes a mathematical framework that can be readily adapted to extensions investigating a wider variety of dynamics.

| S-EPMC8536379 | biostudies-literature

All-DNA finite-state automata with finite memory.

Project description:Biomolecular logic devices can be applied for sensing and nano-medicine. We built three DNA tweezers that are activated by the inputs H(+)/OH(-); ; nucleic acid linker/complementary antilinker to yield a 16-states finite-state automaton. The outputs of the automata are the configuration of the respective tweezers (opened or closed) determined by observing fluorescence from a fluorophore/quencher pair at the end of the arms of the tweezers. The system exhibits a memory because each current state and output depend not only on the source configuration but also on past states and inputs.

| S-EPMC3009826 | biostudies-literature

Computation and Simulation of Evolutionary Game Dynamics in Finite Populations.

Project description:The study of evolutionary dynamics increasingly relies on computational methods, as more and more cases outside the range of analytical tractability are explored. The computational methods for simulation and numerical approximation of the relevant quantities are diverging without being compared for accuracy and performance. We thoroughly investigate these algorithms in order to propose a reliable standard. For expositional clarity we focus on symmetric 2 × 2 games leading to one-dimensional processes, noting that extensions can be straightforward and lessons will often carry over to more complex cases. We provide time-complexity analysis and systematically compare three families of methods to compute fixation probabilities, fixation times and long-term stationary distributions for the popular Moran process. We provide efficient implementations that substantially improve wall times over naive or immediate implementations. Implications are also discussed for the Wright-Fisher process, as well as structured populations and multiple types.

| S-EPMC6502801 | biostudies-literature

Non-adiabatic holonomic quantum computation in linear system-bath coupling.

Project description:Non-adiabatic holonomic quantum computation in decoherence-free subspaces protects quantum information from control imprecisions and decoherence. For the non-collective decoherence that each qubit has its own bath, we show the implementations of two non-commutable holonomic single-qubit gates and one holonomic nontrivial two-qubit gate that compose a universal set of non-adiabatic holonomic quantum gates in decoherence-free-subspaces of the decoupling group, with an encoding rate of (N - 2)/N. The proposed scheme is robust against control imprecisions and the non-collective decoherence, and its non-adiabatic property ensures less operation time. We demonstrate that our proposed scheme can be realized by utilizing only two-qubit interactions rather than many-qubit interactions. Our results reduce the complexity of practical implementation of holonomic quantum computation in experiments. We also discuss the physical implementation of our scheme in coupled microcavities.

| S-EPMC4742878 | biostudies-other

Using synchronous Boolean networks to model several phenomena of collective behavior.

Project description:In this paper, we propose an approach for modeling and analysis of a number of phenomena of collective behavior. By collectives we mean multi-agent systems that transition from one state to another at discrete moments of time. The behavior of a member of a collective (agent) is called conforming if the opinion of this agent at current time moment conforms to the opinion of some other agents at the previous time moment. We presume that at each moment of time every agent makes a decision by choosing from the set {0,1} (where 1-decision corresponds to action and 0-decision corresponds to inaction). In our approach we model collective behavior with synchronous Boolean networks. We presume that in a network there can be agents that act at every moment of time. Such agents are called instigators. Also there can be agents that never act. Such agents are called loyalists. Agents that are neither instigators nor loyalists are called simple agents. We study two combinatorial problems. The first problem is to find a disposition of instigators that in several time moments transforms a network from a state where the majority of simple agents are inactive to a state with the majority of active agents. The second problem is to find a disposition of loyalists that returns the network to a state with the majority of inactive agents. Similar problems are studied for networks in which simple agents demonstrate the contrary to conforming behavior that we call anticonforming. We obtained several theoretical results regarding the behavior of collectives of agents with conforming or anticonforming behavior. In computational experiments we solved the described problems for randomly generated networks with several hundred vertices. We reduced corresponding combinatorial problems to the Boolean satisfiability problem (SAT) and used modern SAT solvers to solve the instances obtained.

| S-EPMC4272282 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data