The graph Ginzburg-Landau functional has been extensively used for data clustering, classification, and image segmentation problems in recent years. In this talk we will look at the discrete to continuum Gamma limit of the functional on a regular graph and discuss interesting variations of the functional.

This presentation is part of Minisymposium “MS17 - Discrete-to-continuum graphical methods for large-data clustering, classification and segmentation”
organized by: Matthew Thorpe (University of Cambridge) , Luca Calatroni (CMAP, École Polytechnique CNRS) , Daniel Tenbrinck (University of Münster) .

Authors:

Yves van Gennip (University of Nottingham)

Keywords: