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

85 citations · 285 across the 40 of their papers we have counts for

collaborators
Showing 2020Show all

5 papers · 1 filter

stat.ML2020★ 3 cited

A non-autonomous equation discovery method for time signal classification

Ryeongkyung Yoon, Harish S. Bhat, Braxton Osting

Certain neural network architectures, in the infinite-layer limit, lead to systems of nonlinear differential equations. Motivated by this idea, we develop a framework for analyzing…

math.ST2020★ 5 cited

Consistency of archetypal analysis

Braxton Osting, Dong Wang, Yiming Xu +1

Archetypal analysis is an unsupervised learning method that uses a convex polytope to summarize multivariate data. For fixed , the method finds a convex polytope with vertic…

math.SP2020★ 3 cited

Computation of free boundary minimal surfaces via extremal Steklov eigenvalue problems

Chiu-Yen Kao, Braxton Osting, Èdouard Oudet

Recently Fraser and Schoen showed that the solution of a certain extremal Steklov eigenvalue problem on a compact surface with boundary can be used to generate a free boundary mini…

cs.SI2020★ 7 cited

A metric on directed graphs and Markov chains based on hitting probabilities

Zachary M. Boyd, Nicolas Fraiman, Jeremy L. Marzuola +3

The shortest-path, commute time, and diffusion distances on undirected graphs have been widely employed in applications such as dimensionality reduction, link prediction, and trip…

math.AP2020★ 5 cited

A continuum limit for the PageRank algorithm

Amber Yuan, Jeff Calder, Braxton Osting

Semi-supervised and unsupervised machine learning methods often rely on graphs to model data, prompting research on how theoretical properties of operators on graphs are leveraged…