Related papers: Bellman function sitting on a tree
We introduce a new, relatively simple, line-breaking construction of the $\alpha$-stable tree which realises its random finite-dimensional distributions. This is a direct analogue of Aldous' line-breaking construction of the Brownian…
We shall consider a result of Fel'dman, where a sharp Baker-type lower bound is obtained for linear forms in the values of some E-functions. Fel'dman's proof is based on an explicit construction of Pad\'e approximations of the first kind…
We consider existence and uniqueness of two kinds of coisotropic embeddings and deduce the existence of deformation quantizations of certain Poisson algebras of basic functions. First we show that any submanifold of a Poisson manifold…
An elementary proof of a quantitative version of the Riemann-Lebesgue lemma for functions supported on the half line is given. Applications to differential models with memory are discussed.
The p-adic numbers have found applications in a wide range of diverse fields of research. In some applications the algebraic properties of p-adics enter as an indispensable ingredient of the theory. Another class of applications has to do…
Tree-based protocols are ubiquitous in distributed systems. They are flexible, they perform generally well, and, in static conditions, their analysis is mostly simple. Under churn, however, node joins and failures can have complex global…
This paper deals with the problem of function estimation. Using the white noise model setting, we provide a method to construct a new wavelet procedure based on thresholding rules which takes advantage of the dyadic structure of the wavelet…
Metric embedding has become a common technique in the design of algorithms. Its applicability is often dependent on how high the embedding's distortion is. For example, embedding finite metric space into trees may require linear distortion…
We study three different kinds of embeddings of tree patterns: weakly-injective, ancestor-preserving, and lca-preserving. While each of them is often referred to as injective embedding, they form a proper hierarchy and their computational…
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.
Bayesian methods - either based on Bayes Factors or BIC - are now widely used for model selection. One property that might reasonably be demanded of any model selection method is that if a model ${M}_{1}$ is preferred to a model ${M}_{0}$,…
We use the Bellman function method to give an elementary proof of a sharp weighted estimate for the Haar shifts, which is linear in the $A_2$ norm of the weight and in the complexity of the shift. Together with the representation of a…
We introduce the branching transitive closure operator on weighted monadic second-order logic formulas where the branching corresponds in a natural way to the branching inherent in trees. For arbitrary commutative semirings, we prove that…
The purpose of this paper is to analyze certain statistics of a recently introduced non-uniform random tree model, biased recursive trees. This model is based on constructing a random tree by establishing a correspondence with non-uniform…
We formulate the dynamical mean field theory directly in the continuum. For a given definition of the local Green's function, we show the existence of a unique functional, whose stationary point gives the physical local Green's function of…
In a supercritical branching particle system, the trimmed tree consists of those particles which have descendants at all times. We develop this concept in the superprocess setting. For a class of continuous superprocesses with Feller…
The output of a machine learning algorithm can usually be represented by one or more multivariate functions of its input variables. Knowing the global properties of such functions can help in understanding the system that produced the data…
Recent efforts to learn reward functions from human feedback have tended to use deep neural networks, whose lack of transparency hampers our ability to explain agent behaviour or verify alignment. We explore the merits of learning…
The present paper provides a generalization of the previous authors' work on Bellman functions for integral functionals on $\mathrm{BMO}$. Those Bellman functions are the minimal locally concave functions on parabolic strips in the plane.…
In this paper we study the Dirichlet problem for systems of mean value equations on a regular tree. We deal both with the directed case (the equations verified by the components of the system at a node in the tree only involve values of the…