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  March 2014

SOCNET March 2014

Subject:

selected Latest Complexity Digest Posts (fwd)

From:

Barry Wellman <[log in to unmask]>

Reply-To:

Barry Wellman <[log in to unmask]>

Date:

Mon, 3 Mar 2014 10:54:14 -0500

Content-Type:

MULTIPART/MIXED

Parts/Attachments:

Parts/Attachments

TEXT/PLAIN (157 lines)

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




   Barry Wellman
  _______________________________________________________________________

   NetLab                        FRSC                      INSNA Founder
   Faculty of Information (iSchool)                 611 Bissell Building
   140 St. George St.    University of Toronto    Toronto Canada M5S 3G6
   http://www.chass.utoronto.ca/~wellman          twitter: @barrywellman
                  NSA/CSEC: Canadian and American citizen
   NETWORKED:The New Social Operating System. Lee Rainie & Barry Wellman
   MIT Press            http://amzn.to/zXZg39      Print $14  Kindle $16
                  Old/NewCyberTimes http://bit.ly/c8N9V8
   ________________________________________________________________________


---------- Forwarded message ----------
Date: Mon, 3 Mar 2014 09:44:29 -0600
From: Complexity Digest Administration <[log in to unmask]>
To: [log in to unmask]
Subject: [comdig] Latest Complexity Digest Posts


Information Evolution in Social Networks

    Social networks readily transmit information, albeit with less than perfect fidelity. We present a large-scale measurement of this imperfect information copying mechanism by examining the dissemination and evolution of thousands of memes, collectively replicated hundreds of millions of times in the online social network Facebook. The information undergoes an evolutionary process that exhibits several regularities. A meme's mutation rate characterizes the population distribution of its variants, in accordance with the Yule process. Variants further apart in the diffusion cascade have greater edit distance, as would be expected in an iterative, imperfect replication process. Some text sequences can confer a replicative advantage; these sequences are abundant and transfer "laterally" between different memes. Subpopulations of the social network can preferentially transmit a specific variant of a meme if the variant matches their beliefs or culture. Understanding the mechanism
driving change in diffusing information has important implications for how we interpret and harness the information that reaches us through our social networks.

Information Evolution in Social Networks
Lada A. Adamic, Thomas M. Lento, Eytan Adar, Pauline C. Ng

http://arxiv.org/abs/1402.6792



Predicting Crowd Behavior with Big Public Data

    With public information becoming widely accessible and shared on today's web, greater insights are possible into crowd actions by citizens and non-state actors such as large protests and cyber activism. We present efforts to predict the occurrence, specific timeframe, and location of such actions before they occur based on public data collected from over 300,000 open content web sources in 7 languages, from all over the world, ranging from mainstream news to government publications to blogs and social media. Using natural language processing, event information is extracted from content such as type of event, what entities are involved and in what role, sentiment and tone, and the occurrence time range of the event discussed. Statements made on Twitter about a future date from the time of posting prove particularly indicative. We consider in particular the case of the 2013 Egyptian coup d'etat. The study validates and quantifies the common intuition that data on social media
(beyond mainstream news sources) are able to predict major events.

Predicting Crowd Behavior with Big Public Data
Nathan Kallus

http://arxiv.org/abs/1402.2308

