Related papers: Random affine code tree fractals and Falconer-Sloa…
It is argued that there are a set of orthonormal basis states, which appear as highly degenerate ground states arising from spontaneous symmetry breaking with a type-B Goldstone mode, and they are scale-invariant, with a salient feature…
We establish a variety of properties of the discrete time simple random walk on a Galton-Watson tree conditioned to survive when the offspring distribution, $Z$ say, is in the domain of attraction of a stable law with index…
We study, both with numerical simulations and theoretical methods, a cellular automata model for continuum equations describing growth processes in the presence of an external flux of particles. As a result of local instabilities we find a…
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 analyze the probability that a random m-dimensional linear subspace of R^n both intersects a regular closed convex cone C\subseteq R^n and lies within distance \alpha of an m-dimensional subspace not intersecting C (except at the…
The spin-4/3 fractional superstring is characterized by a chiral algebra involving a spin-4/3 current on the world-sheet in addition to the energy-momentum tensor. These currents generate physical state conditions on the fractional…
The uniform spanning forest (USF) in Z^d is the weak limit of random, uniformly chosen, spanning trees in [-n,n]^d. Pemantle proved that the USF consists a.s. of a single tree if and only if d <= 4. We prove that any two components of the…
Species tree reconstruction from genomic data is increasingly performed using methods that account for sources of gene tree discordance such as incomplete lineage sorting. One popular method for reconstructing species trees from unrooted…
Let $\tau$n be a random tree distributed as a Galton-Watson tree with geometric offspring distribution conditioned on {Zn = an} where Zn is the size of the n-th generation and (an, n $\in$ N *) is a deterministic positive sequence. We study…
At the present time reliably established that probability density functions of gene expression of microarray experiments possess a number of universal properties. First of all these distributions have power asymptotic and secondly the shape…
Billey et al. [arXiv:1507.04976] have recently discovered a surprisingly simple formula for the number $a_n(\sigma)$ of leaf-labelled rooted non-embedded binary trees (also known as phylogenetic trees) with $n\geq 1$ leaves, fixed (for the…
We explore the tree limits recently defined by Elek and Tardos. In particular, we find tree limits for many classes of random trees. We give general theorems for three classes of conditional Galton-Watson trees and simply generated trees,…
In this paper we consider affine iterated function systems in locally compact non-Archimedean field $\mathbb{F}$. We establish the theory of singular value composition in $\mathbb{F}$ and compute box and Hausdorff dimension of self-affine…
This paper extends the study of fringe trees in random plane trees with a given degree statistic. While previous work established the asymptotic normality of the count of fringe trees isomorphic to a fixed tree, we investigate the case…
We study the structure of trees minimizing their number of stable sets for given order $n$ and stability number $\alpha$. Our main result is that the edges of a non-trivial extremal tree can be partitioned into $n-\alpha$ stars, each of…
We prove some asymptotic results for the radius and the profile of large random rooted planar maps with faces of arbitrary degrees. Using a bijection due to Bouttier, Di Francesco and Guitter between rooted planar maps and certain four-type…
It is shown that the problem of computing the Strahler number of a binary tree given as a term is complete for the circuit complexity class uniform $\mathsf{NC}^1$. For several variants, where the binary tree is given by a pointer structure…
We present a graph theoretical approach to the configurational statistics of random tree-like objects, such as randomly branching polymers. In particular, for ideal trees we show that Pr\"ufer labelling provides: (i) direct access to the…
Using well-known results from statistical physics, concerning the almost-sure behavior of the free energy of directed polymers in a random medium, we prove that random tree codes achieve the distortion-rate function almost surely under a…
The list-decodability of random linear rank-metric codes is shown to match that of random rank-metric codes. Specifically, an $\mathbb{F}_q$-linear rank-metric code over $\mathbb{F}_q^{m \times n}$ of rate $R =…