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

Winter is coming. So polish your networks

   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, 26 Nov 2018 12:05:36 +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

Artificial Intelligence Hits the Barrier of Meaning

As someone who has worked in A.I. for decades, I˙˙ve witnessed the failure of similar predictions of imminent human-level A.I., and I˙˙m certain these latest forecasts will fall short as well. The challenge of creating humanlike intelligence in machines remains greatly underestimated. Today˙˙s A.I. systems sorely lack the essence of human intelligence: understanding the situations we experience, being able to grasp their meaning. The mathematician and philosopher Gian-Carlo Rota famously asked, ˙˙I wonder whether or when A.I. will ever crash the barrier of meaning.˙˙ To me, this is still the most important question.

Source: (

Spreading in scale-free computer networks with improved clustering

    In this study, we investigated data spreading in computer networks with scale-free topology under various levels of improved clustering. Starting from a pure Barabási˙˙Albert (BA) network topology, we applied a Poisson-based rewiring procedure with increasing rewiring probability, which promotes local connections. We then performed wired computer network simulations in NS2 simulator for these topologies. We found that for pure BA network, data transfer (throughput) is maximum, where time required for establishing routing scheme, end-to-end delays in data transmission and number of nodes acting in data transfer are at their minimum levels. Improving clustering increases these parameters those are at their minima. A noteworthy finding of this study is that, for moderate levels of clustering, total throughput remains close to its maximum yielding stable transfer rates, although number of infected nodes and end-to-end delay increase. This indicates that clustering promotes
spreading phenomena in networks, although it increases average separation. As a result, clustering property emerges as a catalyzer in data spreading with minimal effects on the total amount of transmission.

Spreading in scale-free computer networks with improved clustering

˙˙lker Türker and Zafer Albayrak

International Journal of Modern Physics BVol. 32, No. 28, 1850309 (2018)

Source: (

Distributed Estimation of State and Parameters in Multi-Agent Cooperative Manipulation

    We present two distributed methods for the estimation of the kinematic parameters, the dynamic parameters, and the kinematic state of an unknown planar body manipulated by a decentralized multi-agent system. The proposed approaches rely on the rigid body kinematics and dynamics, on nonlinear observation theory, and on consensus algorithms. The only three requirements are that each agent can exert a 2D wrench on the load, it can measure the velocity of its contact point, and that the communication graph is connected. Both theoretical nonlinear observability analysis and convergence proofs are provided. The first method assumes constant parameters while the second one can deal with time-varying parameters and can be applied in parallel to any task-oriented control law. For the cases in which a control law is not provided, we propose a distributed and safe control strategy satisfying the observability condition. The effectiveness and robustness of the estimation strategy is
showcased by means of realistic MonteCarlo simulations.

Distributed Estimation of State and Parameters in Multi-Agent Cooperative Manipulation
Antonio Franchi ; Antonio Petitti ; Alessandro Rizzo

IEEE Transactions on Control of Network Systems

Source: (

LANet2019 ˙˙ Latin American conference on complex networks

The aim of LANET is to provide a forum to join all scientists who are somehow related to the research on Network Science in Latin America. The rapid growth of the field of Network Science in the last two decades has manifested in the form of schools, workshops, and conferences in Latin America. However, the creation of LANET as a stable and periodic forum devoted to Network Science will further spur the formation of research groups interested in the field and help to establish it as a discipline across Latin American Universities and Research Institutions.

Source: (

The spread of low-credibility content by social bots

Online misinformation is a threat to a well-informed electorate and undermines democracy. Here, the authors analyse the spread of articles on Twitter, find that bots play a major role in the spread of low-credibility content and suggest control measures for limiting the spread of misinformation.

The spread of low-credibility content by social bots
Chengcheng Shao, Giovanni Luca Ciampaglia, Onur Varol, Kai-Cheng Yang, Alessandro Flammini & Filippo Menczer
Nature Communications volume 9, Article number: 4787 (2018)

Source: (

Fractional Dynamics of Individuals in Complex Networks

The relation between the behavior of a single element and the global dynamics of its host network is an open problem in the science of complex networks. We demonstrate that for a dynamic network that belongs to the Ising universality class, this problem can be approached analytically through a subordination procedure. The analysis leads to a linear fractional differential equation of motion for the average trajectory of the individual, whose analytic solution for the probability of changing states is a Mittag-Leffler function. Consequently, the analysis provides a linear description of the average dynamics of an individual, without linearization of the complex network dynamics.

Fractional Dynamics of Individuals in Complex Networks
Malgorzata Turalska and Bruce J. West

Front. Phys., 16 October 2018 |

Source: (

Information Dynamics in Urban Crime

Information production in both space and time has been highlighted as one 
of the elements that shapes the footprint of complexity in natural and 
socio-technical systems. However, information production in urban crime 
has barely been studied. This work copes with this problem by using 
multifractal analysis to characterize the spatial information scaling in 
urban crime reports and nonlinear processing tools to study the temporal 
behavior of this scaling. Our results suggest that information scaling in 
urban crime exhibits dynamics that evolve in low-dimensional chaotic 
attractors, and this can be observed in several spatio-temporal scales, 
although some of them are more favorable than others. This evidence has 
practical implications in terms of defining the characteristic scales to 
approach urban crime from available data and supporting theoretical 
perspectives about the complexity of urban crime.

Information Dynamics in Urban Crime
Miguel Melgarejo and Nelson Obregon

Entropy 2018, 20(11), 874;

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.