Related papers: Vertices with fixed outdegrees in large Galton-Wat…
We consider a multitype Galton-Watson process that allows for the mutation and reversion of individual types in discrete and continuous time. In this setting, we explicitly compute the time evolution of quantities such as the mean and…
We consider Galton-Watson trees with Geom$(p)$ offspring distribution. We let $T_{\infty}(p)$ denote such a tree conditioned on being infinite. We prove that for any $1/2\leq p_1 <p_2 \leq 1$, there exists a coupling between…
We give an alternative proof of the fact that the vertex reinforced jump process on Galton- Watson tree has a phase transition between recurrence and transience as a function of c, the initial local time, see [3]. Further, applying the…
We study random trees which are invariant in law under the operation of contracting each edge independently with probability $p\in(0,1)$. We show that all such trees can be constructed through Poissonian sampling from a certain class of…
We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…
We consider a Galton-Watson tree where each node is marked independently of each others with a probability depending on itsout-degree. Using a penalization method, we exhibit new martingales where the number of marks up to level n -- 1…
We consider a random walk on a supercritical Galton-Watson tree with leaves, where the transition probabilities of the walk are determined by biases that are randomly assigned to the edges of the tree. The biases are chosen independently on…
We study the local limit of the fixed-point forest, a tree structure associated to a simple sorting algorithm on permutations. This local limit can be viewed as an infinite random tree that can be constructed from a Poisson point process…
We prove upper and lower bounds for the spectral condition number of rectangular Vandermonde matrices with nodes on the complex unit circle. The nodes are "off the grid", pairs of nodes nearly collide, and the studied condition number grows…
We present a finite-size scaling analysis of the droplet condensation-evaporation transition of a lattice gas (in two and three dimensions) and a Lennard-Jones gas (in three dimensions) at fixed density. Parallel multicanonical simulations…
A class of branching processes in varying environments is exhibited which become extinct almost surely even though the means M_n grow fast enough so that sum M_n^{-1} is finite. In fact, such a process is constructed for every offspring…
We study $I(T)$, the number of inversions in a tree $T$ with its vertices labeled uniformly at random, which is a generalization of inversions in permutations. We first show that the cumulants of $I(T)$ have explicit formulas involving the…
A branching process in random environment $(Z_n, n \in \N)$ is a generalization of Galton Watson processes where at each generation the reproduction law is picked randomly. In this paper we give several results which belong to the class of…
We prove local convergence results of rerooted conditioned multi-type Galton--Watson trees. The limit objects are multitype variants of the random sin-tree constructed by Aldous (1991), and differ according to which types recur infinitely…
We study the role of finiteness and fluctuations about average quantities for basic structural properties of growing networks. We first determine the exact degree distribution of finite networks by generating function approaches. The…
A fundamental problem in network science is the normalization of the topological or physical distance between vertices, that requires understanding the range of variation of the unnormalized distances. Here we investigate the limits of the…
This paper deals with branching processes in varying environment, namely, whose offspring distributions depend on the generations. We provide sufficient conditions for survival or extinction which rely only on the first and second moments…
We consider the set of random Bienaym\'e-Galton-Watson trees with a bounded number of offspring and bounded number of generations as a statistical mechanics model: a random tree is a rooted subtree of the maximal tree; the spin at a given…
We study connected graphs with a fixed degree sequence, in the sparse setting where the number of edges grows linearly in the number of vertices. Using the relation to the configuration model, we identify the number of such connected graphs…
In the regime of Galton-Watson trees, first order logic statements are roughly equivalent to examining the presence of specific finite subtrees. We consider the space of all trees with Poisson offspring distribution and show that such…