University of Cambridge > Talks.cam > Applied and Computational Analysis > A brief overview of PDEs on graphs

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

A brief overview of PDEs on graphs

Download to your calendar using vCal

If you have a question about this talk, please contact Matthew Thorpe .

Recent years have seen a lot of interest in partial differential equations discretised on arbitrary network structures. Especially driven by applications in data analysis and image processing, models such as the graph-based Ginzburg-Landau functional and variations on it have been used for processes such as data clustering, image segmentation, and maximum-cut computations. In this talk I will give a brief overview of some of the theory and applications in this area.

This talk is part of the Applied and Computational Analysis series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

MR9, CMS, Wilberforce Road, Cambridge, CB3 0WB Pharmacology Lecture Theatre, Tennis Court Road - map on http://tinyurl.com/rxaj7 Centre for Mathematical Sciences, Wilberforce Road, Lecture room MR9 (Pavilion B)

Other talks

Title to be confirmed How bubble acoustics can help in three apocalypses Title TBC Group Work The Play Paradox: How video games build better humans Title TBC
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity