相关论文: A functional limit theorem for the profile of $b$-…

In this article we derive a self-normalized functional limit theorem for strictly stationary linear processes with i.i.d. heavy-tailed innovations and random coefficients under the condition that all partial sums of the series of…

We construct $P(phi)_1$-processes indexed by the full time-line, separately derived from the functional integral representations of the relativistic and non-relativistic Nelson models in quantum field theory. These two cases differ…

We consider a particle system in continuous time, discrete population, with spatial motion and nonlocal branching. The offspring's weights and their number may depend on the mother's weight. Our setting captures, for instance, the processes…

In the first part of this paper we give easy and intuitive proofs for the small value probabilities of the martingale limit of a supercritical Galton-Watson process in both the Schr\"oder and the B\"ottcher case. These results are…

The purpose of this article is to construct a toolbox, in Dynamical Systems, to support the idea that ``whenever we can prove a limit theorem in the classical sense for a dynamical system, we can prove a suitable almost-sure version based…

For a martingale $(X_n)$ converging almost surely to a random variable $X$, the sequence $(X_n - X)$ is called martingale tail sum. Recently, Neininger [Random Structures Algorithms, 46 (2015), 346-361] proved a central limit theorem for…

The tree-width of a multivariate polynomial is the tree-width of the hypergraph with hyperedges corresponding to its terms. Multivariate polynomials of bounded tree-width have been studied by Makowsky and Meer as a new sparsity condition…

We propose a tree-based algorithm for classification and regression problems in the context of functional data analysis, which allows to leverage representation learning and multiple splitting rules at the node level, reducing…

The aim of this lecture is to give an overview of old and new resultson Bienaym\'e-Galton-Watson (BGW) trees. After introducing the framework of discretetrees, we first give alternative proofs of classical results on theextinction…

We consider random binary trees that appear as the output of certain standard algorithms for sorting and searching if the input is random. We introduce the subtree size metric on search trees and show that the resulting metric spaces…

We prove a functional limit theorem for Markov chains that, in each step, move up or down by a possibly state dependent constant with probability $1/2$, respectively. The theorem entails that the law of every one-dimensional regular…

We show a new functional limit theorem for weakly dependent regularly varying sequences of random vectors. As it turns out, the convergence takes place in the space of R^d valued c\`{a}dl\`{a}g functions endowed with the so-called weak M1…

This paper provides, over Henselian valued fields, some theorems on implicit function and of Artin--Mazur on algebraic power series. Also discussed are certain versions of the theorems of Abhyankar--Jung and Newton--Puiseux. The latter is…

A particular continuous-time multitype branching process is considered, it is the continuous-time embedding of a discrete-time process which is very popular in theoretical computer science: the m-ary search tree (m is an integer). There is…

We investigate branching processes in nearly degenerate varying environment, where the offspring distribution converges to the degenerate distribution at 1. Such processes die out almost surely, therefore, we condition on non-extinction or…

We study infinite tree and ultrametric matrices, and their action on the boundary of the tree. For each tree matrix we show the existence of a symmetric random walk associated to it and we study its Green potential. We provide a…

In the paper, the law of the iterated logarithm for additive functionals of Markov chains is obtained under some weak conditions, which are weaker than the conditions of invariance principle of additive functionals of Markov chains in M.…

Any function can be constructed using a hierarchy of simpler functions through compositions. Such a hierarchy can be characterized by a binary rooted tree. Each node of this tree is associated with a function which takes as inputs two…

In arXiv:1609.05666v1 [math.PR] a functional limit theorem was proved. It states that symmetric processes associated with resistance metric measure spaces converge when the underlying spaces converge with respect to the…

A Berry--Ess\'{e}en theorem for linear combinations of iterates of an inner function is obtained. Our proof, which is based an elementary transfer argument and classical results in martingale theory, also leads to a simple proof of Nicolau…