arXiv subjects

Braxton Osting

Publications and source records attributed to Braxton Osting.

52 records · Page 3Linked to original sources

arXiv2018

A maximal energy pointset configuration problem

We consider the extremal pointset configuration problem of maximizing a kernel-based energy subject to the geometric constraints that the points are contained in a fixed set, the pairwise distances are bounded below, and that every closed ball of fixed radius contains at least one point. We also formulate an extremal density problem, whose solution provides an upper bound for the pointset configuration problem in the limit as the number of points tends to infinity. Existence of solutions to both problems is established and the relationship between the parameters in the two problems is studied. Several examples are studied in detail, including the density problem for the $d$-dimensional ball and sphere, where the solution can be computed exactly using rearrangement inequalities. We develop a computational method for the density problem that is very similar to the Merriman-Bence-Osher (MBO) diffusion-generated method. The method is proven to be increasing for all non-stationary iterations and is applied to study more examples.

math.OC↗

arXiv2018

Extremal Spectral Gaps for Periodic Schrödinger Operators

The spectrum of a Schrödinger operator with periodic potential generally consists of bands and gaps. In this paper, for fixed m, we consider the problem of maximizing the gap-to-midgap ratio for the m-th spectral gap over the class of potentials which have fixed periodicity and are pointwise bounded above and below. We prove that the potential maximizing the m-th gap-to-midgap ratio exists. In one dimension, we prove that the optimal potential attains the pointwise bounds almost everywhere in the domain and is a step-function attaining the imposed minimum and maximum values on exactly m intervals. Optimal potentials are computed numerically using a rearrangement algorithm and are observed to be periodic. In two dimensions, we develop an efficient rearrangement method for this problem based on a semi-definite formulation and apply it to study properties of extremal potentials. We show that, provided a geometric assumption about the maximizer holds, a lattice of disks maximizes the first gap-to-midgap ratio in the infinite contrast limit. Using an explicit parametrization of two-dimensional Bravais lattices, we also consider how the optimal value varies over all equal-volume lattices.

math.OC↗

arXiv2018

A diffusion generated method for computing Dirichlet partitions

A Dirichlet $k$-partition of a closed $d$-dimensional surface is a collection of $k$ pairwise disjoint open subsets such that the sum of their first Laplace-Beltrami-Dirichlet eigenvalues is minimal. In this paper, we develop a simple and efficient diffusion generated method to compute Dirichlet $k$-partitions for $d$-dimensional flat tori and spheres. For the $2d$ flat torus, for most values of $k=3$-9,11,12,15,16, and 20, we obtain hexagonal honeycombs. For the $3d$ flat torus and $k=2,4,8,16$, we obtain the rhombic dodecahedral honeycomb, the Weaire-Phelan honeycomb, and Kelvin's tessellation by truncated octahedra. For the $4d$ flat torus, for $k=4$, we obtain a constant extension of the rhombic dodecahedral honeycomb along the fourth direction and for $k=8$, we obtain a 24-cell honeycomb. For the $2d$ sphere, we also compute Dirichlet partitions for $k=3$-7,9,10,12,14,20. Our computational results agree with previous studies when a comparison is available. As far as we are aware, these are the first published results for Dirichlet partitions of the $4d$ flat torus.

math.OC↗

arXiv2017

A generalized MBO diffusion generated motion for orthogonal matrix-valued fields

We consider the problem of finding stationary points of the Dirichlet energy for orthogonal matrix-valued fields. Following the Ginzburg-Landau approach, this energy is relaxed by penalizing the matrix-valued field when it does not take orthogonal matrix values. A generalization of the MBO diffusion generated motion is introduced that effectively finds local minimizers of this energy by iterating two steps until convergence. In the first step, as in the original method, the current matrix-valued field is evolved by the diffusion equation. In the second step, the field is pointwise reassigned to the closest orthogonal matrix, which can be computed via the singular value decomposition. We extend the Lyapunov function of Esedoglu and Otto to show that the method is non-increasing on iterates and hence, unconditionally stable. We also prove that spatially discretized iterates converge to a stationary solution in a finite number of iterations. The algorithm is implemented using the closest point method and non-uniform fast Fourier transform. We conclude with several numerical experiments on flat tori and closed surfaces, which, unsurprisingly, exhibit classical behavior from the Allen-Cahn and complex Ginzburg Landau equations, but also new phenomena.

math.AP↗

arXiv2017

Consistency of Dirichlet Partitions

