Related papers: Occupied corners in tree-like tableaux
The partially asymmetric exclusion process (PASEP) is an important model from statistical mechanics which describes a system of interacting particles hopping left and right on a one-dimensional lattice of N sites. It is partially asymmetric…
Consider a uniform random rooted tree on vertices labelled by $[n] = \{1,2,\ldots,n\}$, with edges directed towards the root. We imagine that each node of the tree has space for a single car to park. A number $m \le n$ of cars arrive one by…
Given two messages - as linear sequences of letters, it is immediate to determine whether one can be transformed into the other by simple substitution cipher of the letters. On the other hand, if the letters are carried as labels on nodes…
This paper presents a unified approach to parsing, in which top-down, bottom-up and left-corner parsers are related to preorder, postorder and inorder tree traversals. It is shown that the simplest bottom-up and left-corner parsers are left…
There is a close connection between intersections of Brownian motion paths and percolation on trees. Recently, ideas from probability on trees were an important component of the multifractal analysis of Brownian occupation measure, in joint…
A double-arborescence is a treelike comparability graph with an all-adjacent vertex. In this paper, we first give a forbidden induced subgraph characterization of double-arborescences, where we prove that double-arborescences are precisely…
We consider random binary trees that appear as the output of certain standard algorithms for sorting and searching if the input is random. We introduce the subtree size metric on search trees and show that the resulting metric spaces…
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…
Consider the d-dimensional lattice Z^d where each vertex is ``open'' or ``closed'' with probability p or 1-p, respectively. An open vertex v is connected by an edge to the closest open vertex w such that the dth co-ordinates of v and w…
Motivated by the continuing interest in the tree data model, we study the expressive power of downward navigational query languages on trees and chains. Basic navigational queries are built from the identity relation and edge relations…
The purpose of this paper is to analyze certain statistics of a recently introduced non-uniform random tree model, biased recursive trees. This model is based on constructing a random tree by establishing a correspondence with non-uniform…
We study once-excited random walks on general trees, modeled by placing a single "cookie" at each vertex. Each cookie acts as a metaphorical reward that is consumed upon the first visit to the vertex where the cookie is placed. On that…
Let $T(n,m)$ be the set of all plane labelled bipartite trees with $n$ white vertices and $m$ black. If the number $n+m$ of vertices is even, then the set $T(n,m)$ is a union of two disjoint subsets --- subset od "even" trees and subset 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…
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as splay trees, can achieve this property in the amortized sense,…
A central question in cognitive science is whether conceptual representations converge onto a shared manifold to support generalization, or diverge into orthogonal subspaces to minimize task interference. While prior work has discovered…
A new tree model is introduced based on ordered trees, by distinguishing exactly one child of each node that \emph{has} children. The basic enumeration leads to a cubic equation of the generating function. The extraction of its coefficients…
In this paper, we study a regular rooted coloured tree with random labels assigned to its edges, where the distribution of the label assigned to an edge depends on the colours of its endpoints. We obtain some new results relevant to this…
Imagine being able to ask questions to a black box model such as "Which adversarial examples exist?", "Does a specific attribute have a disproportionate effect on the model's prediction?" or "What kind of predictions could possibly be made…
Coverings of the Riemann sphere by itself, ramified over two points, are given by so-called Shabat polynomials. The correspondence between Grothendieck's dessins d'enfants and Belyi maps then implies a bijection between Shabat polynomials…