相关论文: Approximation of rectifiable $1$-currents and weak…

We show that every sufficiently large r-regular digraph G which has linear degree and is a robust outexpander has an approximate decomposition into edge-disjoint Hamilton cycles, i.e. G contains a set of r-o(r) edge-disjoint Hamilton…

For a wide class of continuous-time Markov processes, including all irreducible hypoelliptic diffusions evolving on an open, connected subset of $\RL^d$, the following are shown to be equivalent: (i) The process satisfies (a slightly weaker…

Length-constrained expander decompositions are a new graph decomposition that has led to several recent breakthroughs in fast graph algorithms. Roughly, an $(h, s)$-length $\phi$-expander decomposition is a small collection of length…

We study $n$-dimensional area-minimizing currents $T$ in $\mathbb{R}^{n+1},$ with boundary $\partial T$ satisfying two properties: $\partial T$ is locally a finite sum of $(n-1)$-dimensional $C^{1,\alpha}$ orientable submanifolds which only…

Let $G = (V,E)$ be a connected graph. A probability measure $\mu$ on $V$ is called "balanced" if it has the following property: if $T_\mu(v)$ denotes the "earth mover's" cost of transporting all the mass of $\mu$ from all over the graph to…

Motion of a continuous fluid can be decomposed into an "incompressible" rearrangement, which preserves the volume of each infinitesimal fluid element, and a gradient map that transfers fluid elements in a way unaffected by any pressure or…

We investigate the long-time behavior of weak solutions to the thin-film type equation $$v_t =(xv - vv_{xxx})_x\ ,$$ which arises in the Hele-Shaw problem. We estimate the rate of convergence of solutions to the Smyth-Hill equilibrium…

This paper defines constrained functional similarity between 2-D trajectories via minimizing the H1 semi-norm of the difference between the trajectories. An exact general solution is obtained for the case wherein the components of the…

We investigate the approximation of Monge--Kantorovich problems on general compact metric spaces, showing that optimal values, plans and maps can be effectively approximated via a fully discrete method. First we approximate optimal values…

The Stone-Weierstrass approximation theorem is extended to certain unbounded sets in $C^n$. In particular, on a locally rectifiable arc going to infinity, each continuous function can be approximated by entire functions.

We establish that Polchinski's equation for exact renormalization group flow is equivalent to the optimal transport gradient flow of a field-theoretic relative entropy. This provides a compelling information-theoretic formulation of the…

Given $N$ absolutely continuous probabilities $\rho_1, \dotsc, \rho_N$ over $\mathbb{R}^d$ which have Sobolev regularity, and given a transport plan $P$ with marginals $\rho_1, \dotsc, \rho_N$, we provide a universal technique to…

In this paper we start a detailed study of a new notion of rectifiability in Carnot groups: we say that a Radon measure is $\mathscr{P}_h$-rectifiable, for $h\in\mathbb N$, if it has positive $h$-lower density and finite $h$-upper density…

We consider the most general set of integrable deformations extending the $T\bar{T}$ deformation of two-dimensional relativistic QFTs. They are CDD deformations of the theory's factorised S-matrix related to the higher-spin conserved…

We consider $2$-dimensional integer rectifiable currents which are almost area minimizing and show that their tangent cones are everywhere unique. Our argument unifies a few uniqueness theorems of the same flavor, which are all obtained by…

We develop a discrete counterpart of the De Giorgi-Nash-Moser theory, which provides uniform H\"older-norm bounds on continuous piecewise affine finite element approximations of second-order linear elliptic problems of the form $-\nabla…

In this paper we show the existence of weak solutions $w : M \rightarrow \mathbb{R}$ of the inverse mean curvature flow starting from a relatively compact set (possibly, a point) on a large class of manifolds satisfying Ricci lower bounds.…

We show that, for $0<s<1$, $0<p<\infty$, $0<q<\infty$, Haj\l asz-Besov and Haj\l asz-Triebel-Lizorkin functions can be approximated in the norm by discrete median convolutions. This allows us to show that, for these functions, the limit of…

Core decomposition is a classic technique for discovering densely connected regions in a graph with large range of applications. Formally, a $k$-core is a maximal subgraph where each vertex has at least $k$ neighbors. A natural extension of…

Inspired by applications in weighted polynomial approximation problems, we study an optimal mass distribution problem. Given a gauge function $h$ and a positive "roof" function $R$ compactly supported in $\mathbb{R}^n$, we are interested in…