Related papers: Watermelons on the half-plane
We consider the asymptotics of various estimators based on a large sample of branching trees from a critical multi-type Galton-Watson process, as the sample size increases to infinity. The asymptotics of additive functions of trees, such as…
We develop the complex-analytic viewpoint on the tree convolutions studied by the second author and Weihua Liu in "An operad of non-commutative independences defined by trees" (Dissertationes Mathematicae, 2020, doi:10.4064/dm797-6-2020),…
We show that, on a $d-$dimensional hypercubic lattice with $d>1$, conserved-mass transport processes, with {\it multidirectional} hopping that respect all symmetries of the lattice, exhibit power-law correlations for generic parameter…
Random-cluster measures on infinite regular trees are studied in conjunction with a general type of `boundary condition', namely an equivalence relation on the set of infinite paths of the tree. The uniqueness and non-uniqueness of…
These expository notes are centered around the circular law theorem, which states that the empirical spectral distribution of a nxn random matrix with i.i.d. entries of variance 1/n tends to the uniform law on the unit disc of the complex…
We perform an exact and asymptotic analysis of the model of $n$ vicious walkers interacting with a wall via contact potentials, a model introduced by Brak, Essam and Owczarek. More specifically, we study the partition function of watermelon…
In discrete planar last passage percolation (LPP), random values are assigned independently to each vertex in $\mathbb Z^2$, and each finite upright path in $\mathbb Z^2$ is ascribed the weight given by the sum of values of its vertices.…
We show that two semi-infinite positive temperature polymers coalesce on the scale predicted by KPZ (Kardar-Parisi-Zhang) universality. The two polymer paths have the same asymptotic direction and evolve in the same environment,…
We introduce in this paper two dimensional lattice models whose continuum limit belongs to the $N=2$ series. The first kind of model is integrable and obtained through a geometrical reformulation, generalizing results known in the $k=1$…
We discuss various forms of convergence of the vicinity of a uniformly at random selected vertex in random simply generated trees, as the size tends to infinity. For the standard case of a critical Galton-Watson tree conditioned to be large…
We study random unrooted plane trees with $n$ vertices sampled according to the weights corresponding to the vertex-degrees. Our main result shows that if the generating series of the weights has positive radius of convergence, then this…
We consider the simple random walk on Galton-Watson trees with supercritical offspring distribution, conditioned on non-extinction. In case the offspring distribution has finite support, we prove an upper bound for the annealed return…
We study the support (i.e. the set of visited sites) of a t step random walk on a two-dimensional square lattice in the large t limit. A broad class of global properties M(t) of the support is considered, including, e.g., the number S(t) of…
We report a two-step density-matrix renormalization-group computation of the equal-time single-particle Green's function, the density-density correlations, and the low-frequency spectral weight function of a spinless fermion model in an…
For different reversible Markov kernels on finite state spaces, we look for families of probability measures for which the time evolution almost remains in their convex hull. Motivated by signal processing problems and metastability studies…
Branched polymers can be classified into two categories that obey the different formulae: \begin{equation} \nu= \begin{cases} \hspace{1mm}\displaystyle\frac{2(1+\nu_{0})}{d+2} & \hspace{3mm}\mbox{for polymers…
A general formulation is presented for continuum scaling limits of stochastic spanning trees. A spanning tree is expressed in this limit through a consistent collection of subtrees, which includes a tree for every finite set of endpoints in…
Inspired by Stufler's recent probabilistic proof of Otter's asymptotic number of unlabeled trees, we revisit work of Palmer and Schwenk, and study unlabeled forests from a probabilistic point of view. We show that the number of trees in a…
We analyze the eigenvalues of the adjacency matrices of a wide variety of random trees. Using general, broadly applicable arguments based on the interlacing inequalities for the eigenvalues of a principal submatrix of a Hermitian matrix and…
We consider $N\times N$ symmetric or hermitian random matrices with independent, identically distributed entries where the probability distribution for each matrix element is given by a measure $\nu$ with a subexponential decay. We prove…