Related papers: Critical random forests
The motivation for this paper is the study of the phase transition for recurrence/transience of a class of self-interacting random walks on trees, which includes the once-reinforced random walk. For this purpose, we define a quantity, that…
Random Forests have become a widely used tool in machine learning since their introduction in 2001, known for their strong performance in classification and regression tasks. One key feature of Random Forests is the Random Forest…
Anomalous diffusion phenomena occur on length scales spanning from intracellular to astrophysical ranges. A specific form of decay at large argument of the probability density function of rescaled displacement (scaling function) is derived…
The finite size scaling behaviour for the Ising model in five dimensions, with either free or cyclic boundary, has been the subject for a long running debate. The older papers have been based on ideas from e.g. field theory or…
Let $\{S_n,n\geq 0\} $ be a random walk whose increments belong without centering to the domain of attraction of an $\alpha$-stable law $\{Y_t,t\geq 0\}$, i.e. $S_{nt}/a_n\Rightarrow Y_t,t\geq 0,$ for some scaling constants $a_n$. Assuming…
In the past years, many properties of the largest connected components of critical percolation on the high-dimensional torus, such as their sizes and diameter, have been established. The order of magnitude of these quantities equals the one…
We discuss scaling limits of large bipartite planar maps. If p is a fixed integer strictly greater than 1, we consider a random planar map M(n) which is uniformly distributed over the set of all 2p-angulations with n faces. Then, at least…
We consider random dynamics on a uniform random recursive tree with $n$ vertices. Successively, in a uniform random order, each edge is either set on fire with some probability $p_n$ or fireproof with probability $1-p_n$. Fires propagate in…
We consider the critical properties of points of continuous glass transition as one can find in liquids in presence of constraints or in liquids in porous media. Through a one loop analysis we show that the critical Replica Field Theory…
Limiting distributions are derived for the sparse connected components that are present when a random graph on $n$ vertices has approximately $\half n$ edges. In particular, we show that such a graph consists entirely of trees, unicyclic…
We consider Brownian motions with one-sided collisions, meaning that each particle is reflected at its right neighbour. For a finite number of particles a Sch\"{u}tz-type formula is derived for the transition probability. We investigate an…
We continue the study of the level-set percolation of the discrete Gaussian free field (GFF) on regular trees in the critical regime, initiated in arXiv:2302.02753. First, we derive a sharp asymptotic estimate for the probability that the…
We describe a probabilistic methodology, based on random walk estimates, to obtain exponential upper bounds for the probability of observing unusually small maximal components in two classical (near-)critical random graph models. More…
We analyze the geometry of the species- and genotype-size distribution in evolving and adapting populations of single-stranded self-replicating genomes: here programs in the Avida world. We find that a scale-free distribution (power law)…
Consider the following forest-fire model on the upper half-plane of the triangular lattice: Each site can be "vacant" or "occupied by a tree". At time 0 all sites are vacant. Then the process is governed by the following random dynamics:…
Random forests are a machine learning method used to automatically classify datasets and consist of a multitude of decision trees. While these random forests often have higher performance and generalize better than a single decision tree,…
We show that the critical scaling behavior of random-field systems with short-range interactions and disorder correlations cannot be described in general by only two independent exponents, contrary to previous claims. This conclusion is…
The probability P(alpha, N) that search algorithms for random Satisfiability problems successfully find a solution is studied as a function of the ratio alpha of constraints per variable and the number N of variables. P is shown to be…
We study the number of chords and the number of crossings in the largest component of a random chord diagram when the chords are sparsely crossing. This is equivalent to studying the number of vertices and the number of edges in the largest…
We study the convergence of the predictive surface of regression trees and forests. To support our analysis we introduce a notion of adaptive concentration for regression trees. This approach breaks tree training into a model selection…