相关论文: Uniform attachment with freezing

We study the behavior of Random Walk in Random Environment (RWRE) on trees in the critical case left open in previous work. Representing the random walk by an electrical network, we assume that the ratios of resistances of neighboring edges…

This article presents two novel algorithms for generating random increasing trees. The first algorithm efficiently generates strictly increasing binary trees using an ad hoc method. The second algorithm improves the recursive method for…

The forest of mutations associated to a multitype branching forest is obtained by merging together all vertices of its clusters and by preserving connections between them. We first show that the forest of mutations of any mulitype branching…

We first show that increasing trees are in bijection with set compositions, extending simultaneously a recent result on trees due to Tonks and a classical result on increasing binary trees. We then consider algebraic structures on the…

The issue of estimating residual variance in regression models has experienced relatively little attention in the machine learning community. However, the estimate is of primary interest in many practical applications, e.g. as a primary…

Consider a homogeneous Poisson point process in a compact convex set in $d$-dimensional Euclidean space which has interior points and contains the origin. The radial spanning tree is constructed by connecting each point of the Poisson point…

Tree-based ensemble methods, as Random Forests and Gradient Boosted Trees, have been successfully used for regression in many applications and research studies. Furthermore, these methods have been extended in order to deal with uncertainty…

Networks are widely used to model the interaction between individual dynamical systems. In many instances, the total number of units as well as the interaction coupling are not fixed in time, but rather constantly evolve. In terms of…

A random forest prediction can be computed by the scalar product of the labels of the training examples and a set of weights that are determined by the leafs of the forest into which the test object falls; each prediction can hence be…

In a system where two identical two-level atoms interact with their common one-mode cavity field, it is shown that entanglement can become abruptly frozen in time, remaining at a constant value for a period of time until it begins to thaw…

A tree ${\mathbb T} =\langle T\leq \rangle$ is reversible iff there is no order $\preccurlyeq \;\varsubsetneq \;\leq $ such that ${\mathbb T} \cong \langle T ,\preccurlyeq\rangle$. Using a characterization of reversibility via back and…

Uniform spanning trees are a statistical model obtained by taking the set of all spanning trees on a given graph (such as a portion of a cubic lattice in d dimensions), with equal probability for each distinct tree. Some properties of such…

We consider a recursively defined random set of points and its barycenter, where the random set is constructed by the following inductive rule: Given a realization of $n-1$ points, one of them is picked at random and serves as a source the…

Our main results in this paper are new equidistributions on plane trees and $132$-avoiding permutations, two closely related objects. As for the former, we discover a characteristic for vertices of plane trees that is equally distributed as…

Motivated by the continuing interest in the tree data model, we study the expressive power of downward navigational query languages on trees and chains. Basic navigational queries are built from the identity relation and edge relations…

We inspect the propagation of shear polarized surface waves akin to Love waves through a forest of trees of same height atop a guiding layer on a soil substrate. We discover that the foliage of trees { brings a radical change in} the nature…

Let $T$ be a tree, we show that the null space of the adjacency matrix of $T$ has relevant information about the structure of $T$. We introduce the Null Decomposition of trees, and use it in order to get formulas for independence number and…

Variable selection for high-dimensional linear models has received a lot of attention lately, mostly in the context of l1-regularization. Part of the attraction is the variable selection effect: parsimonious models are obtained, which are…

A method for creating a forest of model trees to fit samples of a function defined on images is described in several steps: down-sampling the images, determining a tree's hyperplanes, applying convolutions to the hyperplanes to handle small…

Motivated by the study of random temporal networks, we introduce a class of random trees that we coin \emph{uniform temporal trees}. A uniform temporal tree is obtained by assigning independent uniform $[0,1]$ labels to the edges of a…