BOBraxton Osting

Braxton Osting

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Braxton Osting has a total of 69 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Layer Potential Methods for Doubly Periodic Harmonic Functions

    by Bohyun Kim, Braxton Osting

    We develop and analyze layer potential methods to represent harmonic functions on finitely connected tori (i.e., doubly periodic harmonic functions). The layer potentials are expressed in terms of a doubly periodic and nonharmonic Green’s function that can be explicitly written in terms of the Jacobi theta function or a modified Weierstrass sigma function. Extending results for finitely connected Euclidean domains, we prove that the single- and double-layer potential operators are compact linear operators and derive the relevant limiting properties at the boundary. We show that when the boundary has more than one connected component, the Fredholm operator of the second kind associated with the double-layer potential operator has a nontrivial null space, which can be explicitly constructed. Finally, we apply our developed theory to obtain solutions to the Dirichlet and Neumann boundary value problems as well as the Steklov eigenvalue problem. We present numerical results using Nyström discretizations and find approximate solutions to these problems in several numerical examples. Our method avoids a lattice sum of the free-space Green’s function, is shown to be spectrally convergent, and exhibits a faster convergence rate than the method of particular solutions for problems on tori with irregularly shaped holes.

  • Dirac Points for Square Lattice Photonic Crystals

    by Chiu-Yen Kao, Junshan Lin, Braxton Osting

    This work is concerned with Dirac points in dispersion surfaces associated with the wave equation where the material coefficient has the translational symmetries of a square lattice. It is proved in Keller et. al. (2018) that the spectrum of the Schrödinger operator over a square lattice does not have a Dirac point at the high symmetry point of the Brillouin zone, at least for the lower bands. In the high-contrast limit, we prove the existence of a Dirac point for the 2D Helmholtz operator over a square lattice away from the high symmetry point of the Brillouin zone, if the dielectric function of the periodic medium has reflection symmetry. In particular, the two-dimensional eigenspace at the Dirac point is spanned by eigenfunctions with opposite parity. Based on this observation, we propose a computational inverse design method using the local density-of-state method to generate a Dirac point at the desired Bloch wave vector and frequency. Numerous numerical results demonstrate the capability of our framework to generate a desired Dirac point robustly.

  • Extremal Steklov–Neumann Eigenvalues

    by Chiu-Yen Kao, Braxton Osting, Chee Han Tan, Robert Viator

    Let [Formula: see text] be a bounded open planar domain with a smooth connected boundary, [Formula: see text], that has been partitioned into two disjoint components, [Formula: see text]. We consider the Steklov–Neumann eigenproblem on [Formula: see text], where a harmonic function is sought that satisfies the Steklov boundary condition on [Formula: see text] and the Neumann boundary condition on [Formula: see text]. We pose the extremal eigenvalue problems (EEPs) of minimizing/maximizing the [Formula: see text]th nontrivial Steklov–Neumann eigenvalue among boundary partitions of prescribed measure. We formulate a relaxation of these EEPs in terms of weighted Steklov eigenvalues where an [Formula: see text] density replaces the boundary partition. For these relaxed EEPs, we establish existence and prove optimality conditions. We also prove a homogenization result that allows us to use solutions to the relaxed EEPs to infer properties of solutions to the original EEPs. For a disk, we provide numerical and asymptotic evidence that the minimizing arrangement of [Formula: see text] for the [Formula: see text]th eigenvalue consists of [Formula: see text] connected components that are symmetrically arranged on the boundary. For a disk, for [Formula: see text], the constant density is a maximizer for the relaxed problem; we also provide numerical and asymptotic evidence that for [Formula: see text], the maximizing density for the relaxed problem is a nontrivial function; a sequence of rapidly oscillating Steklov/Neumann boundary conditions approach the supremum value.

  • Bulk soliton dynamics in bosonic topological insulators

    by Jeremy L. Marzuola, Mikael C. Rechtsman, Braxton Osting, Miguel A. Bandres


  • Targeting Influence in a Harmonic Opinion Model

    by Zachary M. Boyd, Nicolas Fraiman, Jeremy L. Marzuola, Peter J. Mucha, Braxton Osting

    Influence propagation in social networks is a central problem in modern social network analysis, with important societal applications in politics and advertising. A large body of work has focused on cascading models, viral marketing, and finite-horizon diffusion. There is, however, a need for more developed, mathematically principled adversarial models, in which multiple, opposed actors strategically select nodes whose influence will maximally sway the crowd to their point of view. In the present work, we develop and analyze such a model based on harmonic functions and linear diffusion. Our general problem is known to be NP-hard and that the objective function is monotone and submodular; consequently, we can greedily approximate the solution within a constant factor. Introducing and analyzing a convex relaxation, we show that the problem can be approximately solved using smooth optimization methods. We illustrate the effectiveness of our approach on a variety of example networks.

  • Wasserstein Archetypal Analysis

    by Katy Craig, Braxton Osting, Dong Wang, Yiming Xu


  • Open Access

    A Semi-definite Optimization Method for Maximizing the Shared Band Gap of Topological Photonic Crystals

    by Chiu-Yen Kao, Junshan Lin, Braxton Osting

    Topological photonic crystals (PCs) can support robust edge modes to transport electromagnetic energy in an efficient manner. Such edge modes are the eigenmodes of the PDE operator for a joint optical structure formed by connecting together two photonic crystals with distinct topological invariants, and the corresponding eigenfrequencies are located in the shared band gap of two individual photonic crystals. This work is concerned with maximizing the shared band gap of two photonic crystals with different topological features in order to increase the bandwidth of the edge modes. We develop a semi-definite optimization framework for the underlying optimal design problem, which enables efficient update of dielectric functions at each time step while respecting symmetry constraints and, when necessary, the constraints on topological invariants. At each iteration, we perform sensitivity analysis of the band gap function and the topological invariant constraint function to linearize the optimization problem and solve a convex semi-definite programming (SDP) problem efficiently. Numerical examples show that the proposed algorithm is superior in generating optimized optical structures with robust edge modes.

  • Open Access

    Partial Identification of the Average Treatment Effect with Stochastic Counterfactuals and Discordant Twins

    by Brian Knaeble, Braxton Osting, Placede Tshiaba

    We develop a novel approach to partially identify causal estimands, such as the average treatment effect (ATE), from observational data. To better satisfy the stable unit treatment value assumption (SUTVA) we utilize stochastic counterfactuals within a propensity-prognosis model of the data generating process. For more precise identification we utilize knowledge of discordant twin outcomes as evidence for randomness in the data generating process. Our approach culminates with a constrained optimization problem; the solution gives upper and lower bounds for the ATE. We demonstrate the applicability of our introduced methodology with three example applications.

  • An Escape Time Formulation for Subgraph Detection and Partitioning of Directed Graphs

    by Zachary M. Boyd, Nicolas Fraiman, Jeremy L. Marzuola, Peter J. Mucha, Braxton Osting

    We provide a rearrangement based algorithm for detection of subgraphs of k vertices with long escape times for directed or undirected networks that is not combinatorially complex to compute. Complementing other notions of densest subgraphs and graph cuts, our method is based on the mean hitting time required for a random walker to leave a designated set and hit the complement. We provide a new relaxation of this notion of hitting time on a given subgraph and use that relaxation to construct a subgraph detection algorithm that can be computed easily and a generalization to K-partitioning schemes. Using a modification of the subgraph detector on each component, we propose a graph partitioner that identifies regions where random walks live for comparably large times. Importantly, our method implicitly respects the directed nature of the data for directed graphs while also being applicable to undirected graphs. We apply the partitioning method for community detection to a large class of models and real-world data sets.


  • Harmonic Functions on Finitely Connected Tori

    by Chiu-Yen Kao, Braxton Osting, Édouard Oudet

    In this paper, we prove a logarithmic conjugation theorem on finitely connected tori. The theorem states that a harmonic function can be written as the real part of a function whose derivative is analytic and a finite sum of terms involving the logarithm of the modulus of a modified Weierstrass sigma function. We implement the method using arbitrary precision and use the result to find approximate solutions to the Laplace problem and the Steklov eigenvalue problem. Using a posteriori estimation, we show that the solution of the Laplace problem on a torus with a few holes has error less than [Formula: see text] using a few hundred degrees of freedom and the Steklov eigenvalues have similar error.