Event info

Date: 12:00 - 13:00, JST Tuesday, 19 May 2026

Zoom: Online via Zoom

Speaker: Dr. Sevvandi Kandanaarachchi (CSIRO, Australia)

Title: Graphons and Sparsity

Abstract:
Graphons can be thought of as graph generators. They are symmetric, measurable functions traditionally defined on the unit square. Intuitively, a graphon can be obtained by scaling the adjacency matrix to the unit square and taking its limit. However, graphons can only represent dense graphs, while many biological and social network graphs are sparse. In this talk, we will present a simple construction to generate sparse graphs using line graphs and look at related graphon constructions for modelling sparse graphs, including molecular graphs.

--------------------------------------------
This seminar series is a valuable opportunity for graduate students to get acquainted with the work of more experienced researchers in various mathematical fields. Undergraduate students are also welcome to join, as the talks are intended for non-experts, too. Regardless of your area of research, you can attend the seminar to expand your knowledge and get in touch with the latest developments in mathematics for industry.
--------------------------------------