糖心TV

Skip to main content Skip to navigation

糖心TV Complexity Science Events

Complexity Centre and MathSys CDT events carry priority over room D1.07.

To book D1.07 please email Sheetal dot Sharma at warwick dot ac dot uk

Please note that your event booking is for D1.07 only. The adjacent common room is a private area for the MathSys Centre that cannot used as part of your booking.

Wednesday, October 21, 2015

Select tags to filter on
Tue, Oct 20 Today Thu, Oct 22 Jump to any date

How do I use this calendar?

You can click on an event to display further information about it.

The toolbar above the calendar has buttons to view different events. Use the left and right arrow icons to view events in the past and future. The button inbetween returns you to today's view. The button to the right of this shows a mini-calendar to let you quickly jump to any date.

The dropdown box on the right allows you to see a different view of the calendar, such as an agenda or a termly view.

If this calendar has tags, you can use the labelled checkboxes at the top of the page to select just the tags you wish to view, and then click "Show selected". The calendar will be redisplayed with just the events related to these tags, making it easier to find what you're looking for.

 
-
Export as iCalendar
MSc and EM weekly student meeting
D1.07 Complexity Science

Stefan Grosskinsky

Heather Robson

-
Export as iCalendar
Computational Techniques Lecture
D1.07
-
Export as iCalendar
Ben Collyer Pre-Viva Talk
D1.07
-
Export as iCalendar
Complexity Forum: Mikko Kivelä (University of Oxford)
D1.07

Multilayer networks

Network science has been very successful in investigations of a wide variety of applications from biology and the social sciences to physics, technology, and more. In many situations, it is already insightful to use a simple (and typically naive) representation as a simple, binary graph in which nodes are entities and unweighted edges encapsulate the interactions between those entities. This allows one to use the powerful methods and concepts for example from graph theory, and numerous advances have been made in this way. However, as network science has matured and (especially) as ever more complicated data has become available, it has become increasingly important to develop tools to analyse more complicated structures. For example, many systems that were typically initially studied as simple graphs are now often represented as time-dependent networks, networks with multiple types of connections, or interdependent networks. This has allowed deeper and more realistic analyses of complex networked systems, but it has simultaneously introduced mathematical constructions, jargon, and methodology that are specific to research in each type of system. Recently, the concept of "multilayer networks" was developed in order to unify the aforementioned disparate language (and disparate notation) and to bring together the different generalised network concepts that included layered graphical structures. In this talk, I will introduce multilayer networks and discuss how to study their structure. Generalisations of the clustering coefficient for multiplex networks and graph isomorphism for general multilayer networks are used as illustrative examples.

The talk will be based on these three articles:

-
Export as iCalendar
Ben Collyer Viva
-
Export as iCalendar
PhD group meeting
D1.07 Complexity Science

Gareth Alexander

Stefan Grosskinsky

-
Export as iCalendar
Transferrable Skill intro for new PhD students
D1.07

Nikola Chmel

Heather Robson

Placeholder

Let us know you agree to cookies