*****  To join INSNA, visit  *****

Back in Toronto, where people experience diversity by actually walking on 
the street and riding public transit :)

   Barry Wellman

   Step by step, link by link, putting it together--Streisand/Sondheim
        The earth to be spannd, connected by network--Walt Whitman
              It's Always Something--Roseanne Roseannadanna

              A day like all days, filled with those events
          that alter and illuminate our times--Walter Cronkite
   NetLab Network      			                            FRSC
   Distinguished Visiting Scholar   Social Media Lab   Ryerson University
         Founder, International Network for Social Network Analysis
   NETWORKED: The New Social Operating System  Lee Rainie & Barry Wellman  

---------- Forwarded message ----------
Date: Mon, 1 Apr 2019 12:09:34 +0000
From: "[utf-8] Complexity Digest" <[log in to unmask]>
Reply-To: [log in to unmask]
To: "[utf-8] Barry" <[log in to unmask]>
Subject: [utf-8] Latest Complexity Digest Posts

Learn about the latest and greatest related to complex systems research. More at

On the Complex Behaviour of Natural and Artificial Machines and Systems

    One of the most important aims of the fields of robotics, artificial intelligence and artificial life is the design and construction of systems and machines as versatile and as reliable as living organisms at performing high level human-like tasks. But how are we to evaluate artificial systems if we are not certain how to measure these capacities in living systems, let alone how to define life or intelligence? Here I survey a concrete metric towards measuring abstract properties of natural and artificial systems, such as the ability to react to the environment and to control one˙˙s own behaviour.

On the Complex Behaviour of Natural and Artificial Machines and Systems
H. Zenil

Metrics of Sensory Motor Coordination and Integration in Robots and Animals pp 111-125

Source: (

Postdoctoral Fellowships at the Centro de Ciencias de la Complejidad (C3), UNAM

    The C3-UNAM announces that each year there will be 2 periods, April-May and December-January, that applications will be received for 2 postdoctoral grants from the UNAM to realize research at the C3-UNAM, starting in September and March, respectively (4 postdoc grants yearly). The purpose of the grants is to realize research in complexity science in one of the following areas: computational intelligence and mathematical modeling, complexity and health, neurosciences, ecological complexity and environment (postdoctoral grants for research in humanistic sciences such as social complexity, and arts, science and complexity will be announced separately), please find the academic programs that are developed at the C3-UNAM in the page:
Technical details for the application are explained in the page:
The grants are for 1 year and renewable for a 2nd year in function of the results obtained.

Source: (

Math Proof Finds All Change Is Mix of Order and Randomness

All descriptions of change are a unique blend of chance and determinism, according to the sweeping mathematical proof of the ˙˙weak Pinsker conjecture.˙˙

Source: (

An Exact No Free Lunch Theorem for Community Detection

    A precondition for a No Free Lunch theorem is evaluation with a loss function which does not assume a priori superiority of some outputs over others. A previous result for community detection by Peel et al. (2017) relies on a mismatch between the loss function and the problem domain. The loss function computes an expectation over only a subset of the universe of possible outputs; thus, it is only asymptotically appropriate with respect to the problem size. By using the correct random model for the problem domain, we provide a stronger, exact No Free Lunch theorem for community detection. The claim generalizes to other set-partitioning tasks including core/periphery separation, k-clustering, and graph partitioning. Finally, we review the literature of proposed evaluation functions and identify functions which (perhaps with slight modifications) are compatible with an exact No Free Lunch theorem.

An Exact No Free Lunch Theorem for Community Detection
Arya D. McCarthy, Tongfei Chen, Seth Ebner

Source: (

How to Make Swarms Open-Ended? Evolving Collective Intelligence Through a Constricted Exploration of Adjacent Possibles

    We propose an approach of open-ended evolution via the simulation of swarm dynamics. In nature, swarms possess remarkable properties, which allow many organisms, from swarming bacteria to ants and flocking birds, to form higher-order structures that enhance their behavior as a group. Swarm simulations highlight three important factors to create novelty and diversity: (a) communication generates combinatorial cooperative dynamics, (b) concurrency allows for separation of timescales, and (c) complexity and size increases push the system towards transitions in innovation. We illustrate these three components in a model computing the continuous evolution of a swarm of agents. The results, divided in three distinct applications, show how emergent structures are capable of filtering information through the bottleneck of their memory, to produce meaningful novelty and diversity within their simulated environment.

How to Make Swarms Open-Ended? Evolving Collective Intelligence Through a Constricted Exploration of Adjacent Possibles
Olaf Witkowski, Takashi Ikegami

Source: (

Sponsored by the Complex Systems Society.
Founding Editor: Gottfried Mayer.
Editor-in-Chief: Carlos Gershenson.

You can contribute to Complexity Digest selecting one of our topics ( ) and using the "Suggest" button.

SOCNET is a service of INSNA, the professional association for social
network researchers ( To unsubscribe, send
an email message to [log in to unmask] containing the line
UNSUBSCRIBE SOCNET in the body of the message.