Metropolis-Hastings Random Multiplex Generation

Theodore Papamarkou (University of Glasgow)

Friday 4th March, 2016 15:00-16:00 Maths 522


A range of random graph generation methods have been developed and subsequently utilized in pattern detection and significance assessment of network observables. Multiplex networks generalize traditional graph theory by providing a framework to study multilayer systems. This talk presents an extension to existing Markov Chain Monte Carlo methodology for graph sampling by proposing a broadened Metropolis-Hastings algorithm that samples from ensembles of multiplex networks.

Add to your calendar

Download event information as iCalendar file (only this event)