Related papers: Factor of iid percolation on trees
Single-level density-based approach has long been widely acknowledged to be a conceptually and mathematically convincing clustering method. In this paper, we propose an algorithm called "best-scored clustering forest" that can obtain the…
We consider the extinction time of the contact process on increasing sequences of finite graphs obtained from a variety of random graph models. Under the assumption that the infection rate is above the critical value for the process on the…
We study notions of hyperuniformity for invariant locally square-integrable point processes in regular trees. We show that such point processes are never geometrically hyperuniform, and if the diffraction measure has support in the…
We establish that the phase transition for infinite cycles in the random stirring model on an infinite regular tree of high degree is sharp. That is, we prove that there exists d_0 such that, for any d \geq d_0, the set of parameter values…
We calculate the mean and almost-sure leading order behaviour of the high frequency asymptotics of the eigenvalue counting function associated with the natural Dirichlet form on $\alpha$-stable trees, which lead in turn to short-time heat…
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…
On a finite graph, there is a natural family of Boltzmann probability measures on cycle-rooted spanning forests, parametrized by weights on cycles. For a certain subclass of those weights, we construct Gibbs measures in infinite volume, as…
We study percolation properties of the upper invariant measure of the contact process on $\mathbb{Z}^d$. Our main result is a sharp percolation phase transition with exponentially small clusters throughout the subcritical regime and a…
We study scale-invariant geometric quantities associated with embedded closed curves in Euclidean three-space, with an emphasis on their behavior under optimization within a fixed knot type. Given a Euclidean-invariant and scale-covariant…
The bond incident degree (BID) index of a graph \(G\) is defined as \(\BID(G) = \sum_{u_1u_2\in E(G)} f(d(u_1), d(u_2))\), where \(f(x,y)=f(y,x)\) is a real-valued function. In this paper, using graph transformation methods, we establish…
A classical result by Otter shows that the complete graph has an exponential number of non-isomorphic spanning trees. This was recently extended by Lee to every almost regular graph of sufficiently large degree. In this paper, we consider…
This paper presents a brand new nonparametric density estimation strategy named the best-scored random forest density estimation whose effectiveness is supported by both solid theoretical analysis and significant experimental performance.…
Let $\mathbf G$ be a graphing, that is a Borel graph defined by $d$ measure preserving involutions. We prove that if $\mathbf G$ is {\em treeable} then it arises as the local limit of some sequence $(G_n)_{n\in\mathbb{N}}$ of graphs with…
Let $d\geq 2$. We consider an i.i.d. supercritical bond percolation on $\mathbb{Z}^d$, every edge is open with a probability $p>p_c(d)$, where $p_c(d)$ denotes the critical point. We condition on the event that $0$ belongs to the infinite…
We show that any finite-entropy, countable-valued finitary factor of an i.i.d process can also be expressed as a finitary factor of a finite-valued i.i.d process whose entropy is arbitrarily close to the target process. As an application,…
The aim of this article is to study the forest composed by point-to-line geodesics in the last-passage percolation model with exponential weights. We will show that the location of the root can be described in terms of the maxima of a…
We define the induced arboricity of a graph $G$, denoted by ${\rm ia}(G)$, as the smallest $k$ such that the edges of $G$ can be covered with $k$ induced forests in $G$. This notion generalizes the classical notions of the arboricity and…
We provide a sufficient condition on the isoperimetric properties of a regular graph $G$ of growing degree $d$, under which the random subgraph $G_p$ typically undergoes a phase transition around $p=\frac{1}{d}$ which resembles the…
The induced arboricity of a graph $G$ is the smallest number of induced forests covering the edges of $G$. This is a well-defined parameter bounded from above by the number of edges of $G$ when each forest in a cover consists of exactly one…
Answering questions of Itai Benjamini, we show that the event of complete occupation in 2-neighbour bootstrap percolation on the d-dimensional box [n]^d, for d\geq 2, at its critical initial density p_c(n), is noise sensitive, while in…