English
Related papers

Related papers: Connecting Yule Process, Bisection and Binary Sear…

200 papers

We study a random tree, which was introduced by Ajazi et al. as part of a model of a neuronal network. Realising a scaling relation for the law of the tree, we can use elementary techniques to derive asymptotic results on the geometry as…

Probability · Mathematics 2024-06-25 Lukas Schoug

The Yule branching process is a classical model for the random generation of gene tree topologies in population genetics. It generates binary ranked trees -- also called "histories" -- with a finite number $n$ of leaves. We study the…

Probability · Mathematics 2022-08-10 Filippo Disanto , Michael Fuchs

Binary trait data record the presence or absence of distinguishing traits in individuals. We treat the problem of estimating ancestral trees with time depth from binary trait data. Simple analysis of such data is problematic. Each homology…

Methodology · Statistics 2009-08-31 Geoff K. Nicholls , Russell D. Gray

We study Bessel processes on Weyl chambers of types A and B on $\mathbb R^N$. Using elementary symmetric functions, we present several space-time-harmonic functions and thus martingales for these processes $(X_t)_{t\ge0}$ which are…

Probability · Mathematics 2019-08-30 Miklos Kornyik , Michael Voit , Jeannette H. C. Woerner

This paper introduces a new combinatorial framework for modeling the growth of binary trees through a discrete evolution process that incorporates a growing rule and an extinction rule. Building upon the theory of increasingly labeled…

Combinatorics · Mathematics 2026-03-30 Olivier Bodini , Antoine Genitrini , Khaydar Nurligareev

As a unification of increasing trees and plane trees, the weakly increasing trees labeled by a multiset was introduced by Lin-Ma-Ma-Zhou in 2021. Motived by some symmetries in plane trees proved recently by Dong, Du, Ji and Zhang, we…

Combinatorics · Mathematics 2025-02-14 Yang Li , Zhicong Lin

We use the abstract method of (local) martingale problems in order to give criteria for convergence of stochastic processes. Extending previous notions, the formulation we use is neither restricted to Markov processes (or semimartingales),…

Probability · Mathematics 2021-08-27 David Criens , Peter Pfaffelhuber , Thorsten Schmidt

This paper investigates two involutions on binary trees. One is the mirror symmetry of binary trees which combined with the classical bijection $\varphi$ between binary trees and plane trees answers an open problem posed by Bai and Chen.…

Combinatorics · Mathematics 2023-09-13 Yang Li , Zhicong Lin , Tongyuan Zhao

It has been suggested that a Random Tree Puzzle (RTP) process leads to a Yule-Harding (YH) distribution, when the number of taxa becomes large. In this study, we formalize this conjecture, and we prove that the two tree distributions…

Populations and Evolution · Quantitative Biology 2012-08-10 Sha Zhu , Mike Steel

We develop a new bijective framework for the enumeration of bipartite planar maps with control on the degree distribution of black and white vertices. Our approach builds on the blossoming-tree paradigm, introducing a family of orientations…

Combinatorics · Mathematics 2025-11-07 Marie Albenque , Laurent Ménard , Nicolas Tokka

Diversification is nested, and early models suggested this could lead to a great deal of evolutionary redundancy in the Tree of Life. This result is based on a particular set of branch lengths produced by the common coalescent, where…

Populations and Evolution · Quantitative Biology 2011-08-02 Arne Mooers , Olivier Gascuel , Tanja Stadler , Heyang Li , Mike Steel

This article presents new bijections on planar maps. At first a bijection is established between bipolar orientations on planar maps and specific "transversal structures" on triangulations of the 4-gon with no separating 3-cycle, which are…

Combinatorics · Mathematics 2009-03-20 Eric Fusy

Ge, Rusjan, and Zweifel (J. Stat. Phys. 59, 1265 (1990)) introduced a binary tree which represents all the periodic windows in the chaotic regime of iterated one-dimensional unimodal maps. We consider the scaling behavior in a modified tree…

chao-dyn · Physics 2009-10-22 Jukka A. Ketoja , Juhani Kurkijarvi

Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our…

Combinatorics · Mathematics 2020-07-21 Stefan Felsner , Clemens Huemer , Sarah Kappes , David Orden

This paper is devoted to a systematic study of a class of binary trees encoding the structure of rational numbers both from arithmetic and dynamical point of view. The paper is divided into two parts. The first one is a critical review of…

Dynamical Systems · Mathematics 2008-05-16 Claudio Bonanno , Stefano Isola

The contextuality problem connected with existence of joint probability distribution creating all the given marginals is studied. It is shown for several examples considered previously in literature that there exist some new solutions for…

Quantum Physics · Physics 2014-04-29 A. A. Strakhov , V. I. Man'ko

The purpose of the present work is twofold. First, we develop the theory of general self-similar growth-fragmentation processes by focusing on martingales which appear naturally in this setting and by recasting classical results for…

Probability · Mathematics 2017-12-13 Jean Bertoin , Timothy Budd , Nicolas Curien , Igor Kortchemski

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…

Probability · Mathematics 2007-05-23 Geoffrey Grimmett , Svante Janson

In this paper we introduce a variation on the multidimensional segment tree, formed by unifying different interpretations of the dimensionalities of the data structure. We give some new definitions to previously well-defined concepts that…

Computational Geometry · Computer Science 2013-02-28 David P. Wagner

We revisit the classical problem of searching in a binary search tree (BST) using rotations, and present novel connections of this problem to a number of geometric and combinatorial structures. In particular, we show that the execution…

Data Structures and Algorithms · Computer Science 2016-03-29 László Kozma , Thatchaphol Saranurak