Related papers: A max filtering local stability theorem with appli…
We study the maximum capture problem in facility location under random utility models, i.e., the problem of seeking to locate new facilities in a competitive market such that the captured user demand is maximized, assuming that each…
Locality of compact one-electron orbitals expanded strictly in terms of local subsets of basis functions can be exploited in density functional theory (DFT) to achieve linear growth of computation time with systems size, crucial in…
We present a new local approximation algorithm for computing Maximum a Posteriori (MAP) and log-partition function for arbitrary exponential family distribution represented by a finite-valued pair-wise Markov random field (MRF), say $G$.…
We derive uniform convergence rates for the maximum likelihood estimator and minimax lower bounds for parameter estimation in two-component location-scale Gaussian mixture models with unequal variances. We assume the mixing proportions of…
We consider the phase retrieval problem, which involves recovering a rank-one positive semidefinite matrix from rank-one measurements. A recently proposed algorithm based on Bures-Wasserstein gradient descent (BWGD) exhibits superlinear…
In simulation sciences, it is desirable to capture the real-world problem features as accurately as possible. Methods popular for scientific simulations such as the finite element method (FEM) and finite volume method (FVM) use piecewise…
We review the circumstances under which test particles can be localized around a spacetime section \Sigma_0 smoothly contained within a codimension-1 embedding space M. If such a confinement is possible, \Sigma_0 is said to be totally…
Given a digraph $G = (V_G, A_G)$, a \emph{branching} in $G$ is a set of arcs $B \subseteq A_G$ such that the underlying undirected graph spanned by $B$ is acyclic and each node in $G$ is entered (\emph{covered}) by at most one arc from $B$.…
We study the construction and convergence of decoupling multistep schemes of higher order using the backward differentiation formulae for an elliptic-parabolic problem, which includes multiple-network poroelasticity as a special case. These…
We study the problem of recovering a globally consistent Euclidean embedding of data, given only a local distance graph and propose a method that optimally represents these distances. The method operates solely on a neighborhood graph…
This paper is concerned with convex composite minimization problems in a Hilbert space. In these problems, the objective is the sum of two closed, proper, and convex functions where one is smooth and the other admits a computationally…
This paper introduces a methodology based on Euclidean information theory to investigate local properties of secure communication over discrete memoryless wiretap channels. We formulate a constrained optimization problem that maximizes a…
Area-preserving maps have been observed to undergo a universal period-doubling cascade, analogous to the famous Feigenbaum-Coullet-Tresser period doubling cascade in one-dimensional dynamics. A renormalization approach has been used by…
We introduce a generalized framework for studying higher-order versions of the multiscale method known as Localized Orthogonal Decomposition. Through a suitable reformulation, we are able to accommodate both conforming and nonconforming…
The main purpose of the paper is to prove the following results: Let $A$ be a locally finite metric space whose finite subsets admit uniformly bilipschitz embeddings into a Banach space $X$. Then $A$ admits a bilipschitz embedding into $X$.…
This paper develops a systematic and geometric theory of optimal quantization on the unit sphere $\mathbb S^2$, focusing on finite uniform probability distributions supported on the spherical surface - rather than on lower-dimensional…
We present an extension of the classical De Giorgi class, and then we show that functions in this new class are locally bounded and locally H\"older continuous. Some applications are given. As a first application, we give a regularity…
Phase retrieval problems involve solving linear equations, but with missing sign (or phase, for complex numbers) information. More than four decades after it was first proposed, the seminal error reduction algorithm of (Gerchberg and Saxton…
Matched filtering is a commonly used technique in gravitational wave searches for signals from compact binary systems and from rapidly rotating neutron stars. A common issue in these searches is dealing with four extrinsic parameters which…
We consider vectorial problems in the calculus of variations with an additional pointwise constraint. Our admissible mappings ${\bf n}:\mathbb{R}^k\rightarrow \mathbb{R}^d$ satisfy ${\bf n}(x)\in M$, where $M$ is a manifold embedded in…