Javascript must be enabled

# Braxton Osting : Dirichlet Graph Partitions

IÂ?ll discuss a geometric approach to graph partitioning where the optimality criterion is given by the sum of the first Laplace-Dirichlet eigenvalues of the partition components. This eigenvalue optimization problem can be solved by a rearrangement algorithm, which we show to converge in a finite number of iterations to a local minimum of a relaxed objective. This partitioning method compares well to state-of-the-art approaches on a variety of graphs constructed from manifold discretizations, synthetic data, the MNIST handwritten digit dataset, and images. I'll present a consistency result for geometric graphs, stating convergence of graph partitions to an appropriate continuum partition.

**Category**: Applied Math and Analysis**Duration**: 01:34:47**Date**: April 18, 2016 at 4:25 PM**Views**: 106-
**Tags:**seminar, Applied Math And Analysis Seminar

## 0 Comments