Networks seminar
Welcome to the homepage of the Networks seminars, a weekly seminar series on networks, complex systems, and related topics held in the Mathematical Institute. Our seminar usually takes place on Tuesdays at 15:00-16:00 in room C3 at the Mathematical Institute. A link to attend the event via Zoom will be made available in the schedule of upcoming talks below (for logged-in users) and via the mailing list.
To sign up to our mailing list simply send an empty email to the following address:
@email
If you would like to give a presentation at our seminar, please do not hesitate to contact the organiser Vedanta Thapar. The presentation can be either about your own work or on some (recent) interesting article on networks or on complex systems in general.
In case you missed any of the talks, we will also make recordings of the talks available on our youtube channel.
Upcoming Seminars
Embedding networks with the random walk first return time distribution
Abstract
We propose the first return time distribution (FRTD) of a random walk as an interpretable and mathematically grounded node embedding. The FRTD assigns a probability mass function to each node, allowing us to define a distance between any pair of nodes using standard metrics for discrete distributions. We present several arguments to motivate the FRTD embedding. First, we show that FRTDs are strictly more informative than eigenvalue spectra, yet insufficient for complete graph identification, thus placing FRTD equivalence between cospectrality and isomorphism. Second, we argue that FRTD equivalence between nodes captures structural similarity. Third, we empirically demonstrate that the FRTD embedding outperforms manually designed graph metrics in network alignment tasks. Finally, we show that random networks that approximately match the FRTD of a desired target also preserve other salient features. Together these results demonstrate the FRTD as a simple and mathematically principled embedding for complex networks.
Mind the sign: what we miss when we ignore antagonistic interactions
Abstract
Many complex systems have both cooperative and antagonistic interactions. For example, countries form alliances and wage wars, financial assets move together or in opposite directions, genes activate or inhibit each other, and users of online platforms endorse or reject each other. We can represent these systems as signed networks, in which each edge has a positive or a negative sign. However, most tools of network science assume non-negative weights. The common practices of discarding negative edges, taking absolute values, or treating signs as ordinary weights can thus lead to wrong or incomplete conclusions. In this talk, we first review where signed networks appear and which problems arise when we apply standard methods to them. Then we discuss three types of analysis that account for signs explicitly: measuring structural balance at different scales, detecting mesoscale structure, and constructing network embeddings. Throughout, we illustrate how incorporating the signs into the analysis reveals structural properties that conventional approaches can overlook.
You can also find a list of all talks (with abstracts) prior to 2018 here, and the former website
of the Networks journal club at the Oxford complexity center (CABDyN) here.
Unsubscribing?
Simply send an empty email to
@email