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  November 2018

SOCNET November 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, 26 Nov 2018 09:18:07 -0500

Content-Type:

MULTIPART/MIXED

Parts/Attachments:

Parts/Attachments

TEXT/PLAIN (158 lines)

*****  To join INSNA, visit http://www.insna.org  *****

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
   https://urldefense.proofpoint.com/v2/url?u=http-3A__www.chass.utoronto.ca_-7Ewellman&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=WlwXsCRD4CLc13DSj9FgRvb39lgIK8ZbF4CuQiLhfv4&s=GKKcy-3IixI0NvCAblJVMQaGZPgB3N3sW03z2JIb04k&e=            https://urldefense.proofpoint.com/v2/url?u=http-3A__amzn.to_zXZg39&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=WlwXsCRD4CLc13DSj9FgRvb39lgIK8ZbF4CuQiLhfv4&s=dnAN0ERi_K7l0BVs-JOWyOhf14LPGsO-EJSFHq_AfxM&e=
              https://urldefense.proofpoint.com/v2/url?u=https-3A__en.wikipedia.org_wiki_Barry-5FWellman&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=WlwXsCRD4CLc13DSj9FgRvb39lgIK8ZbF4CuQiLhfv4&s=5I4nkzmwm6nMTAsLUB-wujy_9MpHIyyOAyHO2Plp_FA&e=
   _______________________________________________________________________


---------- 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 https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3Db6bc857fd6-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=WlwXsCRD4CLc13DSj9FgRvb39lgIK8ZbF4CuQiLhfv4&s=tuFtEny3qeO1j1aCUUvH1Y-VfQuw7ylXaqhd7bx6VJ8&e=



Artificial Intelligence Hits the Barrier of Meaning

    https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3D7839c458ac-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=WlwXsCRD4CLc13DSj9FgRvb39lgIK8ZbF4CuQiLhfv4&s=gr6s3d5VfpC-o6VHgdDkzRcz_so303sG4USmzz5MWgk&e=

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: www.nytimes.com (https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3De49d638ed6-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=WlwXsCRD4CLc13DSj9FgRvb39lgIK8ZbF4CuQiLhfv4&s=0bHqhAROn-Bjr4yDH6Z3OVU4eOw1LXXrRkw7OZMziTQ&e=)


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: www.worldscientific.com (https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3D11e2648a8b-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=WlwXsCRD4CLc13DSj9FgRvb39lgIK8ZbF4CuQiLhfv4&s=zQMYOxMe4mgKjnvJrg7tbHw_Osi-njKgrOdrWm4pJsM&e=)



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: ieeexplore.ieee.org (https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3Deb6fa03a5f-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=WlwXsCRD4CLc13DSj9FgRvb39lgIK8ZbF4CuQiLhfv4&s=4SbdyPF6vqHsx1CdDRLKkgiZNZNd7qsq7PbFah-ykow&e=)



LANet2019 ˙˙ Latin American conference on complex networks

    https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3Ddb39376c95-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=WlwXsCRD4CLc13DSj9FgRvb39lgIK8ZbF4CuQiLhfv4&s=aJ-zRh_5_at78b2U3zWswTWFIXH9HY0fs-amTTvewiE&e=

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: lanet2019.uniandes.edu.co (https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3D526558cbaa-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=WlwXsCRD4CLc13DSj9FgRvb39lgIK8ZbF4CuQiLhfv4&s=AgMvzmnHQkrcaYs7EijIabmQJ7YqAQJPngV-8x0iMtw&e=)



The spread of low-credibility content by social bots

    https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3D6324b1154a-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=WlwXsCRD4CLc13DSj9FgRvb39lgIK8ZbF4CuQiLhfv4&s=TIeim-ZNvpYpU3Sx7XvBotiRWsMWLj91QEIcZnv-9LA&e=

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: www.nature.com (https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3Df0890bf472-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=WlwXsCRD4CLc13DSj9FgRvb39lgIK8ZbF4CuQiLhfv4&s=-Y5O6H5iVMTsdqF3C4qER4CjF6zKkLZFhlsdjXMzSR4&e=)



Fractional Dynamics of Individuals in Complex Networks

    https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3D184ccf3e72-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=WlwXsCRD4CLc13DSj9FgRvb39lgIK8ZbF4CuQiLhfv4&s=S3QAtK-jafTg_BGCT7ttwF4BHrgWPVMnHIPkSL99tLg&e=

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 | https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3D86a083c328-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=WlwXsCRD4CLc13DSj9FgRvb39lgIK8ZbF4CuQiLhfv4&s=aQPf3jhJ6oP6LK2tvhPbY5M-C_lWEC4JLIk1DbtWtcI&e=

Source: www.frontiersin.org (https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3Da59818ac7b-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=WlwXsCRD4CLc13DSj9FgRvb39lgIK8ZbF4CuQiLhfv4&s=X4VrvUr2eZZIKPHyrJ1FcasJjhZpxPwq9iEXWEyRmts&e=)



Information Dynamics in Urban Crime

    https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3D80e6fc25a1-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=WlwXsCRD4CLc13DSj9FgRvb39lgIK8ZbF4CuQiLhfv4&s=oedgNs8uytdGEDAd5bKhtGYG7g1402bILxRtfnJ9-d4&e=

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; https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3Dd2f0f94df9-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=WlwXsCRD4CLc13DSj9FgRvb39lgIK8ZbF4CuQiLhfv4&s=dKwUxRHH33bFFgBVkx0MKzFndm9HgaHezilpMl0Jgmk&e=

Source: www.mdpi.com (https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3D1046faf7b2-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=WlwXsCRD4CLc13DSj9FgRvb39lgIK8ZbF4CuQiLhfv4&s=PhRIJPAmRAGv8a3YoJWks00UeZ8zvi5hr1aJCSuPR28&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-3D73f134b8e6-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=WlwXsCRD4CLc13DSj9FgRvb39lgIK8ZbF4CuQiLhfv4&s=r4Dm6ZL1MknzuwEEgJgTfv_sZ0l-fcA2p8n1fS1cA18&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

December 2018
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