相关论文: A study in quantitative equidistribution on the un…

We establish a bound of $O(n^2k^{1+\eps})$, for any $\eps>0$, on the combinatorial complexity of the set $\T$ of line transversals of a collection $\P$ of $k$ convex polyhedra in $\reals^3$ with a total of $n$ facets, and present a…

Using the works of Ma\~n\'e \cite{Ma} and Paternain \cite{Pat} we study the distribution of geodesic arcs with respect to equilibrium states of the geodesic flow on a closed manifold, equipped with a $\mathcal{C}^{\infty}$ Riemannian…

In this work we investigate the behavior of the minimal rate needed in order to guarantee a given probability that the distortion exceeds a prescribed threshold, at some fixed finite quantization block length. We show that the excess coding…

We prove the equivariant divergence formula for the axiom A flow attractors, which is a recursive formula for perturbation of transfer operators of physical measures along center-unstable manifolds. Hence the linear response acquires an…

This paper considers mean square error (MSE) analysis for stochastic gradient sampling algorithms applied to underdamped Langevin dynamics under a global convexity assumption. A novel discrete Poisson equation framework is developed to…

We prove optimal error bounds for a second order in time finite element approximation of curve shortening flow in possibly higher codimension. In addition, we introduce a second order in time method for curve diffusion. Both schemes are…

In this paper we consider convex subsets of locally-convex topological vector spaces. Given a fixed point in such a convex subset, we show that there exists a curve completely contained in the convex subset and leaving the point in a given…

Equivariance is central to graph generative models, as it ensures the model respects the permutation symmetry of graphs. However, strict equivariance can increase computational cost due to added architectural constraints, and can slow down…

We consider semi-discrete first-order finite difference schemes for a nonlinear degenerate convection-diffusion equations in one space dimension, and prove an L1 error estimate. Precisely, we show that the L1 loc difference between the…

We study the long-time behavior of a particle in $\mathbb{R}^d$, $d \geq 2$, subject to molecular diffusion and advection by a random incompressible flow. The velocity field is the divergence of a stationary random stream matrix $\mathbf{k}…

In this paper we investigate the numerical approximation of a variant of the mean curvature flow. We consider the evolution of hypersurfaces with normal speed given by $H^k$, $k \ge 1$, where $H$ denotes the mean curvature. We use a level…

Statistical query (SQ) algorithms are algorithms that have access to an {\em SQ oracle} for the input distribution $D$ instead of i.i.d.~ samples from $D$. Given a query function $\phi:X \rightarrow [-1,1]$, the oracle returns an estimate…

We consider first-passage percolation on the $d$ dimensional cubic lattice for $d \geq 2$; that is, we assign independently to each edge $e$ a nonnegative random weight $t_e$ with a common distribution and consider the induced random graph…

Thermal conductance has emerged as a powerful probe of topological order in the quantum Hall effect and beyond. The interpretation of experiments crucially depends on the ratio of the sample size and the equilibration length, on which…

We propose and analyze numerical schemes for the gradient flow of $Q$-tensor with the quasi-entropy. The quasi-entropy is a strictly convex, rotationally invariant elementary function, giving a singular potential constraining the…

We study the weak approximation error of a skew diffusion with bounded measurable drift and H\"older diffusion coefficient by an Euler-type scheme, which consists of iteratively simulating skew Brownian motions with constant drift. We first…

Flow-based models have proven successful for time-series generation, particularly when defined in lower-dimensional latent spaces that enable efficient sampling. However, how to design latent representations with desirable equivariance…

We present a unified technique for sequential estimation of convex divergences between distributions, including integral probability metrics like the kernel maximum mean discrepancy, $\varphi$-divergences like the Kullback-Leibler…

Flows over time are used to model many real-world logistic and routing problems. The networks underlying such problems -- streets, tracks, etc. -- are inherently undirected and directions are only imposed on them to reduce the danger of…

This paper presents a first-order {distributed continuous-time algorithm} for computing the least-squares solution to a linear equation over networks. Given the uniqueness of the solution, with nonintegrable and diminishing step size,…