A Dirichlet $k$-partition of a domain $U \subseteq \mathbb{R}^d$ is a collection of $k$ pairwise disjoint open subsets such that the sum of their first Laplace-Dirichlet eigenvalues is minimal. A discrete version of Dirichlet partitions has been posed on graphs with applications in data analysis. Both versions admit variational formulations: solutions are characterized by minimizers of the Dirichlet energy of mappings from $U$ into a singular space $Σ_k \subseteq \mathbb{R}^k$. In this paper, we extend results of N.\ García Trillos and D.\ Slepčev to show that there exist solutions of the continuum problem arising as limits to solutions of a sequence of discrete problems. Specifically, a sequence of points $\{x_i\}_{i \in \mathbb{N}}$ from $U$ is sampled i.i.d.\ with respect to a given probability measure $ν$ on $U$ and for all $n \in \mathbb{N}$, a geometric graph $G_n$ is constructed from the first $n$ points $x_1, x_2, \ldots, x_n$ and the pairwise distances between the points. With probability one with respect to the choice of points $\{x_i\}_{i \in \mathbb{N}}$, we show that as $n \to \infty$ the discrete Dirichlet energies for functions $G_n \to Σ_k$ $Γ$-converge to (a scalar multiple of) the continuum Dirichlet energy for functions $U \to Σ_k$ with respect to a metric coming from the theory of optimal transport. This, along with a compactness property for the aforementioned energies that we prove, implies the convergence of minimizers. When $ν$ is the uniform distribution, our results also imply the statistical consistency statement that Dirichlet partitions of geometric graphs converge to partitions of the sampled space in the Hausdorff sense.

math.ST↗

arXiv2017

A Variational Characterization of Fluid Sloshing with Surface Tension

We consider the sloshing problem for an incompressible, inviscid, irrotational fluid in an open container, including effects due to surface tension on the free surface. We restrict ourselves to a constant contact angle and seek time-harmonic solutions of the linearized problem, which describes the time-evolution of the fluid due to a small initial disturbance of the surface at rest. As opposed to the zero surface tension case, where the problem reduces to a partial differential equation for the velocity potential, we obtain a coupled system for the velocity potential and the free surface displacement. We derive a new variational formulation of the coupled problem and establish the existence of solutions using the direct method from the calculus of variations. We prove a domain monotonicity result for the fundamental sloshing eigenvalue. In the limit of zero surface tension, we recover the variational formulation of the mixed Steklov-Neumann eigenvalue problem and give the first-order perturbation formula for a simple eigenvalue.

math.AP↗

arXiv2016

Spectrally Optimized Pointset Configurations

The search for optimal configurations of pointsets, the most notable examples being the problems of Kepler and Thompson, have an extremely rich history with diverse applications in physics, chemistry, communication theory, and scientific computing. In this paper, we introduce and study a new optimality criteria for pointset configurations. Namely, we consider a certain weighted graph associated with a pointset configuration and seek configurations which minimize certain spectral properties of the adjacency matrix or graph Laplacian defined on this graph, subject to geometric constraints on the pointset configuration. This problem can be motivated by solar cell design and swarming models, and we consider several spectral functions with interesting interpretations such as spectral radius, algebraic connectivity, effective resistance, and condition number. We prove that the regular simplex extremizes several spectral invariants on the sphere. We also consider pointset configurations on flat tori via (i) the analogous problem on lattices and (ii) through a variety of computational experiments. For many of the objectives considered (but not all), the triangular lattice is extremal.

math.SP↗

arXiv2016

An Isoperimetric inequality for an integral operator on flat tori

We consider a class of Hilbert-Schmidt integral operators with an isotropic, stationary kernel acting on square integrable functions defined on flat tori. For any fixed kernel which is positive and decreasing, we show that among all unit-volume flat tori, the equilateral torus maximizes the operator norm and the Hilbert-Schmidt norm.

math.SP↗

arXiv2016

Maximization of Laplace-Beltrami eigenvalues on closed Riemannian surfaces

Let $(M,g)$ be a connected, closed, orientable Riemannian surface and denote by $λ_k(M,g)$ the $k$-th eigenvalue of the Laplace-Beltrami operator on $(M,g)$. In this paper, we consider the mapping $(M, g)\mapsto λ_k(M,g)$. We propose a computational method for finding the conformal spectrum $Λ^c_k(M,[g_0])$, which is defined by the eigenvalue optimization problem of maximizing $λ_k(M,g)$ for $k$ fixed as $g$ varies within a conformal class $[g_0]$ of fixed volume $textrm{vol}(M,g) = 1$. We also propose a computational method for the problem where $M$ is additionally allowed to vary over surfaces with fixed genus, $γ$. This is known as the topological spectrum for genus $γ$ and denoted by $Λ^t_k(γ)$. Our computations support a conjecture of N. Nadirashvili (2002) that $Λ^t_k(0) = 8 πk$, attained by a sequence of surfaces degenerating to a union of $k$ identical round spheres. Furthermore, based on our computations, we conjecture that $Λ^t_k(1) = \frac{8π^2}{\sqrt{3}} + 8π(k-1)$, attained by a sequence of surfaces degenerating into a union of an equilateral flat torus and $k-1$ identical round spheres. The values are compared to several surfaces where the Laplace-Beltrami eigenvalues are well-known, including spheres, flat tori, and embedded tori. In particular, we show that among flat tori of volume one, the $k$-th Laplace-Beltrami eigenvalue has a local maximum with value $λ_k = 4π^2 \left\lceil \frac{k}{2} \right\rceil^2 \left( \left\lceil \frac{k}{2} \right\rceil^2 - \frac{1}{4}\right)^{-\frac{1}{2}}$. Several properties are also studied computationally, including uniqueness, symmetry, and eigenvalue multiplicity.

