Related papers: Non-ergodicity for the noisy majority vote process…
We show evidence, based on extensive and carefully performed numerical experiments, that the system of two elastic hard-point masses in one-dimension is not ergodic for a generic mass ratio and consequently does not follow the principle of…
In many applications, the common assumption that a driving noise process affecting a system is independent or Markovian may not be realistic, but the noise process may be assumed to be stationary. To study such problems, this paper…
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…
Consider a random recusive tree with n vertices. We show that the number of vertices with even depth is asymptotically normal as n tends to infinty. The same is true for the number of vertices of depth divisible by m for m=3, 4 or 5; in all…
We establish new conditions for obtaining uniform bounds on the moments of discrete-time stochastic processes. Our results require a weak negative drift criterion along with a state-dependent restriction on the sizes of the one-step jumps…
Recent advances in machine learning and artificial intelligence are now being considered in safety-critical autonomous systems where software defects may cause severe harm to humans and the environment. Design organizations in these domains…
We give a characterization of equilibrium measures for $p$-capacities on the boundary of an infinite tree of arbitrary (finite) local degree. For $p=2$, this provides, in the special case of trees, a converse to a theorem of Benjamini and…
Consider a uniformly sampled random $d$-regular graph on $n$ vertices. If $d$ is fixed and $n$ goes to $\infty$ then we can relate typical (large probability) properties of such random graph to a family of invariant random processes (called…
In the case of neutral populations of fixed sizes in equilibrium whose genealogies are described by the Kingman $N$-coalescent back from time $t$ consider the associated processes of total tree length as $t$ increases. We show that the…
We develop a theory of ergodicity for a class of random dynamical systems where the driving noise is not white. The two main tools of our analysis are the strong Feller property and topological irreducibility, introduced in this work for a…
The last decade has witnessed a growing interest in random forest models which are recognized to exhibit good practical performance, especially in high-dimensional settings. On the theoretical side, however, their predictive power remains…
We prove the Erd\H os--S\'os conjecture for trees with bounded maximum degree and large dense host graphs. As a corollary, we obtain an upper bound on the multicolour Ramsey number of large trees whose maximum degree is bounded by a…
In their seminal work, Fermi, Pasta, Ulam and Tsingou explored the connection between statistical mechanics and dynamical properties, such as chaos and ergodicity. Even today, seventy years later, the topic is not fully understood: while…
In this paper, we consider generalized wind-tree models and $\Z^d$-covers over compact translation surfaces. Under suitable hypothesis, we prove recurrence of the linear flow in a generic direction and non-ergodicity of Lebesgue measure.
Place an active particle at the root of the infinite $d$-ary tree and dormant particles at each non-root site. Active particles move towards the root with probability $p$ and otherwise move to a uniformly sampled child vertex. When an…
Graham and Sloane proposed in 1980 a conjecture stating that every tree has a harmonious labelling, a graph labelling closely related to additive base. Very limited results on this conjecture are known. In this paper, we proposed a…
A stochastic forest model of young and old age class trees is studied. First, we prove existence, uniqueness and boundedness of global nonnegative solutions. Second, we investigate asymptotic behavior of solutions by giving a sufficient…
We show that a stationary IDp process (i.e., an infinitely divisible stationary process without Gaussian part) can be written as the independent sum of four stationary IDp processes, each of them belonging to a different class characterized…
Given a transition matrix $P$ indexed by a finite set $V$ of vertices, the voter model is a discrete-time Markov chain in $\{0,1\}^V$ where at each time-step a randomly chosen vertex $x$ imitates the opinion of vertex $y$ with probability…
Gauge theory amplitudes in a non-helicity format are generated at all $n$-point and at tree level. These amplitudes inherit structure from $\phi^3$ classical scattering, and the string inspired formalism is used to find the tensor algebra.…