Past Events

We consider a class of disordered mean-field combinatorial optimization problems, focusing on the Gibbs measure, where the inverse temperature does not vary with the size of the graph and the edge weights are sampled from a general distribution. We...

Recent and rapid breakthroughs in contemporary biology, climate science, and data science have unveiled a spectrum of intricate mathematical challenges which can be tackled through the fusion of applied and numerical analysis, as well as optimisation...

In this talk, I will review some different notions of principal eigenvalues, their qualitative properties and applications in some long time dynamics of Fisher-KPP equations with nonlocal dispersals including the time-periodic case.

The Farey sequence FQ of order Q is an ascending sequence of fractions a/b in the unit interval (0,1] such that (a,b)=1 and 0

Measuring the serial dependence across time is critical in model identification and diagnosis in time series (TS) analysis. In classic TS analysis, the autocorrelation function is perhaps the most widely used method to examine the temporal...

Acyclic models, as its commonly seen today, is a proof technique used to show when two chain complexes are chain equivalent or have isomorphic homology. It originated as a theorem by Eilenberg and MacLane (1953), where it was immediately used to show...

Kemeny's constant, a fundamental parameter in the theory of Markov chains, has recently received significant attention within the graph theory community. Originally defined for a discrete, finite, time-homogeneous, and irreducible Markov chain based...

Conway-Coxeter friezes are arrays of positive integers satisfying a determinantal condition, the so-called diamond rule. Recently, these combinatorial objects have been of considerable interest in representation theory, since they encode cluster...

Markov chain Monte Carlo (MCMC) algorithms, such as the Metropolis algorithm, are designed to converge to complicated high-dimensional target distributions, to facilitate sampling. The speed of this convergence is essential for practical use. In this...

Reconstructing simplicial complexes from partial information has been a problem of interest for decades. A triangulation of a d-dimensional sphere is obtained by gluing a collection of d-dimensional simplices (“higher dimensional triangles”) along...