scholarly journals Annihilation and coalescence on binary trees

2014 ◽  
Vol 14 (03) ◽  
pp. 1350023 ◽  
Author(s):  
Itai Benjamini ◽  
Yuri Lima
Keyword(s):  
Dynamical System ◽  
Binary Tree ◽  
Limiting Distribution ◽  
Binary Trees ◽  
Probability Vector ◽  
Root Node ◽  
Fixed Probability

An infection spreads in a binary tree [Formula: see text] of height n as follows: initially, each leaf is either infected by one of k states or it is not infected at all. The infection state of each leaf is independently distributed according to a probability vector p = (p1, …, pk+1). The remaining nodes become infected or not via annihilation and coalescence: nodes whose two children have the same state (infected or not) are infected (or not) by this state; nodes whose two children have different states are not infected; nodes such that only one of the children is infected are infected by this state. In this paper we characterize, for every p, the limiting distribution at the root node of [Formula: see text] as n goes to infinity. We also consider a variant of the model when k = 2 and a mutation can happen, with a fixed probability q, at each infection step. We characterize, in terms of p and q, the limiting distribution at the root node of [Formula: see text] as n goes to infinity. The distribution at the root node is driven by a dynamical system, and the proofs rely on the analysis of this dynamics.

scholarly journals Left and right length of paths in binary trees or on a question of Knuth

2006 ◽  
Vol DMTCS Proceedings vol. AG,... (Proceedings) ◽  
Author(s):  
Alois Panholzer
Keyword(s):  
Binary Tree ◽  
Limiting Distribution ◽  
Binary Trees ◽  
Tree Model ◽  
Random Size ◽  
International Audience ◽  
Left And Right ◽  
The Common ◽  
The Difference ◽  
The Right

International audience We consider extended binary trees and study the common right and left depth of leaf $j$, where the leaves are labelled from left to right by $0, 1, \ldots, n$, and the common right and left external pathlength of binary trees of size $n$. Under the random tree model, i.e., the Catalan model, we characterize the common limiting distribution of the suitably scaled left depth and the difference between the right and the left depth of leaf $j$ in a random size-$n$ binary tree when $j \sim \rho n$ with $0< \rho < 1$, as well as the common limiting distribution of the suitably scaled left external pathlength and the difference between the right and the left external pathlength of a random size-$n$ binary tree.

scholarly journals Reducibility and Solvability of Some Classes of Kryuchkov Binary Tree Pairs

10.37236/2028 ◽  
2012 ◽  
Vol 18 (2) ◽  
Author(s):  
Maria Madonia ◽  
Giuseppe Scollo
Keyword(s):  
Induction Hypothesis ◽  
Binary Tree ◽  
Binary Trees ◽  
Equal Size ◽  
Future Research ◽  
Theoretic Approach ◽  
Research Directions ◽  
Open Questions ◽  
Future Research Directions

This paper addresses the problem of characterizing classes of pairs of binary trees of equal size for which a signed reassociation sequence, in the Eliahou-Kryuchkov sense, can be shown to exist, either with a size induction hypothesis (reducible pairs), or without it (solvable pairs). A few concepts proposed by Cooper, Rowland and Zeilberger, in the context of a language-theoretic approach to the problem, are here reformulated in terms of signed reassociation sequences, and some of their results are recasted and proven in this framework. A few strategies, tactics and combinations thereof for signed reassociation are introduced, which prove useful to extend the results obtained by the aforementioned authors to new classes of binary tree pairs. In particular, with reference to path trees, i.e. binary trees that have a leaf at every level, we show the reducibility of pairs where (at least) one of the two path trees has a triplication at the first turn below the top level, and we characterize a class of weakly mutually crooked path tree pairs that are neither reducible nor solvable by any previously known result, but prove solvable by appropriate reassociation strategies. This class also includes a subclass of mutually crooked path tree pairs. A summary evaluation of the achieved results, followed by an outline of open questions and future research directions conclude the paper.

Binary Trees and the n-Cutset Property

1991 ◽  
Vol 34 (1) ◽  
pp. 23-30 ◽  
Author(s):  
Peter Arpin ◽  
John Ginsburg
Keyword(s):  
Positive Integer ◽  
Partially Ordered Set ◽  
Binary Tree ◽  
Ordered Set ◽  
Maximal Chain ◽  
Binary Trees ◽  
Complete Binary Tree ◽  
Maximal Elements ◽  
Extremal Case ◽  
Result Theorem