math.DG↗

arXiv2016

Analysis of Crowdsourced Sampling Strategies for HodgeRank with Sparse Random Graphs

Crowdsourcing platforms are now extensively used for conducting subjective pairwise comparison studies. In this setting, a pairwise comparison dataset is typically gathered via random sampling, either \emph{with} or \emph{without} replacement. In this paper, we use tools from random graph theory to analyze these two random sampling methods for the HodgeRank estimator. Using the Fiedler value of the graph as a measurement for estimator stability (informativeness), we provide a new estimate of the Fiedler value for these two random graph models. In the asymptotic limit as the number of vertices tends to infinity, we prove the validity of the estimate. Based on our findings, for a small number of items to be compared, we recommend a two-stage sampling strategy where a greedy sampling method is used initially and random sampling \emph{without} replacement is used in the second stage. When a large number of items is to be compared, we recommend random sampling with replacement as this is computationally inexpensive and trivially parallelizable. Experiments on synthetic and real-world datasets support our analysis.

stat.ML↗

arXiv2016

Computational Methods For Extremal Steklov Problems

We develop a computational method for extremal Steklov eigenvalue problems and apply it to study the problem of maximizing the $p$-th Steklov eigenvalue as a function of the domain with a volume constraint. In contrast to the optimal domains for several other extremal Dirichlet- and Neumann-Laplacian eigenvalue problems, computational results suggest that the optimal domains for this problem are very structured. We reach the conjecture that the domain maximizing the $p$-th Steklov eigenvalue is unique (up to dilations and rigid transformations), has p-fold symmetry, and an axis of symmetry. The $p$-th Steklov eigenvalue has multiplicity 2 if $p$ is even and multiplicity 3 if $p\geq3$ is odd.

math.SP↗

arXiv2015

Mean curvature, threshold dynamics, and phase field theory on finite graphs

In the continuum, close connections exist between mean curvature flow, the Allen-Cahn (AC) partial differential equation, and the Merriman-Bence-Osher (MBO) threshold dynamics scheme. Graph analogues of these processes have recently seen a rise in popularity as relaxations of NP-complete combinatorial problems, which demands deeper theoretical underpinnings of the graph processes. The aim of this paper is to introduce these graph processes in the light of their continuum counterparts, provide some background, prove the first results connecting them, illustrate these processes with examples and identify open questions for future study. We derive a graph curvature from the graph cut function, the natural graph counterpart of total variation (perimeter). This derivation and the resulting curvature definition differ from those in earlier literature, where the continuum mean curvature is simply discretized, and bears many similarities to the continuum nonlocal curvature or nonlocal means formulation. This new graph curvature is not only relevant for graph MBO dynamics, but also appears in the variational formulation of a discrete time graph mean curvature flow. We prove estimates showing that the dynamics are trivial for both MBO and AC evolutions if the parameters (the time-step and diffuse interface scale, respectively) are sufficiently small (a phenomenon known as "freezing" or "pinning") and also that the dynamics for MBO are nontrivial if the time step is large enough. These bounds are in terms of graph quantities such as the spectrum of the graph Laplacian and the graph curvature. Adapting a Lyapunov functional for the continuum MBO scheme to graphs, we prove that the graph MBO scheme converges to a stationary state in a finite number of iterations. Variations on this scheme have recently become popular in the literature as ways to minimize (continuum) nonlocal total variation.

math.AP↗

arXiv2014

Optimal Data Collection For Informative Rankings Expose Well-Connected Graphs

Given a graph where vertices represent alternatives and arcs represent pairwise comparison data, the statistical ranking problem is to find a potential function, defined on the vertices, such that the gradient of the potential function agrees with the pairwise comparisons. Our goal in this paper is to develop a method for collecting data for which the least squares estimator for the ranking problem has maximal Fisher information. Our approach, based on experimental design, is to view data collection as a bi-level optimization problem where the inner problem is the ranking problem and the outer problem is to identify data which maximizes the informativeness of the ranking. Under certain assumptions, the data collection problem decouples, reducing to a problem of finding multigraphs with large algebraic connectivity. This reduction of the data collection problem to graph-theoretic questions is one of the primary contributions of this work. As an application, we study the Yahoo! Movie user rating dataset and demonstrate that the addition of a small number of well-chosen pairwise comparisons can significantly increase the Fisher informativeness of the ranking. As another application, we study the 2011-12 NCAA football schedule and propose schedules with the same number of games which are significantly more informative. Using spectral clustering methods to identify highly-connected communities within the division, we argue that the NCAA could improve its notoriously poor rankings by simply scheduling more out-of-conference games.

stat.ML↗

arXiv2014

Minimal Dirichlet energy partitions for graphs

Motivated by a geometric problem, we introduce a new non-convex graph partitioning objective where the optimality criterion is given by the sum of the Dirichlet eigenvalues of the partition components. A relaxed formulation is identified and a novel rearrangement algorithm is proposed, which we show is strictly decreasing and converges in a finite number of iterations to a local minimum of the relaxed objective function. Our method is applied to several clustering problems on graphs constructed from synthetic data, MNIST handwritten digits, and manifold discretizations. The model has a semi-supervised extension and provides a natural representative for the clusters as well.

math.OC↗

arXiv2013

Long-lived Scattering Resonances and Bragg Structures

We consider a system governed by the wave equation with index of refraction $n(x)$, taken to be variable within a bounded region $Ω\subset \mathbb R^d$, and constant in $\mathbb R^d \setminus Ω$. The solution of the time-dependent wave equation with initial data, which is localized in $Ω$, spreads and decays with advancing time. This rate of decay can be measured (for $d=1,3$, and more generally, $d$ odd) in terms of the eigenvalues of the scattering resonance problem, a non-selfadjoint eigenvalue problem governing the time-harmonic solutions of the wave (Helmholtz) equation which are outgoing at $\infty$. Specifically, the rate of energy escape from $Ω$ is governed by the complex scattering eigenfrequency, which is closest to the real axis. We study the structural design problem: Find a refractive index profile $n_*(x)$ within an admissible class which has a scattering frequency with minimal imaginary part. The admissible class is defined in terms of the compact support of $n(x)-1$ and pointwise upper and lower (material) bounds on $n(x)$ for $x \in Ω$, i.e., $0 < n_- \leq n(x) \leq n_+ < \infty$. We formulate this problem as a constrained optimization problem and prove that an optimal structure, $n_*(x)$ exists. Furthermore, $n_*(x)$ is piecewise constant and achieves the material bounds, i.e., $n_*(x) \in {n_-, n_+} $. In one dimension, we establish a connection between $n_*(x)$ and the well-known class of Bragg structures, where $n(x)$ is constant on intervals whose length is one-quarter of the effective wavelength.

math.OC↗

arXiv2010

Emergence of Periodic Structure from Maximizing the Lifetime of a Bound State Coupled to Radiation

Consider a system governed by the time-dependent Schrödinger equation in its ground state. When subjected to weak (size $ε$) parametric forcing by an "ionizing field" (time-varying), the state decays with advancing time due to coupling of the bound state to radiation modes. The decay-rate of this metastable state is governed by {\it Fermi's Golden Rule}, $Γ[V]$, which depends on the potential $V$ and the details of the forcing. We pose the potential design problem: find $V_{opt}$ which minimizes $Γ[V]$ (maximizes the lifetime of the state) over an admissible class of potentials with fixed spatial support. We formulate this problem as a constrained optimization problem and prove that an admissible optimal solution exists. Then, using quasi-Newton methods, we compute locally optimal potentials. These have the structure of a truncated periodic potential with a localized defect. In contrast to optimal structures for other spectral optimization problems, our optimizing potentials appear to be interior points of the constraint set and to be smooth. The multi-scale structures that emerge incorporate the physical mechanisms of energy confinement via material contrast and interference effects. An analysis of locally optimal potentials reveals local optimality is attained via two mechanisms: (i) decreasing the density of states near a resonant frequency in the continuum and (ii) tuning the oscillations of extended states to make $Γ[V]$, an oscillatory integral, small. Our approach achieves lifetimes, $\sim (ε^2Γ[V])^{-1}$, for locally optimal potentials with $Γ^{-1}\sim\mathcal{O}(10^{9})$ as compared with $Γ^{-1}\sim \mathcal{O}(10^{2})$ for a typical potential. Finally, we explore the performance of optimal potentials via simulations of the time-evolution.

math.AP↗