University of Birmingham > Talks@bham > Applied Mathematics Seminar Series > Counting small subgraphs in multi-layer networks

Counting small subgraphs in multi-layer networks

Add to your list(s) Download to your calendar using vCal

  • UserJess Enright, University of Stirling
  • ClockThursday 09 November 2017, 12:00-13:00
  • HouseBiosciences E102.

If you have a question about this talk, please contact Meurig Gallagher.

(Joint work with Kitty Meeks)

Multi-layer networks occur widely in natural and social systems. I’ll outline details of a few of these, including the sheep and cattle contact networks in Britain. Motivated by a desire to compute efficiently on such networks, I’ll talk about the problem of counting the number of occurrences of (small) subgraphs or motifs in multi-layer graphs in which each layer of the graph has useful structural properties.

Focussing on the parameterised complexity of motif-counting problems, I’ll outline conditions on the layers of a network that yield fixed-parameter tractable algorithms for motif-counting in the overall network. Finally, I’ll talk about upcoming plans for computational experiments to test the feasibility of parameterised algorithms on the sheep and cattle networks.

This talk is part of the Applied Mathematics Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.