Related papers: The Steiner distance problem for large vertex subs…
Gilbert proposed an algorithm for bounding the distance between a given point and a convex set. In this article we apply the Gilbert's algorithm to get an upper bound on the Hilbert-Schmidt distance between a given state and the set of…
We discuss asymptotics for large random planar maps under the assumption that the distribution of the degree of a typical face is in the domain of attraction of a stable distribution with index $\alpha\in(1,2)$. When the number $n$ of…
Using the auxiliary field method, a generic upper bound is obtained for the spinless Salpeter equation with two different masses. Analytical results are presented for the cases of the Coulomb and linear potentials when a mass is vanishing.
We consider the statistical motion of a convex rigid body in a gas of N smaller (spherical) atoms close to thermodynamic equilibrium. Because the rigid body is much bigger and heavier, it undergoes a lot of collisions leading to small…
We propose a Stein characterization of the Kummer distribution on (0, $\infty$). This result follows from our observation that the density of the Kummer distribution satisfies a certain differential equation, leading to a solution of the…
The Wasserstein barycenter is a geometric construct which captures the notion of centrality among probability distributions, and which has found many applications in machine learning. However, most algorithms for finding even an approximate…
Large-scale eigenvalue problems arise in various fields of science and engineering and demand computationally efficient solutions. In this study, we investigate the subspace approximation for parametric linear eigenvalue problems, aiming to…
It is well-known that the dynamics of vortices in an ideal incompressible two-dimensional fluid contained in a bounded not necessarily simply connected smooth domain is described by the Kirchhoff--Routh point vortex system. In this paper,…
We analyze in detail, beyond the usual scaling hypothesis, the finite-size convergence of static quantities toward the thermodynamic limit. In this way we are able to obtain sequences of pseudo-critical points which display a faster…
We will prove that some weighted graphs on the distance $k$-graph of hypercubes approximate the $q$-Hermite polynomial of a $q$-gaussian variable by providing an appropriate matrix model.
The Wasserstein distance between two probability measures on a metric space is a measure of closeness with applications in statistics, probability, and machine learning. In this work, we consider the fundamental question of how quickly the…
\textsc{Densest $k$-Subgraph} is the problem to find a vertex subset $S$ of size $k$ such that the number of edges in the subgraph induced by $S$ is maximized. In this paper, we show that \textsc{Densest $k$-Subgraph} is fixed parameter…
Intrusive Uncertainty Quantification methods such as stochastic Galerkin are gaining popularity, whereas the classical stochastic Galerkin approach is not ensured to preserve hyperbolicity of the underlying hyperbolic system. We apply a…
Observations or measurements taken of a quantum system (a small number of fundamental particles) are inherently random. If the state of the system depends on unknown parameters, then the distribution of the outcome depends on these…
We give a deterministic method of quasi-polynomial complexity to approximate the volume of the intersection of the unit hypercube with two specific sets. The method can actually be applied (without losing the quasi-polynomial complexity) to…
We tackle the problem of high-dimensional nonparametric density estimation by taking the class of log-concave densities on $\mathbb{R}^p$ and incorporating within it symmetry assumptions, which facilitate scalable estimation algorithms and…
We provide a new approach to stable ergodicity of systems with dominated splittings, based on a geometrical analysis of global stable and unstable manifolds of hyperbolic points. Our method suggests that the lack of uniform size of Pesin's…
We show how to test whether a graph with n vertices and m edges is a partial cube, and if so how to find a distance-preserving embedding of the graph into a hypercube, in the near-optimal time bound O(n^2), improving previous O(nm)-time…
We model the Knudsen layer in Kramers' problem by linearized high order hyperbolic moment system. Due to the hyperbolicity, the boundary conditions of the moment system is properly reduced from the kinetic boundary condition. For Kramers'…
Quantum theory of interference phenomena does not take the diameter of the particle into account, since particles were much smaller than the width of the slits in early observations. In recent experiments with large molecules, the diameter…