AbstractA partially ordered set P is said to have the n-cutset property if for every element x of P, there is a subset S of P all of whose elements are noncomparable to x, with |S| ≤ n, and such that every maximal chain in P meets {x} ∪ S. It is known that if P has the n-cutset property then P has at most 2n maximal elements. Here we are concerned with the extremal case. We let Max P denote the set of maximal elements of P. We establish the following result. THEOREM: Let n be a positive integer. Suppose P has the n-cutset property and that |Max P| = 2n. Then P contains a complete binary tree T of height n with Max T = Max P and such that C ∩ T is a maximal chain in T for every maximal chain C of P. Two examples are given to show that this result does not extend to the case when n is infinite. However the following is shown. THEOREM: Suppose that P has the ω-cutset property and that |Max P| = 2ω. If P — Max P is countable then P contains a complete binary tree of height ω

A New SVM Multi-Class Classification Algorithm Based on Sample Scale and Distribution Area

2013 ◽  
Vol 712-715 ◽  
pp. 2529-2533
Author(s):  
Yu Ping Qin ◽  
Peng Da Qin ◽  
Shu Xian Lun ◽  
Yi Wang
Keyword(s):  
Binary Tree ◽  
Classification Performance ◽  
Classification Algorithm ◽  
Experimental Results ◽  
Leaf Node ◽  
Distribution Area ◽  
Root Node ◽  
Multi Class Classification

A new SVM multi-class classification algorithm is proposed. Firstly, the optimal binary tree is constructed by the scale and the distribution area of every class sample, and then the sub-classifiers are trained for every non-leaf node in the binary tree. For the sample to be classified, the classification is done from the root node until someone leaf node, and the corresponding class of the leaf node is the class of the sample. The experimental results show that the algorithm improves the classification precision and classification speed, especially in the situation that the sample scale is less but its distribution area is bigger, the algorithm can improve greatly the classification performance.

Color Quantization Based on Hierarchical Frequency Sensitive Competitive Learning

2010 ◽  
Vol 14 (4) ◽  
pp. 375-381
Author(s):  
Jun Zhang ◽  
◽  
Jinglu Hu
Keyword(s):  
Binary Tree ◽  
Competitive Learning ◽  
Tree Structure ◽  
Experimental Results ◽  
Color Quantization ◽  
Adaptive Procedure ◽  
Root Node ◽  
Binary Tree Structure

In this paper, we propose a Hierarchical Frequency Sensitive Competitive Learning (HFSCL) method to achieve Color Quantization (CQ). In HFSCL, the appropriate number of quantized colors and the palette can be obtained by an adaptive procedure following a binary tree structure with nodes and layers. Starting from the root node that contains all colors in an image until all nodes are examined by split conditions, a binary tree will be generated. In each node of the tree, a Frequency Sensitive Competitive Learning (FSCL) network is used to achieve two-way division. To avoid over-split, merging condition is defined to merge the clusters that are close enough to each other at each layer. Experimental results show that the proposed HFSCL has desired ability for CQ.

scholarly journals Connections on Valuated Binary Tree and Their Applications in Factoring Odd Integers

2021 ◽  
pp. 134-153
Author(s):  
Xingbo Wang ◽  
Jinfeng Luo ◽  
Ying Tian ◽  
Li Ma
Keyword(s):  
Binary Tree ◽  
Numerical Experiments ◽  
Mathematical Reasoning ◽  
Binary Trees ◽  
Integer Factorization ◽  
Parallel Connection ◽  
Central Lines ◽  
Factorization Problem ◽  
Integer Factorization Problem

This paper makes an investigation on geometric relationships among nodes of the valuated binary trees, including parallelism, connection and penetration. By defining central lines and distance from a node to a line, some intrinsic connections are discovered to connect nodes between different subtrees. It is proved that a node out of a subtree can penetrate into the subtree along a parallel connection. If the connection starts downward from a node that is a multiple of the subtree’s root, then all the nodes on the connection are multiples of the root. Accordingly composite odd integers on such connections can be easily factorized. The paper proves the new results with detail mathematical reasoning and demonstrates several numerical experiments made with Maple software to factorize rapidly a kind of big odd integers that are of the length from 59 to 99 decimal digits. It is once again shown that the valuated binary tree might be a key to unlock the lock of the integer factorization problem.

scholarly journals The Vertical Profile of Embedded Trees

