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

SOCNET September 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, 17 Sep 2018 08:45:14 -0400

Content-Type:

MULTIPART/MIXED

Parts/Attachments:

Parts/Attachments

TEXT/PLAIN (107 lines)

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

Best regards to anyone not named Florence or Mongkut

   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
  _______________________________________________________________________
   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=_atBegZHZi6CH7qHYlIvwPFYWq4Nx0MFtihS63IAmtM&s=DECpT6UYHaOLclwHFsWHEBZCXDa5sRHvg84Vd3Q9ss0&e=            https://urldefense.proofpoint.com/v2/url?u=http-3A__amzn.to_zXZg39&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=_atBegZHZi6CH7qHYlIvwPFYWq4Nx0MFtihS63IAmtM&s=syHNU8SSd1otTi-IUYIn_wDGG9gwgBmSAHGVVdBqoro&e=
              https://urldefense.proofpoint.com/v2/url?u=https-3A__en.wikipedia.org_wiki_Barry-5FWellman&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=_atBegZHZi6CH7qHYlIvwPFYWq4Nx0MFtihS63IAmtM&s=lZm3QH9JurNLml0nfVOEatW-nRmrS7yK3TXEV-_hUnw&e=
   _______________________________________________________________________


---------- Forwarded message ----------
Date: Mon, 17 Sep 2018 11:04:41 +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-3Da0908b3beb-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=_atBegZHZi6CH7qHYlIvwPFYWq4Nx0MFtihS63IAmtM&s=Ur-f8M1R9eo7hWeJV5cPx0CwC5zAAMcl4z4cBUq1UCw&e=


Comparing two classes of biological distribution systems using network analysis

    https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3D085a5f8058-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=_atBegZHZi6CH7qHYlIvwPFYWq4Nx0MFtihS63IAmtM&s=MsPCh-8Del4DbhQDv6iI0jiMxRPQCpfLxlbCgxuPraM&e=

Distribution networks such as vasculature systems or urban transportation 
pathways are prevalent in our world. Understanding how different kinds of 
transport systems are organized to allow for efficient function in their 
environments and in the presence of constraints on material costs is 
currently an open area of investigation. In this study, we use methods 
from network science to compare and contrast the structure of two 
different classes of biological distribution networks: mycelial fungi and 
rodent brain vasculature. While each of these systems have been studied 
separately, less work has focused on understanding the diversity of their 
network organization. Here, we first examine several measures that 
characterize network connectivity on varying scales, finding 
that˙˙although both systems have highly constrained network layouts˙˙there 
are quantifiable differences in their architectures. Furthermore, using 
network analyses that specifically consider the embedding of these 
transport networks into real space, we observe that the two types of 
systems display distinct tradeoffs in network correlates of material cost, 
efficiency, and robustness. Together, our results provide evidence that 
while different distribution networks have general resemblances, they also 
exhibit variable design features that could reflect differences in their 
functions, environmental conditions, or development.


Papadopoulos L, Blinder P, Ronellenfitsch H, Klimm F, Katifori E, Kleinfeld D, et al. (2018) Comparing two classes of biological distribution systems using network analysis. PLoS Comput Biol 14(9): e1006428. https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3Dbf33a44d6f-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=_atBegZHZi6CH7qHYlIvwPFYWq4Nx0MFtihS63IAmtM&s=VY64JakYMgOgtZZGCPvVupio5aN5JFIuWs3nML6dLfU&e=

Source: journals.plos.org (https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3D22c7877123-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=_atBegZHZi6CH7qHYlIvwPFYWq4Nx0MFtihS63IAmtM&s=Citb1iH0iDQNUzDFLoFSh864zPq_BbBnboaEYjmpebg&e=)



Attack Tolerance of Link Prediction Algorithms: How to Hide Your Relations in a Social Network

    Link prediction is one of the fundamental research problems in network 
analysis. Intuitively, it involves identifying the edges that are most 
likely to be added to a given network, or the edges that appear to be 
missing from the network when in fact they are present. Various algorithms 
have been proposed to solve this problem over the past decades. For all 
their benefits, such algorithms raise serious privacy concerns, as they 
could be used to expose a connection between two individuals who wish to 
keep their relationship private. With this in mind, we investigate the 
ability of such individuals to evade link prediction algorithms. More 
precisely, we study their ability to strategically alter their connections 
so as to increase the probability that some of their connections remain 
unidentified by link prediction algorithms. We formalize this question as 
an optimization problem, and prove that finding an optimal solution is 
NP-complete. Despite this hardness, we show that the situation is not 
bleak in practice. In particular, we propose two heuristics that can 
easily be applied by members of the general public on existing social 
media. We demonstrate the effectiveness of those heuristics on a wide 
variety of networks and against a plethora of link prediction algorithms.


Attack Tolerance of Link Prediction Algorithms: How to Hide Your Relations in a Social Network
Marcin Waniek, Kai Zhou, Yevgeniy Vorobeychik, Esteban Moro, Tomasz P. Michalak, Talal Rahwan

Source: arxiv.org (https://urldefense.proofpoint.com/v2/url?u=https-3A__unam.us4.list-2Dmanage.com_track_click-3Fu-3D0eb0ac9b4e8565f2967a8304b-26id-3D836ce767c2-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=_atBegZHZi6CH7qHYlIvwPFYWq4Nx0MFtihS63IAmtM&s=DqvbDy-bZovLf-JJTtPaAziQtz_XuQRFESVbzJMjUu4&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-3D1aa26399a5-26e-3D55e25a0e3e&d=DwIFAw&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=_atBegZHZi6CH7qHYlIvwPFYWq4Nx0MFtihS63IAmtM&s=ZvdS-0n7KQcnqWkEEWT76_ivsX0B6IpJAidwNBwEbKY&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 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