Related papers: A functional limit theorem for the profile of $b$-…

We consider large uniform random trees where we fix for each vertex its degree and height. We prove, under natural conditions of convergence for the profile, that those trees properly renormalized converge. To this end, we study the paths…

We prove the existence of harmonic functions $f$ on trees, with respect to suitable transient transition operators $P$, that satisfy an analogue of Menshov universal property in the following sense: $f$ is the Poisson transform of a…

For each integer $k \geq 2$, we introduce a sequence of $k$-ary discrete trees constructed recursively by choosing at each step an edge uniformly among the present edges and grafting on "its middle" $k-1$ new edges. When $k=2$, this…

We prove complex contraction for zero-free regions of counting weighted set cover problem in which an element can appear in an unbounded number of sets, thus obtaining fully polynomial-time approximation schemes(FPTAS) via Barvinok's…

We prove a analogous of Stein theorem for rational functions in several variables: we bound the number of reducible fibers by a formula depending on the degree of the fraction.

We generalize the concept of ascending and descending runs from permutations to rooted labelled trees and mappings, i.e., functions from the set $\{1, \dots, n\}$ into itself. A combinatorial decomposition of the corresponding functional…

We prove that the rescaled costs of partial match queries in a random two-dimensional quadtree converge almost surely towards a random limit which is identified as the terminal value of a martingale. Our approach shares many similarities…

In 1996, Bertoin and Werner [5] demonstrated a functional limit theorem, characterising the windings of pla- nar isotropic stable processes around the origin for large times, thereby complementing known results for planar Brownian mo- tion.…

The depth-bounded fragment of the pi-calculus is an expressive class of systems enjoying decidability of some important verification problems. Unfortunately membership of the fragment is undecidable. We propose a novel type system,…

The space requirements of an $m$-ary search tree satisfies a well-known phase transition: when $m\leq 26$, the second order asymptotics is Gaussian. When $m\geq 27$, it is not Gaussian any longer and a limit $W$ of a complex-valued…

We consider a family of general branching processes with reproduction parameters depending on the age of the individual as well as the population age structure and a parameter $K$, which may represent the carrying capacity. These processes…

We consider the biased random walk on a tree constructed from the set of finite self-avoiding walks on a lattice, and use it to construct probability measures on infinite self-avoiding walks. The limit measure (if it exists) obtained when…

The goal of these lectures is to survey some of the recent progress on the description of large-scale structure of random trees. We use the framework of Markov-Branching sequences of trees and discuss several applications.

We study inhomogeneous random graphs with a finite type space. For a natural generalization of the model as a dynamic network-valued process, the paper establishes the following results: (a) Functional central limit theorems for the…

In this paper, we study complex valued branching Brownian motion in the so-called glassy phase, or also called phase II. In this context, we prove a limit theorem for the complex partition function hence confirming a conjecture formulated…

In this paper, we consider a Banach space valued random coefficient autoregressive process. Our studies on this process involve existence, weak law of large numbers, strong law of large numbers, some exponential inequalities, central limit…

We analyse generating functions for trees and for connected subgraphs on the complete graph, and identify a single scaling profile which applies for both generating functions in a critical window. Our motivation comes from the analysis of…

The classical Matrix-Tree Theorem allows one to list the spanning trees of a graph by monomials in the expansion of the determinant of a certain matrix. We prove that in the case of three-graphs (that is, hypergraphs whose edges have…

In the paper we propose certain conditions, relatively easy to verify, which ensure the central limit theorem for some general class of Markov chains. To justify the usefulness of our criterion, we further verify it for a particular…

We derive a graph expansion for the thermal partition function of solvable two-dimensional models with boundaries. This expansion of the integration measure over the virtual particles winding around the time cycle is obtained with the help…