LISTSERV mailing list manager LISTSERV 16.0

Help for SOCNET Archives


SOCNET Archives

SOCNET Archives


SOCNET@LISTS.UFL.EDU


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

SOCNET Home

SOCNET Home

SOCNET  October 2018

SOCNET October 2018

Subject:

selected Latest Complexity Digest Posts (fwd)

From:

Barry Wellman <[log in to unmask]>

Reply-To:

Barry Wellman <[log in to unmask]>

Date:

Mon, 29 Oct 2018 17:23:55 -0400

Content-Type:

MULTIPART/MIXED

Parts/Attachments:

Parts/Attachments

TEXT/PLAIN (130 lines)

*****  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.

Top of Message | Previous Page | Permalink

Advanced Options


Options

Log In

Log In

Get Password

Get Password


Search Archives

Search Archives


Subscribe or Unsubscribe

Subscribe or Unsubscribe


Archives

November 2018
October 2018
September 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
February 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
July 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
October 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
October 2013
September 2013
August 2013
July 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
June 2009
May 2009
April 2009
March 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
July 2008, Week 62
July 2008
June 2008
May 2008
April 2008
March 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
February 2007
January 2007
December 2006
November 2006
October 2006
September 2006
August 2006
July 2006
June 2006
May 2006
April 2006
March 2006
February 2006
January 2006
December 2005
November 2005
October 2005
September 2005
August 2005
July 2005
June 2005
May 2005
April 2005
March 2005
February 2005
January 2005
December 2004
November 2004
October 2004
September 2004
August 2004
July 2004
June 2004
May 2004
April 2004
March 2004
February 2004
January 2004
December 2003
November 2003
October 2003
September 2003
August 2003
July 2003
June 2003
May 2003
April 2003
March 2003
February 2003
January 2003
December 2002
November 2002
October 2002
September 2002
August 2002
July 2002
June 2002
May 2002
April 2002
March 2002
February 2002
January 2002
December 2001
November 2001
October 2001
September 2001
August 2001
July 2001
June 2001
May 2001

ATOM RSS1 RSS2



LISTS.UFL.EDU

CataList Email List Search Powered by the LISTSERV Email List Manager