Papers
80
Recent publications related to complex systems
Follow
Scooped by Complexity Digest onto Papers
Scoop.it!

Social Relationships and the Emergence of Social Networks

In complex social systems such as those of many mammals, including humans, groups (and hence ego-centric social networks) are commonly structured in discrete layers. We describe a computational model for the development of social relationships based on agents' strategies for social interaction that favour more less-intense, or fewer more-intense partners. A trust-related process controls the formation and decay of relationships as a function of interaction frequency, the history of interaction, and the agents' strategies. A good fit of the observed layers of human social networks was found across a range of model parameter settings. Social interaction strategies which favour interacting with existing strong ties or a time-variant strategy produced more observation-conformant results than strategies favouring more weak relationships. Strong-tie strategies spread in populations under a range of fitness conditions favouring wellbeing, whereas weak-tie strategies spread when fitness favours foraging for food. The implications for modelling the emergence of social relationships in complex structured social networks are discussed.

 

Alistair Sutcliffe, Di Wang and Robin Dunbar (2012)

Social Relationships and the Emergence of Social Networks

Journal of Artificial Societies and Social Simulation 15 (4) 3
http://jasss.soc.surrey.ac.uk/15/4/3.html

No comment yet.
Your new post is loading...
Scooped by Complexity Digest
Scoop.it!

Complex dynamics of elementary cellular automata emerging in chaotic rules

Complex dynamics of elementary cellular automata emerging in chaotic rules | Papers | Scoop.it

We show novel techniques of analysing complex dynamics of cellular automata (CA) with chaotic behaviour. CA are well known computational substrates for studying emergent collective behaviour, complexity, randomness and interaction between order and disorder. A number of attempts have been made to classify CA functions on their spatio-temporal dynamics and to predict behavior of any given function. Examples include mechanical computation, lambda and Z-parameters, mean field theory, differential equations and number conserving features. We propose to classify CA based on their behaviour when they act in a historical mode, i.e. as CA with memory. We demonstrate that cell-state transition rules enriched with memory quickly transform a chaotic system converging to a complex global behaviour from almost any initial condition. Thus in just a few steps we can select chaotic rules without exhaustive computational experiments or recurring to additional parameters. We provide analysis of well-known chaotic functions in one-dimensional CA, and decompose dynamics of the automata using majority memory.

No comment yet.