相关论文: The coding of compact real trees by real valued fu…

Robertson and Seymour proved that for every finite tree $H$, there exists $k$ such that every finite graph $G$ with no $H$ minor has path-width at most $k$; and conversely, for every integer $k$, there is a finite tree $H$ such that every…

Associated to any finite metric space are a large number of objects and quantities which provide some degree of structural or geometric information about the space. In this paper we show that in the setting of subsets of weighted Hamming…

As a flexible nonparametric learning tool, the random forests algorithm has been widely applied to various real applications with appealing empirical performance, even in the presence of high-dimensional feature space. Unveiling the…

Treewidth is a graph parameter that plays a fundamental role in several structural and algorithmic results. We study the problem of decomposing a given graph $G$ into node-disjoint subgraphs, where each subgraph has sufficiently large…

While obtaining optimal algorithms for the most important problems in the LOCAL model has been one of the central goals in the area of distributed algorithms since its infancy, tight complexity bounds are elusive for many problems even when…

We continue the investigation into the computational status of the existence of moduli of regularity (and their use for rates of convergence) in the sense of Kohlenbach, Lopez and Nicolae (2019), carried out w.r.t. classical reverse…

Determining whether two graphs are isomorphic is an important and difficult problem in graph theory. One way to make progress towards this problem is by finding and studying graph invariants that distinguish large classes of graphs. Stanley…

In this work we answer an open question asked by Johnson--Scoville. We show that each merge tree is represented by a discrete Morse function on a path. Furthermore, we present explicit constructions for two different but related kinds of…

Let $\phi(x,y)$ be a continuous function, smooth away from the diagonal, such that, for some $\alpha>0$, the associated generalized Radon transforms \begin{equation} \label{Radon} R_t^{\phi}f(x)=\int_{\phi(x,y)=t} f(y) \psi(y)…

A symbolic-computational algorithm, fully implemented in Maple, is described, that computes explicit expressions for generating functions that enable the efficient computations of the expectation, variance, and higher moments, of the random…

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…

In this paper, we study the induced homological sequence and the induced merge tree of a discrete Morse function on a tree. A discrete Morse function on a tree gives rise to a sequence of Betti numbers that keep track of the number of…

We discuss an autoencoder model in which the encoding and decoding functions are implemented by decision trees. We use the soft decision tree where internal nodes realize soft multivariate splits given by a gating function and the overall…

In the Properly Colored Spanning Tree problem, we are given an edge-colored undirected graph and the goal is to find a properly colored spanning tree, i.e., a spanning tree in which any two adjacent edges have distinct colors. The problem…

Large tree structures are ubiquitous and real-world relational datasets often have information associated with nodes (e.g., labels or other attributes) and edges (e.g., weights or distances) that need to be communicated to the viewers. Yet,…

Splitting trees are those random trees where individuals give birth at constant rate during a lifetime with general distribution, to i.i.d. copies of themselves. The width process of a splitting tree is then a binary, homogeneous…

In this article we investigate the Uniform Spanning Forest ($\mathsf{USF}$) in the nearest-neighbour integer lattice $\mathbf{Z}^{d+1} = \mathbf{Z}\times \mathbf{Z}^d$ with an assignment of conductances that makes the underlying (Network)…

One open problem in source coding is to characterize the limits of representing losslessly a non-identity discrete function of the data encoded independently by the encoders of several correlated sources with memory. This paper investigates…

Tree data are ubiquitous because they model a large variety of situations, e.g., the architecture of plants, the secondary structure of RNA, or the hierarchy of XML files. Nevertheless, the analysis of these non-Euclidean data is difficult…

We study properties of the harmonic measure of balls in typical large discrete trees. For a ball of radius $n$ centered at the root, we prove that, although the size of the boundary is of order $n$, most of the harmonic measure is supported…