***** To join INSNA, visit http://www.insna.org *****
Shalom to you all, My selections are below
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
https://urldefense.proofpoint.com/v2/url?u=http-3A__www.chass.utoronto.ca_-7Ewellman&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=6r7XaFji2kg0MZcrAuu1Qa5MoC3Mc_RhC20Tm71yEdI&s=pJ-HhAQnRc5AXdHIlDVzGqi7XQZt50Q6fZnS7tWGIZE&e= https://urldefense.proofpoint.com/v2/url?u=http-3A__amzn.to_zXZg39&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=6r7XaFji2kg0MZcrAuu1Qa5MoC3Mc_RhC20Tm71yEdI&s=IF0mgi9EYy1OsnmsKMKlT9eoCpoePDGJhiZDPT3PWZQ&e=
https://urldefense.proofpoint.com/v2/url?u=https-3A__en.wikipedia.org_wiki_Barry-5FWellman&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=6r7XaFji2kg0MZcrAuu1Qa5MoC3Mc_RhC20Tm71yEdI&s=0_JUC1Sl9KDbEEEemIKO6kq_hX4_gJs61ooFJbd_qCY&e=
_______________________________________________________________________
---------- Forwarded message ----------
Date: Mon, 29 Oct 2018 12:02:19 +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 https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3D6d891e24f9-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=6r7XaFji2kg0MZcrAuu1Qa5MoC3Mc_RhC20Tm71yEdI&s=zs0Jq6ESfZ8BO9TOkGu3rZpF68MAORPn1wbhnUJI_co&e=
Network Science In Education
https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3D275cd183cb-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=6r7XaFji2kg0MZcrAuu1Qa5MoC3Mc_RhC20Tm71yEdI&s=bEr8nFLSkPZcIb0IoWYlYDc0O9Mjf56mXEb5K5tuITY&e=
Network Science In Education
Transformational Approaches in Teaching and Learning
Edited by
Catherine B. Cramer, Mason A. Porter, Hiroki Sayama, Lori Sheetz, Stephen Miles Uzzo
Source: link.springer.com
(https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3D088550904d-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=6r7XaFji2kg0MZcrAuu1Qa5MoC3Mc_RhC20Tm71yEdI&s=8SyYkqMofbjCLapdGT8f7VM-yP62eH0FwMBB-aWfsJU&e=)
An Information-Theoretic Approach to Self-Organisation: Emergence of Complex Interdependencies in Coupled Dynamical Systems
https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3D392cf23249-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=6r7XaFji2kg0MZcrAuu1Qa5MoC3Mc_RhC20Tm71yEdI&s=6nksW7gRdtvzGH47uO8IWpdM340KeBb1EqRqIxZ0mg4&e=
Self-organisation lies at the core of fundamental but still unresolved scientific questions, and holds the promise of de-centralised paradigms crucial for future technological developments. While self-organising processes have been traditionally explained by the tendency of dynamical systems to evolve towards specific configurations, or attractors, we see self-organisation as a consequence of the interdependencies that those attractors induce. Building on this intuition, in this work we develop a theoretical framework for understanding and quantifying self-organisation based on coupled dynamical systems and multivariate information theory. We propose a metric of global structural strength that identifies when self-organisation appears, and a multi-layered decomposition that explains the emergent structure in terms of redundant and synergistic interdependencies. We illustrate our framework on elementary cellular automata, showing how it can detect and characterise the
emergence of complex structures.
An Information-Theoretic Approach to Self-Organisation: Emergence of Complex Interdependencies in Coupled Dynamical Systems
Fernando Rosas, Pedro A.M. Mediano, Martín Ugarte and Henrik J. Jensen
Entropy 2018, 20(10), 793; https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3D2161cbbf5c-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=6r7XaFji2kg0MZcrAuu1Qa5MoC3Mc_RhC20Tm71yEdI&s=tKZnxdk9ny7ohrEVNnHgiJPwrdgiFfbgzxpXYaisOHg&e=
Source: www.mdpi.com (https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3D1d6b4c8326-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=6r7XaFji2kg0MZcrAuu1Qa5MoC3Mc_RhC20Tm71yEdI&s=d9EtX6kNT78TIijVYeVdLgl3_Fce9JkpIDoTExMj6v4&e=)
Thermodynamics of urban transformations
Urban transformations within large and growing metropolitan areas often generate critical dynamics affecting social interactions, transport connectivity and income flow distribution. We develop a statistical˙˙mechanical model of urban transformations, exemplified for Greater Sydney, and derive a thermodynamic description highlighting critical regimes. We consider urban dynamics at two time scales: fast dynamics for the distribution of population and income, modelled via the maximum entropy principle, and slower dynamics evolving the urban structure under spatially distributed competition. We identify phase transitions between dispersed and polycentric phases, induced by varying the social disposition˙˙a factor balancing the suburbs˙˙ attractiveness˙˙in contrast with the travel impedance. Using the Fisher information, we identify critical thresholds and quantify the thermodynamic cost of urban transformation, as the minimal work required to vary the underlying parameter. Finally,
we introduce the notion of thermodynamic efficiency of urban transformation, as the ratio of the order gained during a change to the amount of required work, showing that this measure is maximized at criticality.
On critical dynamics and thermodynamic efficiency of urban transformations
Emanuele Crosato, Ramil Nigmatullin, Mikhail Prokopenko
Open Society
Published 17 October 2018.DOI: 10.1098/rsos.180863
Source: rsos.royalsocietypublishing.org (https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3D46c1982a6e-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=6r7XaFji2kg0MZcrAuu1Qa5MoC3Mc_RhC20Tm71yEdI&s=VVmoU_MXIw-Rni5lJXStApKq4oqqJQkLzS8IrHH-Uh8&e=)
From Louvain to Leiden: guaranteeing well-connected communities
Community detection is often used to understand the structure of large
and complex networks. One of the most popular algorithms for uncovering
community structure is the so-called Louvain algorithm. We show that this
algorithm has a major defect that largely went unnoticed until now: the
Louvain algorithm may yield arbitrarily badly connected communities. In
the worst case, communities may even be disconnected, especially when
running the algorithm iteratively. In our experimental analysis, we
observe that up to 25% of the communities are badly connected and up to
16% are disconnected. This may present serious issues in subsequent
analyses. To address this problem, we introduce the Leiden algorithm. We
prove that the Leiden algorithm yields communities that are guaranteed to
be connected. In addition, we prove that, when the Leiden algorithm is
applied iteratively, it converges to a partition in which all subsets of
all communities are locally optimally assigned. Furthermore, by relying on
a fast local move approach, the Leiden algorithm runs faster than the
Louvain algorithm. We demonstrate the performance of the Leiden algorithm
for several benchmark and real-world networks. We find that the Leiden
algorithm is faster than the Louvain algorithm and uncovers better
partitions, in addition to providing explicit guarantees. Based on our
results, we conclude that the Leiden algorithm is preferable to the
Louvain algorithm.
From Louvain to Leiden: guaranteeing well-connected communities
Vincent Traag, Ludo Waltman, Nees Jan van Eck
Source: arxiv.org (https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3Df35c7d4f13-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=6r7XaFji2kg0MZcrAuu1Qa5MoC3Mc_RhC20Tm71yEdI&s=l0Ry4V-iJnB2VeFX-iE08cQURIlzmANPN_Pa7grxCUI&e=)
==============================================
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 (https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3Deacff32460-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=6r7XaFji2kg0MZcrAuu1Qa5MoC3Mc_RhC20Tm71yEdI&s=nWX6ymuerdYXejGI9g_quogMF7F8Cq9GrnORj0-P9Qo&e= ) and using the "Suggest" button.
==============================================
==============================================
_____________________________________________________________________
SOCNET is a service of INSNA, the professional association for social
network researchers (http://www.insna.org). To unsubscribe, send
an email message to [log in to unmask] containing the line
UNSUBSCRIBE SOCNET in the body of the message.
|
