Related papers: Smooth Fractal Trees: Analytic Generators and Disc…
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a graph which strongly preserves distances in the graph is a…
Stochastic growth processes give rise to diverse intricate structures everywhere and across all scales in nature. Despite the seemingly unrelated complex phenomena at their origin, the Laplacian growth theory has succeeded in unifying their…
In this article, we present a novel box-covering algorithm for analyzing the fractal properties of complex networks. Unlike traditional algorithms that impose a predetermined box size, our approach assigns nodes to boxes identified by their…
In this paper, we present high-level overviews of tile-based self-assembling systems capable of producing complex, infinite, aperiodic structures known as discrete self-similar fractals. Fractals have a variety of interesting mathematical…
In practical situations, the tree ensemble is one of the most popular models along with neural networks. A soft tree is a variant of a decision tree. Instead of using a greedy method for searching splitting rules, the soft tree is trained…
The basic object we consider is a certain model of continuum random tree, called the stable tree. We construct a fragmentation process $(F^-(t), t>=0)$ out of this tree by removing the vertices located under height $t$. Thanks to a…
Kim defined a very general combinatorial abstraction of the diameter of polytopes called subset partition graphs to study how certain combinatorial properties of such graphs may be achieved in lower bound constructions. Using Lov\'asz'…
We have performed a detailed analysis of the fast multipole method (FMM) in the adaptive case, in which the depth of the FMM tree is non-uniform. Previous works in this area have focused mostly on special types of adaptive distributions,…
In this paper, we investigate the problem of generating the spanning trees of a graph $G$ up to the automorphisms or "symmetries" of $G$. After introducing and surveying this problem for general input graphs, we present algorithms that…
Trees are fundamental data structure for many areas of computer science and system engineering. In this report, we show how to ensure eventual consistency of optimistically replicated trees. In optimistic replication, the different replicas…
The dynamic trees problem is to maintain a forest subject to edge insertions and deletions while facilitating queries such as connectivity, path weights, and subtree weights. Dynamic trees are a fundamental building block of a large number…
Pendulum-like dynamics is a universal motif across many areas of physics, underlying systems ranging from classical nonlinear oscillators to superconducting qubits and cold-atom tunneling platforms. Here we present an exact frequency-domain…
Separated graphs provide a powerful combinatorial tool for approximating dynamical systems. This paper details the explicit construction of Bratteli-like separated graphs -- a generalization of classical Bratteli diagrams -- that encode the…
Generating realistic sparse multi-category 3D voxel structures is difficult due to the cubic memory scaling of voxel structures and moreover the significant class imbalance caused by sparsity. We introduce Scaffold Diffusion, a generative…
The understanding of the mechanisms driving vascular development is still limited. Techniques to generate vascular trees synthetically have been developed to tackle this problem. However, most algorithms are limited to single trees inside…
We develop a finite-sample, design-based theory for random forests in which each tree is a randomized conditional predictor acting on fixed covariates and the forest is their Monte Carlo average. An exact variance identity separates Monte…
We introduce the notion of (abelian) similarity scheme, as a constructive model for topological self-similar fractals, in the same way in which the notion of iterated function system furnishes a constructive notion of self-similar fractals…
A compacted binary tree is a graph created from a binary tree such that repeatedly occurring subtrees in the original tree are represented by pointers to existing ones, and hence every subtree is unique. Such representations form a special…
A generic rectangulation is a partition of a rectangle into finitely many interior-disjoint rectangles, such that no four rectangles meet in a point. In this work we present a versatile algorithmic framework for exhaustively generating a…
Active fluids, composed of individual self-propelled agents, can generate complex large-scale coherent flows. A particularly important laboratory realization of such an active fluid is a system composed of microtubules, aligned in a…