Related papers: Bounds on the permanent and some applications
We study a fundamental stochastic selection problem involving $n$ independent random variables, each of which can be queried at some cost. Given a tolerance level $\delta$, the goal is to find a value that is $\delta$-approximately minimum…
We introduce a stochastic version of Gubinelli's sewing lemma, providing a sufficient condition for the convergence in moments of some random Riemann sums. Compared with the deterministic sewing lemma, adaptiveness is required and the…
In seminal work, Lov\'asz, Spencer, and Vesztergombi [European J. Combin., 1986] proved a lower bound for the hereditary discrepancy of a matrix $A \in \mathbb{R}^{m \times n}$ in terms of the maximum $|\det(B)|^{1/k}$ over all $k \times k$…
We propose a new second-order accurate lattice Boltzmann formulation for linear elastodynamics that is stable for arbitrary combinations of material parameters under a CFL-like condition. The construction of the numerical scheme uses an…
We study fine-grained error bounds for differentially private algorithms for counting under continual observation. Our main insight is that the matrix mechanism when using lower-triangular matrices can be used in the continual observation…
This paper is concerned with the asymptotic behavior of solutions of the two-dimensional Navier-Stokes equations with both non-autonomous deterministic and stochastic terms defined on unbounded domains. We first introduce a continuous…
This paper considers an optimization problem for a dynamical system whose evolution depends on a collection of binary decision variables. We develop scalable approximation algorithms with provable suboptimality bounds to provide…
The dynamic matrix inverse problem is to maintain the inverse of a matrix undergoing element and column updates. It is the main subroutine behind the best algorithms for many dynamic problems whose complexity is not yet well-understood,…
For a many-to-many matching market, we study the lattice structure of the set of random stable matchings. We define a partial order on the random stable set and present two intuitive binary operations to compute the least upper bound and…
For a mixed stochastic differential equation involving standard Brownian motion and an almost surely H\"older continuous process $Z$ with H\"older exponent $\gamma>1/2$, we establish a new result on its unique solvability. We also establish…
Inspired by regularization techniques in statistics and machine learning, we study complementary composite minimization in the stochastic setting. This problem corresponds to the minimization of the sum of a (weakly) smooth function endowed…
In order to understand the impact of random influences at physical boundary on the evolution of multiscale systems, a stochastic partial differential equation model under a fast random dynamical boundary condition is investigated. The…
It has been found that stochastic algorithms often find good solutions much more rapidly than inherently-batch approaches. Indeed, a very useful rule of thumb is that often, when solving a machine learning problem, an iterative technique…
For the spatially inhomogeneous, non-cutoff Boltzmann equation posed in the whole space $\mathbb R^3_x$, we establish pointwise lower bounds that appear instantaneously even if the initial data contains vacuum regions. Our lower bounds…
We propose an algorithm to numerically determined whether a second-order linear PDE problem satisfying a Garding inequality is well-posed. This algorithm further provides a lower bound to the inf-sup constant of the weak formulation, which…
We give an effective uniform bound on the multigraded regularity of a subscheme of a smooth projective toric variety X with a given multigraded Hilbert polynomial. To establish this bound, we introduce a new combinatorial tool, called a…
We consider slow-fast systems of differential equations, in which both the slow and fast variables are perturbed by noise. When the deterministic system admits a uniformly asymptotically stable slow manifold, we show that the sample paths…
In this note, we first try to prove a uniform lower bound of nodal volume in elliptic homogenization setting. This lower bound is far from optimal. But, we can prove a constant lower bound in dimension two. Motivated by the proof, we extend…
Using Dumnicki's approach to showing non-specialty of linear systems consisting of plane curves with prescribed multiplicities in sufficiently general points on $\mathbb{P}^2$ we develop an asymptotic method to determine lower bounds for…
We provide a new construction for a set of boxes approximating axis-parallel boxes of fixed volume in $[0, 1]^d$. This improves upper bounds for the minimal dispersion of a point set in the unit cube and its inverse in both the periodic and…