BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Small and Large Scale Network Features - Sofia Olhede (University 
 College London)
DTSTART:20180321T100000Z
DTEND:20180321T110000Z
UID:TALK102733@talks.cam.ac.uk
CONTACT:INI IT
DESCRIPTION:Comparing and contrasting networks is hindered by their strong
 ly non-Euclidean structure. I will discuss how one determines &ldquo\;opti
 mal&rdquo\; features to compare two different networks of different sparsi
 ty and size. As the topology of any complex system is key to understanding
  its structure and function\, the result will be developed from topologica
 l ideas. Fundamentally\, algebraic topology guarantees that any system rep
 resented by a network can be understood through its closed paths. The leng
 th of each path provides a notion of scale\, which is vitally important in
  characterizing dominant modes of system behavior. Here\, by combining top
 ology with scale\, we prove the existence of universal features which reve
 al the dominant scales of any network. We use these features to compare se
 veral canonical network types in the context of a social media discussion 
 which evolves through the sharing of rumors\, leaks and other news. Our an
 alysis enables for the first time a universal understanding of the balance
  between loops and tree-like structure across network scales\, and an asse
 ssment of how this balance interacts with the spreading of information onl
 ine. Crucially\, our results allow networks to be quantified and compared 
 in a purely model-free way that is theoretically sound\, fully automated\,
  and inherently scalable.  <br><br><br><br>
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR