Zobrazeno 1 - 10
of 212
pro vyhledávání: '"Osting, Braxton"'
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 photo
Externí odkaz:
http://arxiv.org/abs/2407.19699
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
Externí odkaz:
http://arxiv.org/abs/2407.19057
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-horiz
Externí odkaz:
http://arxiv.org/abs/2407.00213
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 logar
Externí odkaz:
http://arxiv.org/abs/2309.12459
In prior work we have introduced an asymptotic threshold of sufficient randomness for causal inference from observational data. In this paper we extend that prior work in three main ways. First, we show how to empirically estimate a lower bound for t
Externí odkaz:
http://arxiv.org/abs/2309.02621
We provide a rearrangement based algorithm for fast detection of subgraphs of $k$ vertices with long escape times for directed or undirected networks. Complementing other notions of densest subgraphs and graph cuts, our method is based on the mean hi
Externí odkaz:
http://arxiv.org/abs/2212.12839
Archetypal analysis is an unsupervised machine learning method that summarizes data using a convex polytope. In its original formulation, for fixed k, the method finds a convex polytope with k vertices, called archetype points, such that the polytope
Externí odkaz:
http://arxiv.org/abs/2210.14298
Autor:
Osting, Braxton
For a regular polyhedron (or polygon) centered at the origin, the coordinates of the vertices are eigenvectors of the graph Laplacian for the skeleton of that polyhedron (or polygon) associated with the first (non-trivial) eigenvalue. In this paper,
Externí odkaz:
http://arxiv.org/abs/2206.10010
Autor:
Yoon, Ryeongkyung, Osting, Braxton
We propose a novel framework for learning a low-dimensional representation of data based on nonlinear dynamical systems, which we call dynamical dimension reduction (DDR). In the DDR model, each point is evolved via a nonlinear flow towards a lower-d
Externí odkaz:
http://arxiv.org/abs/2204.08155
Publikováno v:
In Journal of Computational Physics 15 January 2025 521 Part 1
