scholarly journals Large data limit for a phase transition model with the p-Laplacian on point clouds

2018 ◽  
Vol 31 (2) ◽  
pp. 185-231 ◽  
Author(s):  
R. CRISTOFERI ◽  
M. THORPE

The consistency of a non-local anisotropic Ginzburg–Landau type functional for data classification and clustering is studied. The Ginzburg–Landau objective functional combines a double well potential, that favours indicator valued functions, and the p-Laplacian, that enforces regularity. Under appropriate scaling between the two terms, minimisers exhibit a phase transition on the order of ɛ = ɛn, where n is the number of data points. We study the large data asymptotics, i.e. as n → ∝, in the regime where ɛn → 0. The mathematical tool used to address this question is Γ-convergence. It is proved that the discrete model converges to a weighted anisotropic perimeter.

2018 ◽  
Vol 149 (2) ◽  
pp. 387-427 ◽  
Author(s):  
Matthew Thorpe ◽  
Florian Theil

AbstractThe Ginzburg–Landau functional is a phase transition model which is suitable for classification type problems. We study the asymptotics of a sequence of Ginzburg–Landau functionals with anisotropic interaction potentials on point clouds Ψnwherendenotes the number data points. In particular, we show the limiting problem, in the sense of Γ-convergence, is related to the total variation norm restricted to functions taking binary values, which can be understood as a surface energy. We generalize the result known for isotropic interaction potentials to the anisotropic case and add a result concerning the rate of convergence.


2001 ◽  
Vol 278 (5) ◽  
pp. 243-248 ◽  
Author(s):  
Bin Zhou ◽  
Jiu-Qing Liang ◽  
Fu-Cho Pu

2011 ◽  
Vol 268-270 ◽  
pp. 811-816
Author(s):  
Yong Zhou ◽  
Yan Xing

Affinity Propagation(AP)is a new clustering algorithm, which is based on the similarity matrix between pairs of data points and messages are exchanged between data points until clustering result emerges. It is efficient and fast , and it can solve the clustering on large data sets. But the traditional Affinity Propagation has many limitations, this paper introduces the Affinity Propagation, and analyzes in depth the advantages and limitations of it, focuses on the improvements of the algorithm — improve the similarity matrix, adjust the preference and the damping-factor, combine with other algorithms. Finally, discusses the development of Affinity Propagation.


2019 ◽  
Vol 21 (21) ◽  
pp. 10888-10894
Author(s):  
Jorge Ontaneda ◽  
Francesc Viñes ◽  
Francesc Illas ◽  
Ricardo Grau-Crespo

Density functional theory calculations with non-local correlation functionals, properly accounting for dispersion forces, predict the presence of two minima in the interaction energy between h-BN and Ni(111).


Author(s):  
Massimo Gobbino ◽  
Maria Giovanna Mora

We approximate functionals depending on the gradient of u and on the behaviour of u near the discontinuity points by families of non-local functionals where the gradient is replaced by finite differences. We prove pointwise convergence, Γ-convergence and a compactness result, which implies, in particular, the convergence of minima and minimizers.


Sign in / Sign up

Export Citation Format

Share Document