Related papers: The wired minimal spanning forest on the Poisson-w…
In this paper, we analyze the energy coverage performance of heterogeneous millimeter wave (mmWave) wireless power transfer (WPT) networks, where macro base stations (MBSs) are distributed according to a Poisson point process (PPP), the…
This work proves new probability bounds relating to the height, width, and size of Galton-Watson trees. For example, if $T$ is any Galton-Watson tree, and $H$, $W$, and $|T|$ are the height, width, and size of $T$, respectively, then $H/W$…
Using generating functions techniques we develop a relation between the Hausdorff and spectral dimension of trees with a unique infinite spine. Furthermore, it is shown that if the outgrowths along the spine are independent and identically…
The key feature of Weyl semimetals (WSM) is the presence of topologically protected Dirac cones in a 3D material. We consider the effect of restricting geometry on the spectrum of excitations in WSM using as a model a cylindrical WSM wire.…
Given a Galton-Watson process conditioned to have total progeny equal to $n$, we study the asymptotic probability that this conditioned Galton-Watson process has distance to the border bigger or equal than $k$, as the number of nodes $n…
Let $G$ be a connected graph and $W$ be a set of vertices of $G$. The representation multiset of a vertex $v$ with respect to $W$, $r_m (v|W)$, is defined as a multiset of distances between $v$ and the vertices in $W$. If $r_m (u |W) \neq…
Looptrees have recently arisen in the study of critical percolation on the uniform infinite planar triangulation. Here we consider random infinite looptrees defined as the local limit of the looptree associated with a critical…
It is well-known that the height profile of a critical conditioned Galton-Watson tree with finite offspring variance converges, after a suitable normalization, to the local time of a standard Brownian excursion. In this work, we study the…
We demonstrate that the lyman alpha forest flux power spectrum of ``randomised'' QSO absorption spectra is comparable in shape and amplitude to the flux power spectrum of the original observed spectra. In the randomised spectra a random…
A fundamental problem for wireless ad hoc networks is the assignment of suitable transmission powers to the wireless devices such that the resulting communication graph is connected. The goal is to minimize the total transmit power in order…
We study the minimum spanning arborescence problem on the complete digraph $\vec{K}_n$ where an edge $e$ has a weight $W_e$ and a cost $C_e$, each of which is an independent uniform random variable $U^\alpha$ where $\alpha\leq 1$ and $U$ is…
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…
In contrast to finite dimensions where disordered systems display multifractal statistics only at criticality, the tree geometry induces multifractal statistics for disordered systems also off criticality. For the Anderson tight-binding…
We consider a continuous time random walk on the rooted binary tree of depth $n$ with all transition rates equal to one and study its cover time, namely the time until all vertices of the tree have been visited. We prove that, normalized by…
In these expository notes, we describe some features of the multiplicative coalescent and its connection with random graphs and minimum spanning trees. We use Pitman's proof of Cayley's formula, which proceeds via a calculation of the…
We study fragmentation of a random recursive tree into a forest by repeated removal of nodes. The initial tree consists of N nodes and it is generated by sequential addition of nodes with each new node attaching to a randomly-selected…
The two-dimensional directed spanning forest (DSF) introduced by Baccelli and Bordenave is a planar directed forest whose vertex set is given by a homogeneous Poisson point process $\mathcal{N}$ on $\mathbb{R}^2$. If the DSF has direction…
The fractal dimension of minimal spanning trees on percolation clusters is estimated for dimensions $d$ up to $d=5$. A robust analysis technique is developed for correlated data, as seen in such trees. This should be a robust method…
We study $\lambda$-biased branching random walks on Bienaym\'e--Galton--Watson trees in discrete time. We consider the maximal displacement at time $n$, $\max_{\vert u \vert =n} \vert X(u) \vert$, and show that it almost surely grows at a…
We consider the minimum spanning tree problem in a setting where the edge weights are stochastic from unknown distributions, and the only available information is a single sample of each edge's weight distribution. In this setting, we…