相关论文: Branching Processes, and Random-Cluster Measures o…
Conditions for almost sure extinction are studied in discrete time branching processes with an infinite number of types. It is not assumed that the expected number of children is a bounded function of the parent's type. There might also be…
We consider random walks on $\Z^8$ indexed by the infinite invariant tree, which consists of an infinite spine and finite random trees attached to it on both sides. We establish the precise order of the non-intersection probability between…
A causal set is a partially ordered set on a countably infinite ground-set such that each element is above finitely many others. A natural extension of a causal set is an enumeration of its elements which respects the order. We bring…
We study the asymptotic behavior af the number of cuts $X(T_n)$ needed to isolate the root in a rooted binary random tree $T_n$ with $n$ leaves. We focus on the case of subtrees of the Continuum Random Tree generated by uniform sampling of…
We define a minimization problem for paths on planar graphs that, on the honeycomb lattice, is equivalent to the exploration path of the critical site percolation and than has the same scaling limit of SLE_6. We numerically study this model…
For a branching process in random environment it is assumed that the offspring distribution of the individuals varies in a random fashion, independently from one generation to the other. Interestingly there is the possibility that the…
Self-similarity of random trees is related to the operation of pruning. Pruning $R$ cuts the leaves and their parental edges and removes the resulting chains of degree-two nodes from a finite tree. A Horton-Strahler order of a vertex $v$…
Subcritical population processes are attracted to extinction and do not have non-trivial stationary distributions, which prompts the study of quasi-stationary distributions (QSDs) instead. In contrast to what generally happens for…
We consider the problem of computing the measure of a regular set of infinite binary trees. While the general case remains unsolved, we show that the measure of a language can be computed when the set is given in one of the following three…
We study a spatial model of random permutations on trees with a time parameter $T>0$, a special case of which is the random stirring process. The model on trees was first analysed by Bj\"ornberg and Ueltschi[BU16], who established the…
We consider stochastic processes indexed by the vertices of an infinite binary tree having a simple recursive structure. The value at any vertex is some fixed function of the values at the two daughter vertices together with some…
Several real-world and abstract structures and systems are characterized by marked hierarchy to the point of being expressed as trees. Because the study of these entities often involves sampling (or discovering) the tree nodes in a specific…
We investigate the behaviour of five classical centrality measures--Jordan, rumor, betweenness, degree, and closeness centralities--in the setting of uniform random recursive trees. Motivated by applications in network archaeology, we focus…
We propose a new anytime hierarchical clustering method that iteratively transforms an arbitrary initial hierarchy on the configuration of measurements along a sequence of trees we prove for a fixed data set must terminate in a chain of…
The matrices of spanning rooted forests are studied as a tool for analysing the structure of networks and measuring their properties. The problems of revealing the basic bicomponents, measuring vertex proximity, and ranking from preference…
We study a random fragmentation process and its associated random tree. The process has earlier been studied by Dean and Majumdar (J. Phys. A: Math. Gen., vol. 35, L501--L507), who found a phase transition: the number of fragmentations is…
Comparing observed behavior (event data generated during process executions) with modeled behavior (process models), is an essential step in process mining analyses. Alignments are the de-facto standard technique for calculating conformance…
A set of discrete individual points located in an embedding continuum space can be seen as percolating or non-percolating, depending on the radius of the discs/spheres associated with each of them. This problem is relevant in theoretical…
We study the law of random self-similar series defined above an irrational rotation on the Circle. This provides a natural class of continuous singular non-Rajchman measures.
We consider a Brownian motion with linear drift that splits at fixed time points into a fixed number of branches, which may depend on the branching point. For this process, which we shall refer to as the Brownian decision tree, we…