10.37236/2150 ◽  
2012 ◽  
Vol 19 (3) ◽  
Author(s):  
Mireille Bousquet-Mélou ◽  
Guillaume Chapuy
Keyword(s):  
Binary Tree ◽  
Vertical Profile ◽  
Random Tree ◽  
Binary Trees ◽  
Number Of Children ◽  
Rooted Binary Tree

Consider a rooted binary tree with $n$ nodes. Assign with the root the abscissa 0, and with the left (resp. right) child of a node of abscissa $i$ the abscissa $i-1$ (resp. $i+1$). We prove that the number of binary trees of size $n$ having exactly $n_i$ nodes at abscissa $i$, for $l \leq i \leq r$ (with $n = \sum_i n_i$), is $$ \frac{n_0}{n_l n_r} {{n_{-1}+n_1} \choose {n_0-1}} \prod_{l\le i\le r \atop i\not = 0}{{n_{i-1}+n_{i+1}-1} \choose {n_i-1}}, $$ with $n_{l-1}=n_{r+1}=0$. The sequence $(n_l, \dots, n_{-1};n_0, \dots n_r)$ is called the vertical profile of the tree. The vertical profile of a uniform random tree of size $n$ is known to converge, in a certain sense and after normalization, to a random mesure called the integrated superbrownian excursion, which motivates our interest in the profile. We prove similar looking formulas for other families of trees whose nodes are embedded in $Z$. We also refine these formulas by taking into account the number of nodes at abscissa j whose parent lies at abscissa $i$, and/or the number of vertices at abscissa i having a prescribed number of children at abscissa $j$, for all $i$ and $j$. Our proofs are bijective.

scholarly journals Parallelizing DSW Trees

2019 ◽  
Author(s):  
Willard Stanley
Keyword(s):  
Binary Tree ◽  
Binary Trees ◽  
Processing Elements ◽  
Do So

A parallelization of the Day-Stout-Warren algorithm for balancing binary trees. As its input, this algorithm takes an arbitrary binary tree and returns an equivalent tree which is balanced so as to preserve the θ(log(n)) lookup time for elements of the tree. The sequential Day-Stout-Warren algorithm has a linear runtime and uses constant space. This new parallelization of the Day-Stout-Warren algorithm attempts to do the same while providing a speedup which is as near as possible to linear to the number of processing elements. Also, ideally it should do so in an online fashion, without blocking new reads, inserts, and deletes.

scholarly journals Design of Adaptive Compression Algorithm Elias Delta Code and Huffman

2018 ◽  
Author(s):  
Andysah Putera Utama Siahaan
Keyword(s):  
Data Compression ◽  
Binary Tree ◽  
Research Data ◽  
Input String ◽  
Binary Trees ◽  
Text File ◽  
Compression Process ◽  
Storage Media ◽  
Huffman Algorithm ◽  
Adaptive Compression

Compression aims to reduce data before storing or moving it into storage media. Huffman and Elias Delta Code are two algorithms used for the compression process in this research. Data compression with both algorithms is used to compress text files. These two algorithms have the same way of working. It starts by sorting characters based on their frequency, binary tree formation and ends with code formation. In the Huffman algorithm, binary trees are formed from leaves to roots and are called tree-forming from the bottom up. In contrast, the Elias Delta Code method has a different technique. Text file compression is done by reading the input string in a text file and encoding the string using both algorithms. The compression results state that the Huffman algorithm is better overall than Elias Delta Code.

scholarly journals Interval Tree and Its Application in Integer Factorization

2019 ◽  
Vol 11 (2) ◽  
pp. 103
Author(s):  
Xingbo WANG
Keyword(s):  
Binary Tree ◽  
Numerical Experiments ◽  
Simple Approach ◽  
Binary Trees ◽  
Integer Factorization ◽  
Interval Tree

The paper first puts forward a way to study odd integers by placing the odd integers in a given interval on a perfect full binary tree, then makes an investigation on the odd integers by means of combining the original properties of the integers with the properties of the binary trees and obtains several new results on how an odd integer&#39;s divisors distribute on a level of a binary tree. The newly discovered law of divisors&#39; distribution that includes common divisors between two symmetric nodes, genetic divisors between an ancestor node and its descendant node can provide a new and simple approach to factorize odd composite integers. Based on the mathematical deductions, numerical experiments are designed and demonstrated in the Maple software. All the results of the experiments are conformance to expectation and validate the validity of the approach.

Sign in / Sign up

Export Citation Format

Share Document