activity
20072025
most citedMean curvature, threshold dynamics, and phase field theory on finite graphs

85 citations · 137 across the 12 of their papers we have counts for

collaborators

13 papers

math.AP2025

An extension to Banach stackings of the Brezis--Pazy semigroup-convergence theorem, with applications to -convex gradient flows

Samuel Mercer, Yves van Gennip

A 1972 theorem by Brezis and Pazy establishes the uniform convergence of nonlinear semigroups generated by -accretive operators on a Banach space. Our goal is to expand the sett…

math.PR2025

Discrete-to-continuum limits of semilinear stochastic evolution equations in Banach spaces

Yves van Gennip, Jonas Latz, Joshua Willems

We study the convergence of semilinear parabolic stochastic evolution equations, posed on a sequence of Banach spaces approximating a limiting space and driven by additive white no…

math.AP2022★ 1 cited

Graph gradient flows : from discrete to continuum

Yoshikazu Giga, Yves van Gennip, Jun Okamoto

This paper gives a framework to study a continuum limit of a gradient flow on a graph where the number of vertices increases in an appropriate way. As examples we prove the converg…

math.NA2020★ 18 cited

Classification and image processing with a semi-discrete scheme for fidelity forced Allen--Cahn on graphs

Jeremy Budd, Yves van Gennip, Jonas Latz

This paper introduces a semi-discrete implicit Euler (SDIE) scheme for the Allen-Cahn equation (ACE) with fidelity forcing on graphs. Bertozzi and Flenner (2012) pioneered the use…

math.AP2019★ 10 cited

Graph MBO as a semi-discrete implicit Euler scheme for graph Allen-Cahn flow

Jeremy Budd, Yves van Gennip

In recent years there has been an emerging interest in PDE-like flows defined on finite graphs, with applications in clustering and image segmentation. In particular for image segm…

cs.SI2019

An MBO scheme for clustering and semi-supervised clustering of signed networks

Mihai Cucuringu, Andrea Pizzoferrato, Yves van Gennip

We introduce a principled method for the signed clustering problem, where the goal is to partition a graph whose edge weights take both positive and negative values, such that edge…