Related papers: Statistical Properties of the Rooted-Tree Encoding…
We study a model of growing planar tree graphs where in each time step we separate the tree into two components by splitting a vertex and then connect the two pieces by inserting a new link between the daughter vertices. This model…
We consider an infinite sequence of rooted trees naturally emerging in a number-theoretical context. We advance some ideas on its structure by discussing some elementary properties. Some of those properties are shown to be related to…
Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…
We present a simple structure based model of how words are formed from morphemes. The model explains two major empirical facts: the typical distribution of word lengths and the appearance of Zipf like rank frequency curves. In contrast to…
Combinatorial classes T that are recursively defined using combinations of the standard multiset, sequence, directed cycle and cycle constructions, and their restrictions, have generating series T(z) with a positive radius of convergence;…
We study (plane) tree-valued Markov chains $(T_n,n \geq 1)$ with uniform backward dynamics and show that they can be obtained by sampling from a real tree. As non--plane trees, every such Markov chain is represented by a weighted real tree.…
The subject of pattern avoiding permutations has its roots in computer science, namely in the problem of sorting a permutation through a stack. A formula for the number of permutations of length n that can be sorted by passing it twice…
Languages across the world exhibit Zipf's law of abbreviation, namely more frequent words tend to be shorter. The generalized version of the law - an inverse relationship between the frequency of a unit and its magnitude - holds also for…
Consider a uniformly sampled random $d$-regular graph on $n$ vertices. If $d$ is fixed and $n$ goes to $\infty$ then we can relate typical (large probability) properties of such random graph to a family of invariant random processes (called…
We inspect the deductive connection between the neural scaling law and Zipf's law -- two statements discussed in machine learning and quantitative linguistics. The neural scaling law describes how the cross entropy rate of a foundation…
We construct an explicit Hopf algebra isomorphism from the algebra of heap-ordered trees to that of quasi-symmetric functions, generated by formal permutations, which is a lift of the natural projection of the Connes-Kreimer algebra of…
In this paper, we redesign and simplify an algorithm due to Remy et al. for the generation of rooted planar trees that satisfies a given partition of degrees. This new version is now optimal in terms of random bit complexity, up to a…
Based on the Connes--Kreimer Hopf algebra of rooted trees, the rooted tree maps are defined as linear maps on noncommutative polynomial algebra in two indeterminates. It is known that they induce a large class of linear relations for…
A novel approach to automated learning of syntactic rules governing natural languages is proposed, based on using probabilities assigned to sentences (and potentially longer word sequences) by transformer neural network language models to…
We show that textual analysis of microbial genomes reveal telling footprints of the early evolution of the genomes. The frequencies of word occurrence of random DNA sequences considered as texts in their four nucleotides are expected to…
There are different ways of measuring diversity in complex systems. In particular, in language, lexical diversity is characterized in terms of the type-token ratio and the word entropy. We here investigate both diversity metrics in six…
The study describes a class of integer labelings of the Fibonacci tree, the tree of descent introduced by Fibonacci. In these labelings, Fibonacci sequences appear along ascending branches of the tree, and it is shown that the labels at any…
The United States Code (Code) is an important source of Federal law that is produced by the interactions of many heterogeneous actors in a complex, dynamic space. The Code can be represented as the union of a hierarchical network and a…
We study the growth of a time-ordered rooted tree by probabilistic attachment of new vertices to leaves. We construct a likelihood function of the leaves based on the connectivity of the tree. We take such connectivity to be induced by the…
Standard sequential generation methods assume a pre-specified generation order, such as text generation methods which generate words from left to right. In this work, we propose a framework for training models of text generation that…