See it on Scoop.it (http://www.scoop.it/t/papers/p/4016832786/2014/03/01/predicting-crowd-behavior-with-big-public-data) , via Papers (http://www.scoop.it/t/papers)




Autonomous drones flock like birds

    A Hungarian team has created the first drones that can fly as a coordinated flock. The researchers watched as the ten autonomous robots took to the air in a field outside Budapest, zipping through the open sky, flying in formation or even following a leader, all without any central control.

Autonomous drones flock like birds
Ed Yong

Nature doi:10.1038/nature.2014.14776

http://www.nature.com/news/autonomous-drones-flock-like-birds-1.14776

See it on Scoop.it (http://www.scoop.it/t/papers/p/4016735457/2014/02/27/autonomous-drones-flock-like-birds) , via Papers (http://www.scoop.it/t/papers)




Damage spreading in spatial and small-world random Boolean networks

    The study of the response of complex dynamical social, biological, or technological networks to external perturbations has numerous applications. Random Boolean networks (RBNs) are commonly used as a simple generic model for certain dynamics of complex systems. Traditionally, RBNs are interconnected randomly and without considering any spatial extension and arrangement of the links and nodes. However, most real-world networks are spatially extended and arranged with regular, power-law, small-world, or other nonrandom connections. Here we explore the RBN network topology between extreme local connections, random small-world, and pure random networks, and study the damage spreading with small perturbations. We find that spatially local connections change the scaling of the Hamming distance at very low connectivities ($\bar{K} << 1$) and that the critical connectivity of stability $\bar{K}$ changes compared to random networks. At higher $\bar{K}$, this scaling remains unchanged.
We also show that the Hamming distance of spatially local networks scales with a power law as the system size $N$ increases, but with a different exponent for local and small-world networks. The scaling arguments for small-world networks are obtained with respect to the system sizes and strength of spatially local connections. We further investigate the wiring cost of the networks. From an engineering perspective, our new findings provide the key design trade-offs between damage spreading (robustness), the network's wiring cost, and the network's communication characteristics.


Qiming Lu and Christof Teuscher
Damage spreading in spatial and small-world random Boolean networks
Phys. Rev. E 89, 022806 (2014)

http://pre.aps.org/abstract/PRE/v89/i2/e022806

See it on Scoop.it (http://www.scoop.it/t/papers/p/4016265415/2014/02/27/damage-spreading-in-spatial-and-small-world-random-boolean-networks) , via Papers (http://www.scoop.it/t/papers)




 Alessandro Vespignani on theoretical developments for complex networks and systems

    This interview with Alessandro Vespignani is about the future of modelling and forecasting of epidemics and is part of the Futurium Talking Futures interview series. More information is available here:

https://ec.europa.eu/digital-agenda/futurium/en/interviews

See it on Scoop.it (http://www.scoop.it/t/talks/p/4016676135/2014/02/27/alessandro-vespignani-on-theoretical-developments-for-complex-networks-and-systems) , via Talks (http://www.scoop.it/t/talks)




 Dirk Helbing on complexity in economic theory

    This interview with Dirk Helbing on the Future of the economy is part of the Futurium Talking Futures interview series. More information is available here: https://ec.europa.eu/digital-agenda/futurium/en/interviews

See it on Scoop.it (http://www.scoop.it/t/talks/p/4016674663/2014/02/27/dirk-helbing-on-complexity-in-economic-theory) , via Talks (http://www.scoop.it/t/talks)




Introduction to Computational Social Science: Principles and Applications (by Claudio Cioffi-Revilla)

    This reader-friendly textbook is the first work of its kind to provide a unified Introduction to Computational Social Science (CSS). Four distinct methodological approaches are examined in detail, namely automated social information extraction, social network analysis, social complexity theory and social simulation modeling. The coverage of these approaches is supported by a discussion of the historical context, as well as by a list of texts for further reading. Features: highlights the main theories of the CSS paradigm as causal explanatory frameworks that shed new light on the nature of human and social dynamics; explains how to distinguish and analyze the different levels of analysis of social complexity using computational approaches; discusses a number of methodological tools; presents the main classes of entities, objects and relations common to the computational analysis of social complexity; examines the interdisciplinary integration of knowledge in the context of
social phenomena.

See it on Scoop.it (http://www.scoop.it/t/cxbooks/p/4016007658/2014/02/26/introduction-to-computational-social-science-principles-and-applications-by-claudio-cioffi-revilla) , via CxBooks (http://www.scoop.it/t/cxbooks)




Networks of Networks: The Last Frontier of Complexity (by Gregorio D'Agostino and Antonio Scala)

    The present work is meant as a reference to provide an organic and comprehensive view of the most relevant results in the exciting new field of Networks of Networks (NetoNets). Seminal papers have recently been published posing the basis to study what happens when different networks interact, thus providing evidence for the emergence of new, unexpected behaviors and vulnerabilities. From those seminal works, the awareness on the importance understanding Networks of Networks (NetoNets) has spread to the entire community of Complexity Science. The reader will benefit from the experience of some of the most well-recognized leaders in this field. The contents have been aggregated under four headings; General Theory, Phenomenology, Applications and Risk Assessment. The reader will be impressed by the different applications of the general paradigm that span from physiology, to financial risk, to transports. We are currently making the first steps to reduce the distance between the
language and the way of thinking of the two communities of experts in real infrastructures and the complexity scientists. Although this path may prove to be long, it is extremely promising, both in extending our understanding of complex systems and in finding concrete applications that can enhance the life quality of millions of people.

BW: PAUL CRAVEN AND I INVENTED THE TERM/CONCEPT OF "NETWORK OF NETWORKS" 
IN 1973

See it on Scoop.it (http://www.scoop.it/t/cxbooks/p/4016009261/2014/02/26/networks-of-networks-the-last-frontier-of-complexity-by-gregorio-d-agostino-and-antonio-scala) , via CxBooks (http://www.scoop.it/t/cxbooks)




Postdoc, ETH Zurich

    Postdoc with a strongbackground in computer science to strengthen our interdisciplinary team in the areas of Web science, Big Data analytics, smartphone platforms, and distributed computing. The goals of this project include designing a "Planetary Nervous System" that would give us a detailed real-time view of the world, crawling and analyzing web content on a large scale, and establishing a smartphone platform for gathering scientific data. The successful applicant is expected to actively interact with other team members from different disciplines and to acquire a high-level understanding of the general topics in quantitative social sciences, sociophysics, and related areas.

https://pub.refline.ch//845721/2982/++publications++/1/index.html

See it on Scoop.it (http://www.scoop.it/t/cxannouncements/p/4016536924/2014/02/24/postdoc-eth-zurich) , via CxAnnouncements (http://www.scoop.it/t/cxannouncements)


==============================================
Founding Editor: Gottfried Mayer.
Editor-in-Chief: Carlos Gershenson.

To manage subscriptions, please go to http://comdig.unam.mx/subscriptions.php

You can contribute to Complexity Digest selecting one of our topics (http://www.scoop.it/u/complexity-digest ) 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

June 2021
May 2021
April 2021
March 2021
February 2021
January 2021
December 2020
November 2020
October 2020
September 2020
August 2020
July 2020
June 2020
May 2020
April 2020
March 2020
February 2020
January 2020
December 2019
November 2019
October 2019
September 2019
August 2019
July 2019
June 2019
May 2019
April 2019
March 2019
February 2019
January 2019
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