相关论文: A Conjecture on the Collatz-Kakutani Path Length f…

In the first part of this paper I give an elementary overview about some number sequences which count various sorts of lattice paths in strips along the x-axis and compute their generating functions in terms of Fibonacci and Lucas…

The problem of how to estimate diffusion on a graph effectively is of importance both theoretically and practically. In this paper, we make use of two widely studied indices, geodesic distance and mean first-passage time ($MFPT$) for random…

The evolving Kingman coalescent is the tree-valued process which records the time evolution undergone by the genealogies of Moran populations. We consider the associated process of total external tree length of the evolving Kingman…

Tropical geometry with the max-plus algebra has been applied to statistical learning models over tree spaces because geometry with the tropical metric over tree spaces has some nice properties such as convexity in terms of the tropical…

We construct a stationary random tree, embedded in the upper half plane, with prescribed offspring distribution and whose vertices are the atoms of a unit Poisson point process. This process which we call Hammersley's tree process extends…

In this paper, we propose a class of growth models, named Fibonacci trees $F(t)$, with respect to the intrinsic advantage of Fibonacci sequence $\{F_{t}\}$. First, we turn out model $F(t)$ to have power-law degree distribution with exponent…

In this paper, we make a conjecture (conjecture 1) related to the Bateman-Horn conjecture and proceed to study the roots of $x^2+1$ and $x^2+2$ to prime moduli, assuming the truth of the Bateman-Horn conjecture and conjecture 1 and using…

We provide formulas for generating functions of many types of paths in various rooted tree structures. We compute the $k$th moment of the generating functions for various types of vertical paths. In two specific familes of trees we find…

A well-established model for the genealogy of a large population in equilibrium is Kingman's coalescent. For the population together with its genealogy evolving in time, this gives rise to a time-stationary tree-valued process. We study the…

The Collatz conjecture, which posits that any positive integer will eventually reach 1 through a specific iterative process, is a classic unsolved problem in mathematics. This research focuses on designing an efficient algorithm to compute…

The aim of this paper is to provide an affirmative answer to a recent question by Bubeck and Linial on the local profile of trees. For a tree $T$, let $p^{(k)}_1(T)$ be the proportion of paths among all $k$-vertex subtrees (induced…

Phylogenetic trees represent the evolutionary relationships between extant lineages, where extinct or non-sampled lineages are omitted. Extending the work of Stadler and collaborators, this paper focuses on the branch lengths in…

We study effective randomness-preserving transformations of path-incompressible trees. Some path-incompressible trees with infinitely many paths do not compute perfect path-random trees with computable oracle-use. Sparse perfect…

A natural partial order on the set of prime numbers was derived by the author from the internal symmetries of the primary finite fields, independently of Ford a.a., who investigated Pratt trees for primality tests. It leads to a…

Consider $n$ points evenly spaced on a circle, and a path of $n-1$ chords that uses each point once. There are $m=\lfloor n/2\rfloor$ possible chord lengths, so the path defines a multiset of $n-1$ elements drawn from $\{1,2,\ldots,m\}$.…

A tree is pathwise-random if all of its paths are Martin-Lof random. We show that (a) no weakly 2-random real computes a perfect pathwise-random tree; it follows that the class of perfect pathwise-random trees is null, with respect to any…

We consider a random tree and introduce a metric in the space of trees to define the ``mean tree'' as the tree minimizing the average distance to the random tree. When the resulting metric space is compact we have laws of large numbers and…

The Collatz map is defined for a positive even integer as half that integer, and for a positive odd integer as that integer threefold, plus one. The Collatz conjecture states that when the map is iterated the number one is eventually…

We offer a unified approach to the theory of concave majorants of random walks by providing a path transformation for a walk of finite length that leaves the law of the walk unchanged whilst providing complete information about the concave…

There is a deep connection between permutations and trees. Certain sub-structures of permutations, called sub-permutations, bijectively map to sub-trees of binary increasing trees. This opens a powerful tool set to study enumerative and…