BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260914T021935Z
UID:Seminar-dept-434@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20170314T130000
DTEND:20170314T140000
SUMMARY:School Seminar Series
DESCRIPTION:Dr. Naoki Masuda: Finding core-periphery pairs in networks\n\nWith a core-periphery structure of networks, core nodes are densely\n\ninterconnected, peripheral nodes are connected to core nodes to different\n\nextents, and peripheral nodes are sparsely interconnected. Core-periphery\n\nstructure composed of a single core and periphery has been identified for\n\nvarious networks. However, analogous to the observation that many em-\n\npirical networks are composed of densely interconnected groups of nodes,\n\ni.e., communities, a network may be better regarded as a collection of\n\nmultiple cores and peripheries. We propose a scalable algorithm to detect\n\nmultiple non-overlapping groups of core-periphery structure in a network.\n\nWe illustrate our algorithm using synthesised and empirical networks. For\n\nexample, we find distinct core-periphery pairs with different political lean-\n\nings in a network of political blogs and separation between international\n\nand domestic subnetworks of airports in some single countries in a world-\n\nwide airport network.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=434
LOCATION:Ashton Lecture Theater
END:VEVENT
END:VCALENDAR