Note on the exponential recursive k -ary trees

In the present paper, we consider exponential recursive trees with no node of outdegree greater than k , called exponential recursive k -ary trees ( k ≥ 2). At each step of growing of these trees, every external node (insertion position) is changed into a leaf with probability p , or fails to do so...

Full description

Saved in:
Bibliographic Details
Published inRAIRO. Informatique théorique et applications Vol. 57; p. 5
Main Authors Ghasemi, Mina, Javanian, Mehri, Nabiyyi, Ramin Imany
Format Journal Article
LanguageEnglish
Published 2023
Online AccessGet full text
ISSN0988-3754
2804-7346
DOI10.1051/ita/2023003

Cover

Abstract In the present paper, we consider exponential recursive trees with no node of outdegree greater than k , called exponential recursive k -ary trees ( k ≥ 2). At each step of growing of these trees, every external node (insertion position) is changed into a leaf with probability p , or fails to do so with probability 1 — p . We investigate limiting behavior of fundamental parameters such as size, leaves and distances in exponential recursive k -ary trees.
AbstractList In the present paper, we consider exponential recursive trees with no node of outdegree greater than k , called exponential recursive k -ary trees ( k ≥ 2). At each step of growing of these trees, every external node (insertion position) is changed into a leaf with probability p , or fails to do so with probability 1 — p . We investigate limiting behavior of fundamental parameters such as size, leaves and distances in exponential recursive k -ary trees.
Author Javanian, Mehri
Ghasemi, Mina
Nabiyyi, Ramin Imany
Author_xml – sequence: 1
  givenname: Mina
  surname: Ghasemi
  fullname: Ghasemi, Mina
– sequence: 2
  givenname: Mehri
  orcidid: 0000-0002-5737-3663
  surname: Javanian
  fullname: Javanian, Mehri
– sequence: 3
  givenname: Ramin Imany
  surname: Nabiyyi
  fullname: Nabiyyi, Ramin Imany
BookMark eNotj01LAzEYhIO04Lb15B_IXdK-b752c5TiFxS99L5k03dxte6WJIr-eyN2DjMwh2GeBZuN00iMXSOsEQxuhuw3EqQCUBeskg1oUSttZ6wC1zRC1UZfskVKbwCARRVbP0-Z-DTy_Eqcvk9lb8yDP_JI4TOm4Yv4Oxc-_vAcidKKzXt_THR1ziXb39_tt49i9_LwtL3diYAOswiyC50qbrpAnZM29I3RunTUHNCFg6xRBY1kjXfWAbjOGy2txXIMglqym__ZEKeUIvXtKQ4f5UWL0P6RtoW0PZOqX-fkR0k
Cites_doi 10.1016/j.ipl.2005.11.020
10.22541/au.170669522.27528311/v1
10.1007/s11009-017-9578-z
10.1007/s11009-020-09831-9
10.1002/rsa.10010
10.1007/BF02679611
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.1051/ita/2023003
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 2804-7346
ExternalDocumentID 10_1051_ita_2023003
GroupedDBID --K
-E.
-~X
.DC
.FH
0E1
123
1B1
4.4
5VS
74X
74Y
7~V
8FE
8FG
AADXX
AAOGA
AAOTM
AAYXX
ABGDZ
ABKKG
ABNSH
ABUBZ
ABZDU
ACACO
ACGFS
ACIMK
ACIWK
ACQPF
ACRPL
ACZPN
ADNMO
AEMTW
AFAYI
AFHSK
AFUTZ
AGQPQ
AJPFC
ALMA_UNASSIGNED_HOLDINGS
ARABE
AZPVJ
BPHCQ
C0O
CITATION
CS3
DC4
EBS
EJD
FAM
HG-
HST
HZ~
I.6
IHE
IL9
I~P
J36
J38
J3A
K6V
L6V
L98
LO0
M-V
M41
NQ-
O9-
OAV
P62
PQQKQ
PROAC
RCA
ROL
RPZ
RR0
S6-
VH1
WQ3
WXU
ID FETCH-LOGICAL-c191t-c2bcb3c2b5bceb926cf8544cb3e8d19cd2713c41e65a969009ba5426610000c3
ISSN 0988-3754
IngestDate Wed Oct 01 02:00:58 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
License https://creativecommons.org/licenses/by/4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c191t-c2bcb3c2b5bceb926cf8544cb3e8d19cd2713c41e65a969009ba5426610000c3
ORCID 0000-0002-5737-3663
ParticipantIDs crossref_primary_10_1051_ita_2023003
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2023-00-00
PublicationDateYYYYMMDD 2023-01-01
PublicationDate_xml – year: 2023
  text: 2023-00-00
