[Home ] [Archive]   [ فارسی ]  
:: Main :: About :: Current Issue :: Archive :: Search :: Submit :: Contact ::
Main Menu
Home::
Journal Information::
Articles archive::
For Authors::
For Reviewers::
Registration::
Contact us::
Site Facilities::
::
Search in website

Advanced Search
..
Receive site information
Enter your Email in the following box to receive the site news and information.
..
:: Volume 19, Issue 1 (6-2014) ::
Andishe 2014, 19(1): 35-38 Back to browse issues page
Degrees in $k$-minimal label random recursive trees
Mehri Javanian *
University of Zanjan
Abstract:   (6322 Views)

This article describes the limiting distribution of the degrees of nodes has been derived for a kind of random tree named

k-minimal label random recursive tree, as the size of the tree goes to infinity. The outdegree of the tree is equal to the number of customers in a pyramid marketing agency immediatly alluring
Keywords: tree, random recursive tree, asymptotic distribution
Full-Text [PDF 404 kb]   (2809 Downloads)    
Type of Study: Research | Subject: Special
Received: 2013/08/10 | Accepted: 2015/06/17 | Published: 2015/06/17
Send email to the article author

Add your comments about this article
Your username or Email:

CAPTCHA


XML   Persian Abstract   Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Javanian M. Degrees in $k$-minimal label random recursive trees. Andishe 2014; 19 (1) :35-38
URL: http://andisheyeamari.irstat.ir/article-1-251-en.html


Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Volume 19, Issue 1 (6-2014) Back to browse issues page
مجله اندیشه آماری Andishe _ye Amari
Persian site map - English site map - Created in 0.11 seconds with 37 queries by YEKTAWEB 4645