English
Related papers

Related papers: Estimates for Nonlinear Harmonic Measures on Trees

200 papers

Let $\Omega \subset {R}^n,$ $n \geq 3,$ be a bounded open set, $x=(x_1,x_2,\ldots,x_n)$ a generic point which belongs to $\Omega,$ $u \colon \Omega \to {R}^N ,$ $N>1,$ and $ Du=(D_\alpha u^i)$, $D_\alpha = \partial/\partial x_\alpha, $…

Analysis of PDEs · Mathematics 2020-06-16 M. A. Ragusa , A. Tachikawa

In this paper, estimates for norms of weighted summation operators (discrete Hardy-type operators) on a tree are obtained for $1<p<q<\infty$ and for arbitrary weights and trees.

Classical Analysis and ODEs · Mathematics 2015-09-24 A. A. Vasil'eva

A metric tree ($M$, $d$), also known as $\mathbb{R}$-trees or $T$-theory, is a metric space such that between any two points there is an unique arc and that arc is isometric to an interval in $\mathbb{R}$. In this paper after presenting…

Metric Geometry · Mathematics 2009-02-23 A. G. Aksoy , M. S. Borman , A. L. Westfahl

Phylogenetic trees are a central tool in understanding evolution. They are typically inferred from sequence data, and capture evolutionary relationships through time. It is essential to be able to compare trees from different data sources…

Populations and Evolution · Quantitative Biology 2017-10-31 Michelle Kendall , Caroline Colijn

Tree perception is an essential building block toward autonomous forestry operations. Current developments generally consider input data from lidar sensors to solve forest navigation, tree detection and diameter estimation problems. Whereas…

Computer Vision and Pattern Recognition · Computer Science 2022-11-01 Vincent Grondin , Jean-Michel Fortin , François Pomerleau , Philippe Giguère

The algorithm with compensation of parametric uncertainties, external disturbances and measurement noises for linear time-invariant plants is designed. It is assumed, that the dimension of the noise can be equaled to the state vector…

Systems and Control · Computer Science 2016-11-30 Igor B. Furtat

This study is dedicated to precise distributional analyses of the height of non-plane unlabelled binary trees ("Otter trees"), when trees of a given size are taken with equal likelihood. The height of a rooted tree of size $n$ is proved to…

Probability · Mathematics 2012-11-12 Nicolas Broutin , Philippe Flajolet

We consider planar rooted random trees whose distribution is even for fixed height $h$ and size $N$ and whose height dependence is given by a power function $h^\alpha$. Defining the total weight for such trees of fixed size to be $Z_N$, a…

Probability · Mathematics 2023-04-05 Bergfinnur Durhuus , Meltem Ünel

In this paper we investigate the use of the concept of tree dimension in Horn clause analysis and verification. The dimension of a tree is a measure of its non-linearity - for example a list of any length has dimension zero while a complete…

Logic in Computer Science · Computer Science 2015-12-15 Bishoksan Kafle , John P. Gallagher , Pierre Ganty

We establish sharp energy estimates for some solutions, such as global minimizers, monotone solutions and saddle-shaped solutions, of the fractional nonlinear equation $(-\Delta)^{1/2} u=f(u)$ in $\re^n$. Our energy estimates hold for every…

Analysis of PDEs · Mathematics 2010-04-19 Xavier Cabre , Eleonora Cinti

We consider fixed-point equations for probability measures charging measured compact metric spaces that naturally yield continuum random trees. On the one hand, we study the existence/uniqueness of the fixed-points and the convergence of…

Probability · Mathematics 2021-05-05 Nicolas Broutin , Henning Sulzbach

In this work, we investigate the spectrum of singularities of random stable trees with parameter $\gamma\in(1,2)$. We consider for that purpose the scaling exponents derived from two natural measures on stable trees: the local time $\ell^a$…

Probability · Mathematics 2015-10-27 Paul Balança

Random forests are a statistical learning method widely used in many areas of scientific research because of its ability to learn complex relationships between input and output variables and also its capacity to handle high-dimensional…

Machine Learning · Statistics 2024-02-19 Louis Capitaine , Jérémie Bigot , Rodolphe Thiébaut , Robin Genuer

This work addresses the problem of computing measures of recognisable sets of infinite trees. An algorithm is provided to compute the probability measure of a tree language recognisable by a weak alternating automaton, or equivalently…

Formal Languages and Automata Theory · Computer Science 2025-12-22 Damian Niwiński , Marcin Przybyłko , Michał Skrzypczak

For any fixed measure $H$ that maps graphs to real numbers, the MinH problem is defined as follows: given a graph $G$, an integer $k$, and a target $\tau$, is there a set $S$ of $k$ vertices that can be deleted, so that $H(G - S)$ is at…

Data Structures and Algorithms · Computer Science 2019-10-01 Serge Gaspers , Joshua Lau

Estimating phylogenetic trees is an important problem in evolutionary biology, environmental policy and medicine. Although trees are estimated, their uncertainties are discarded by mathematicians working in tree space. Here we explicitly…

Methodology · Statistics 2017-10-16 Amy D. Willis , Rayna C. Bell

This paper studies two classes of variational problems introduced in [7], related to the optimal shapes of tree roots and branches. Given a measure $\mu$ describing the distribution of leaves, a sunlight functional $\S(\mu)$ computes the…

Optimization and Control · Mathematics 2020-06-14 Alberto Bressan , Michele Palladino , Qing Sun

This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted binary trees. The height of such a tree chosen uniformly among those of size $n$ is proved to have a limiting theta distribution, both in a…

Combinatorics · Mathematics 2008-07-16 Nicolas Broutin , Philippe Flajolet

We derive the analytical expression for the first finite size correction to the average free energy of disordered Ising models on random regular graphs. The formula can be physically interpreted as a weighted sum over all non…

Disordered Systems and Neural Networks · Physics 2014-08-04 Carlo Lucibello , Flaviano Morone , Giorgio Parisi , Federico Ricci-Tersenghi , Tommaso Rizzo

The minimum linear arrangement problem on a network consists of finding the minimum sum of edge lengths that can be achieved when the vertices are arranged linearly. Although there are algorithms to solve this problem on trees in polynomial…

Data Analysis, Statistics and Probability · Physics 2017-12-14 Juan Luis Esteban , Ramon Ferrer-i-Cancho , Carlos Gómez-Rodríguez