PublicationDecade 2020
PublicationTitle RAIRO. Informatique théorique et applications
PublicationYear 2023
References R2
Aguech (R1) 2021; 7
R3
R6
R7
Javanian (R5) 2006; 98
R9
Neininger (R8) 2001; 19
Smythe (R10) 1995; 51
Feng (R4) 2018; 20
References_xml – volume: 7
  start-page: 16
  year: 2021
  ident: R1
  publication-title: Methodol. Comput. Appl. Probab.
– volume: 98
  start-page: 115
  year: 2006
  ident: R5
  publication-title: Inf. Process. Lett.
  doi: 10.1016/j.ipl.2005.11.020
– ident: R6
  doi: 10.22541/au.170669522.27528311/v1
– ident: R2
– volume: 20
  start-page: 575
  year: 2018
  ident: R4
  publication-title: Methodol Comput. Appl. Probab.
  doi: 10.1007/s11009-017-9578-z
– ident: R3
– ident: R7
  doi: 10.1007/s11009-020-09831-9
– volume: 19
  start-page: 498
  year: 2001
  ident: R8
  publication-title: Random Struct. Algor.
  doi: 10.1002/rsa.10010
– ident: R9
  doi: 10.1007/BF02679611
– volume: 51
  start-page: 1
  year: 1995
  ident: R10
  publication-title: Theory Probab. Math. Stat.
SSID ssj0001111
ssib053799672
ssib050737228
ssib050964962
Score 2.2740314
Snippet In the present paper, we consider exponential recursive trees with no node of outdegree greater than k , called exponential recursive k -ary trees ( k ≥ 2). At...
SourceID crossref
SourceType Index Database
StartPage 5
Title Note on the exponential recursive k -ary trees
Volume 57
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAHI
  databaseName: EDP Open
  customDbUrl:
  eissn: 2804-7346
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssib050964962
  issn: 0988-3754
  databaseCode: GI~
  dateStart: 19740101
  isFulltext: true
  titleUrlDefault: https://www.edp-open.org/
  providerName: EDP
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2804-7346
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssib050737228
  issn: 0988-3754
  databaseCode: M~E
  dateStart: 19990101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVPQU
  databaseName: ProQuest Technology Collection
  customDbUrl:
  eissn: 2804-7346
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0001111
  issn: 0988-3754
  databaseCode: 8FG
  dateStart: 20080101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/technologycollection1
  providerName: ProQuest
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3da9swEBdZ97I9jH2yrdvQQ_cUlNr6sOKXQQnL2kI7CBn0LViyQk2JU1J3tPvrdyfJjjfy0O1FmMOWsO98-ul09xMhB6ZQhdJCsaVQOZNlyVm-zJZMKqONthwPFsBsi_Ps-Ic8vVAXg8GXXtbSbWNG9tfOupL_0SrIQK9YJfsPmu06BQFcg36hBQ1D-yAdn69xkz8kKrq763WNqT-eqd9iEOCnG14NGabF4dbzTR-Hzo5OZt9Hw1iM1HgSV-jl82QC0HK9CaSunnH8z6AeZupcwsS3qkLOfd159dMCMHkVwqln7nJTdWHmwlT39_7-WbGq6uHJqnVAMdoQSoHbgCF8fTwwN8wcXsbHiWRaxCBi9KeBcDo6RLXTTYMngG9bIT6e4ihJIrbzUbsH_9c01SUP-m1zlS7g8UV8-BF5zDEeg0wB02-tPwGoKzTfLq-Q6UbmW3pEJTSs9vSWbgynD8_NGN801nPCYIcw2GEcrIdgelBk_pw8i2sIehQM4gUZuPoleXrWEfDevCIjNA26rinIaM80aGca9IqiaVBvGq_JfPp1Pjlm8WgMZmGB3TDLjTUCWmWsMznP7HKspASZG5dpbkuuU2Fl6jJV5FkOQBp-Sg_GEKBY8Ybs1TDyW0JLnhRGQi9laqVLU5MUKXI0jrVF8kb3jhy0b7u4DgQoix0aeP-w2_bJE7wKMawPZK_Z3LqPgOoa88mr7jfNAEa8
linkProvider ProQuest
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Note+on+the+exponential+recursive+k+-ary+trees&rft.jtitle=RAIRO.+Informatique+the%CC%81orique+et+applications&rft.au=Ghasemi%2C+Mina&rft.au=Javanian%2C+Mehri&rft.au=Nabiyyi%2C+Ramin+Imany&rft.date=2023&rft.issn=0988-3754&rft.eissn=2804-7346&rft.volume=57&rft.spage=5&rft_id=info:doi/10.1051%2Fita%2F2023003&rft.externalDBID=n%2Fa&rft.externalDocID=10_1051_ita_2023003
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0988-3754&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0988-3754&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0988-3754&client=summon