Related papers: Is the Random Tree Puzzle process the same as the …
A family of self-similar and translation-invariant random sup-measures with long-range dependence are investigated. They are shown to arise as the limit of the empirical random sup-measure of a stationary heavy-tailed process, inspired by…
We build a theory of binary trees on finite multisets that categorifies, or operationalizes, the entropy of a finite probability distribution. Multisets operationalize probabilities as the event outcomes of an experiment. Huffman trees…
Jigsaw percolation is a nonlocal process that iteratively merges connected clusters in a deterministic "puzzle graph" by using connectivity properties of a random "people graph" on the same set of vertices. We presume the Erdos--Renyi…
In 1986, Janson showed that the number of edges in the union of $k$ random spanning trees in the complete graph $K_n$ is a shifted Poisson distribution. Using results from the theory of electrical networks, we provide a new proof of this…
We consider a real-valued path; it is possible to associate a tree to this path, and we explore the relations between the tree, the properties of $p$-variation of the path, and integration with respect to the path. In particular, the…
This paper derives a unifying theorem establishing consistency results for a broad class of tree-based algorithms. It improves current results in two aspects. First of all, it can be applied to algorithms that vary from traditional Random…
We present a generalization of the Yule model for macroevolution in which, for the appearance of genera, we consider point processes with the order statistics property, while for the growth of species we use nonlinear time-fractional pure…
We study the long-time behavior of the probability density associated with the decoupled continuous-time random walk which is characterized by a superheavy-tailed distribution of waiting times. It is shown that if the random walk is…
An electrical network with the structure of a random tree is considered: starting from a root vertex, in one iteration each leaf (a vertex with zero or one adjacent edges) of the tree is extended by either a single edge with probability $p$…
Consider the $d$ dimensional lattice $\mathbb{Z}^d$ where each vertex is open or closed with probability $p$ or $1-p$ respectively. An open vertex $\mathbb{u} := (\mathbb{u}(1), \mathbb{u}(2),...,\mathbb{u}(d))$ is connected by an edge to…
We characterize the complex, heavy-tailed probability distribution functions (pdf) describing the response and its local extrema for structural systems subjected to random forcing that includes extreme events. Our approach is based on the…
In pruning, the Lottery Ticket Hypothesis posits that large networks contain sparse subnetworks, or winning tickets, that can be trained in isolation to match the performance of their dense counterparts. However, most existing approaches…
We present an overview of possible reasons for the appearance of heavy-tailed distributions in applications to the natural sciences. These distributions include the laws of Pareto, Lotka, and some new ones. The reasons are illustrated using…
Tree search is a fundamental tool for planning, as many sequential decision-making problems can be framed as searching over tree-structured spaces. We propose an uncertainty-guided tree search algorithm for settings where the reward…
In this paper, we address the problem of packing large trees in $G_{n,p}$. In particular, we prove the following result. Suppose that $T_1, \dotsc, T_N$ are $n$-vertex trees, each of which has maximum degree at most $(np)^{1/6} / (\log…
Heavy tails are often found in practice, and yet they are an Achilles heel of a variety of mainstream random probability measures such as the Dirichlet process (DP). The first contribution of this paper focuses on characterizing the tails…
There are numerous randomized algorithms to generate spanning trees in a given ambient graph; several target the uniform distribution on trees (UST), while in practice the fastest and most frequently used draw random weights on the edges…
The paper deals with a new class of random walks strictly connected with the Pareto distribution. We consider stochastic processes in the sense of generalized convolution or weak generalized convolution following the idea given in [1]. The…
The Horton-Strahler analysis is a graph-theoretic method to measure the bifurcation complexity of branching patterns, by defining a number called the order to each branch. The main result of this paper is a large deviation theorem for the…
We consider unimodular random rooted trees (URTs) and invariant forests in Cayley graphs. We show that URTs of bounded degree are the same as the law of the component of the root in an invariant percolation on a regular tree. We use this to…