Related papers: Grounded Lipschitz functions on trees are typicall…
We prove a strong form of the invariance under re-rooting of the distribution of the continuous random trees called Levy trees. This extends previous results due to several authors.
We consider the linear elliptic systems or equations in divergence form with periodically oscillating coefficients. We prove the large-scale boundary Lipschitz estimate for the weak solutions in domains satisfying the so-called…
We investigate pointwise multipliers on vector-valued function spaces over $\mathbb{R}^d$, equipped with Muckenhoupt weights. The main result is that in the natural parameter range, the characteristic function of the half-space is a…
The two main results of this paper concern the regularity of the invariant foliation of a C0-integrable symplectic twist diffeomorphisms of the 2-dimensional annulus, namely that $\bullet$ the generating function of such a foliation is C1 ;…
In this paper we study detection and reconstruction of planted structures in Erd\H{o}s-R\'enyi random graphs. Motivated by a problem of communication security, we focus on planted structures that consist in a tree graph. For planted line…
We describe algorithms for finding the regression of t, a sequence of values, to the closest sequence s by mean squared error, so that s is always increasing (isotonicity) and so the values of two consecutive points do not increase by too…
For a labeled, rooted tree with edges oriented towards the root, we consider the vertices as parking spots and the edge orientation as a one-way street. Each driver, starting with her preferred parking spot, searches for and parks in the…
We consider a randomization of a function on $\mathbb R^d$ that is naturally associated to the Wiener decomposition and, intrinsically, to the modulation spaces. Such randomized functions enjoy better integrability, thus allowing us to…
We investigate the value function of the Bolza problem of the Calculus of Variations $$ V (t,x)=\inf \{\int_{0}^{t} L (y(s),y'(s))ds + \phi(y(t)) : y \in W^{1,1} (0,t; R^n) ; y(0)=x \}, $$ with a lower semicontinuous Lagrangian $L$ and a…
Any function can be constructed using a hierarchy of simpler functions through compositions. Such a hierarchy can be characterized by a binary rooted tree. Each node of this tree is associated with a function which takes as inputs two…
On a non-compact, smooth, connected, boundaryless, complete Riemannian manifold $(M,g)$, one can define its ideal boundary by rays (or equivalently, Busemann functions). From the viewpoint of Mather theory, boundary elements could be…
We present a detailed analysis of the class of regression decision tree algorithms which employ a regulized piecewise-linear node-splitting criterion and have regularized linear models at the leaves. From a theoretic standpoint, based on…
We consider random systems of equations over the reals, with $m$ equations and $m$ unknowns $P_i(t)+X_i(t)=0$, $t\in\mathbb{R}^m$, $i=1,...,m$, where the $P_i$'s are non-random polynomials having degrees $d_i$'s (the "signal") and the…
Let K be a complete, algebraically closed nonarchimedean valued field, and let f(z) be a non-constant rational function in K(z). We provide explicit bounds for the Lipschitz constant of f(z) acting on the Berkovich projective line, relative…
Probability functions appear in constraints of many optimization problems in practice and have become quite popular. Understanding their first-order properties has proven useful, not only theoretically but also in implementable algorithms,…
Random matrix theory has successfully modeled many systems in physics and mathematics, and often the analysis and results in one area guide development in the other. Hughes and Rudnick computed $1$-level density statistics for low-lying…
It follows from recent results of V. Bakhtin, R. Oleinik, and the second named author that, given a metric space $\mathcal{X}$, a continuous map $\gamma\colon [a,b] \to \mathcal{X}$ is a map of bounded variation if and only if $f \circ…
The greedy leaf removal (GLR) procedure on a graph is an iterative removal of any vertex with degree one (leaf) along with its nearest neighbor (root). Its result has two faces: a residual subgraph as a core, and a set of removed roots.…
We give examples of $L^{1}$-functions that are essentially unbounded on every nonempty open subset of their domains of definition. We obtain such functions as limits of weighted sums of functions with the unboundedly increasing number of…
We consider an elliptic operator $L$ with variable, merely bounded, and measurable coefficients on a Lipschitz domain, and study solutions to $Lu=0$ that attain given Neumann and Dirichlet-regularity data on different parts of the boundary.…