๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Branching processes, random trees, and a generalized scheme of arrangements of particles

โœ Scribed by V. F. Kolchin

Publisher
SP MAIK Nauka/Interperiodica
Year
1977
Tongue
English
Weight
611 KB
Volume
21
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

How to Get a Perfectly Random Sample fro
How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
โœ James Gary Propp; David Bruce Wilson ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 793 KB

A general problem in computational probability theory is that of generating a random sample from the state space of a Markov chain in accordance with the steady-state probability law of the chain. Another problem is that of generating a random spanning tree of a graph or spanning arborescence of a d

A generalized treatment of segment densi
A generalized treatment of segment densities in linear and branched random-flight chains
โœ Santosh K. Gupta; Anil Kumar; W.C. Forsman ๐Ÿ“‚ Article ๐Ÿ“… 1976 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 298 KB

A new, generalized formulation is presented for the density of segments about the center of mass in random-flight chains having branched architectures. Numerical results axe obtained for linear chains and it is observed that the results attain the asymptotic limit for n = 01 in the same way as the d