Related papers: A note on the limit law of one-sided tree destruct…
Random survival forest and survival trees are popular models in statistics and machine learning. However, there is a lack of general understanding regarding consistency, splitting rules and influence of the censoring mechanism. In this…
Let $T$ be a regular rooted tree. For every natural number $n$, let $B_n$ be the finite subtree of vertices with graph distance at most $n$ from the root. Consider the following forest-fire model on $B_n$: Each vertex can be "vacant" or…
We study the simple random walk on trees and give estimates on the mixing and relaxation time. Relying on a recent characterization by Basu, Hermon and Peres, we give geometric criteria, which are easy to verify and allow to determine…
The occurrence and the distribution of patterns of trees associated to natural numbers are investigated. Bounds from above and below are proven for certain natural quantities.
As a model of trapping by biased motion in random structure, we study the time taken for a biased random walk to return to the root of a subcritical Galton-Watson tree. We do so for trees in which these biases are randomly chosen,…
We consider the one-dimensional generalized forest fire process: at each site of $\zz$, seeds and matches fall according some i.i.d. stationary renewal processes. When a seed falls on an empty site, a tree grows immediately. When a match…
We consider fragmentations of an R-tree $T$ driven by cuts arriving according to a Poisson process on $T \times [0, \infty)$, where the first co-ordinate specifies the location of the cut and the second the time at which it occurs. The…
We use the Mass Transport Principle to analyze the local recursion governing the resolvent $(A-z)^{-1}$ of the adjacency operator of unimodular random trees. In the limit where the complex parameter $z$ approaches a given location $\lambda$…
In this note, we make explicit the law of the renormalized supercritical branching random walk, giving credit to a conjecture formulated in a previous works of the authors for a continuous analog of the branching random walk. Also, in the…
We define the (random) $k$-cut number of a rooted graph to model the difficulty of the destruction of a resilient network. The process is as the cut model of Meir and Moon except now a node must be cut $k$ times before it is destroyed. The…
This paper investigates the large deviation problem in the sample path space of the nearest-neighbor random walks on regular trees. We establish the sample path large deviation principle for the law of the distance from a nearest random…
We solve a conjecture by Becker et al. (arXiv:2404.05963) on the topic of zero forcing regarding the number of minimal forts of a tree. They conjectured and we prove $\mathcal{F}_{T_n} \le \binom{n}{2} \mathcal{F}_{P_n}$ where…
We study the minimal spanning arborescence which is the directed analogue of the minimal spanning tree, with a particular focus on its infinite volume limit and its geometric properties. We prove that in a certain large class of transient…
We consider the biased random walk on a tree constructed from the set of finite self-avoiding walks on a lattice, and use it to construct probability measures on infinite self-avoiding walks. The limit measure (if it exists) obtained when…
We consider simple exclusion processes on Z for which the underlying random walk has a finite first moment and a non-zero mean and whose initial distributions are product measures with different densities to the left and to the right of the…
We investigate the motion of a massive particle constrained to move along a path consisting of two line segments on a vertical plane under an arbitrary conservative force. By fixing the starting and end points of the track and varying the…
The purpose of this paper is to analyze certain statistics of a recently introduced non-uniform random tree model, biased recursive trees. This model is based on constructing a random tree by establishing a correspondence with non-uniform…
The deleting items theorems of weak law of large numbers (WLLN),strong law of large numbers (SLLN) and central limit theorem (CLT) are derived by substituting partial sum of random variable sequence with deleting items partial sum. We…
We introduce the problem of isolating several nodes in random recursive trees by successively removing random edges, and study the number of random cuts that are necessary for the isolation. In particular, we analyze the number of random…
An application of Levy's continuity theorem and Hankel transform allow us to establish a law limit theorem for the sequence $V_n=f(U)\sin(n U)$, where $U$ is uniformly distributed in $(0,1)$ and $f$ a given function. Further, we investigate…