ISSN:1042-9832    

DOI:10.1002/rsa.3240050102

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1994

数据来源: WILEY

摘要:

AbstractA random recursive forest is defined as a union of random recursive trees. We find the expected number of trees in the uniform random recursive forest as well as the number of vertices of given degree, the maximum degree, the height of vertices, the order of branches, the root of the component containing a given vertex, and the last root of such forests. © 1994 John Wiley&Sons, Inc

ISSN:1042-9832    

DOI:10.1002/rsa.3240050103

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1994

数据来源: WILEY

摘要:

AbstractMeir and Moon studied the distribution of the maximum degree for simply generated families of trees. We have sharper results for the special case of labelled trees. © 1994 John Wiley&Sons, Inc

ISSN:1042-9832    

DOI:10.1002/rsa.3240050104

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1994

数据来源: WILEY

摘要:

AbstractWe show inGn.p' that the threshold for δ(G) ⩾ 1 is the threshold forG2–Gto be Hamiltonian. © 1994 John Wiley&Sons

ISSN:1042-9832    

DOI:10.1002/rsa.3240050105

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1994

数据来源: WILEY

摘要:

AbstractThis article deals with a quantification of the instability behavior of the slotted multiuser communication network system ALOHA. In (2) U. Schmid and the author could quantify the expected valueE(Y) of theinstability time Y= max (n: Xn= 0), whereXndenotes the backlog afternslots. Here it is shown thatYis approximately exponentially distributed. Moreover, uniform asymptotic expansions forym=P[Y=m] and for the momentsMm=E(Ym) are given. © 1994 John Wiley&Sons, Inc

ISSN:1042-9832    

DOI:10.1002/rsa.3240050106

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1994

数据来源: WILEY

摘要:

AbstractWe discuss the existence of multi‐colored trees in randomly colored, random graphs. © 1994 John Wiley&Sons, I

ISSN:1042-9832    

DOI:10.1002/rsa.3240050107

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1994

数据来源: WILEY

摘要:

AbstractAcyclic networks are represented by rooted treesTfrom a given simply generated family ℱ. Let ℱn,pbe the subset of ℱ containing all treesTwithnnodes andpleaves. Assume thatTis selected uniformly from ℱn,pand that each edge ofthas probabilityqof failing. LetZi= 1 if the path conecting the root ofTto the ith leaf does not contain a failed edge, O otherwise. We investigate the stochastic process (Zi,…,Zp). Asympototic results, manly for the family oftary trees, are derived. As auxiliary results, a general rotation lemma for simple families of trees is given, and the (joint) asymptotic leaf height destributions in tary trees determined. © 1994 John Wiley

ISSN:1042-9832    

DOI:10.1002/rsa.3240050108

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1994

数据来源: WILEY

摘要:

AbstractA random mapping (T; q) of a finite setV= {1, 2,…,n} into itself assigns independently to eachiϵVits unique imagej=TT(i)E Vwith probabilityqfori=jand with probability\documentclass{article}\pagestyle{empty}\begin{document}$ \frac{{1 - q}}{{n - 1}} $\end{document}forj≠i. The purpose of the article is to determine the asymptotic behaviour of the size of the largest connected component of the random digraphGT(q)representing thes mapping asn–x, regarding all possible values of the parameterq=q(n). © 1994 John Wiley&So

ISSN:1042-9832    

DOI:10.1002/rsa.3240050109

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1994

数据来源: WILEY

摘要:

AbstractIn the theory of random graphs, several classes of graphs occur that are exceptional cases in limit theorems for subgraph counts. The purpose of this article is to show the existence of graphs in one of these classes, by providing an explicit, computer generated, example. We also show that the class is closed under complementation. © 1994 John Wiley&Sons, Inc

ISSN:1042-9832    

DOI:10.1002/rsa.3240050110

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1994

数据来源: WILEY

摘要:

AbstractA 0‐balanced ordered three is an ordered tree all of whose root‐to‐leaf paths have the same length. In this article, we persent exact and asymptotic enumeration and distribution ersults for classes of 0‐balanced ordered trees withnnodes. These results enable us to compute various expected values of interesting parameters defined on these trees. © 1994 John Wiley&S

ISSN:1042-9832    

DOI:10.1002/rsa.3240050111

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1994

数据来源: WILEY