𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Random polytopes: Their definition, generation and aggregate properties

✍ Scribed by Jerrold H. May; Robert L. Smith

Publisher
Springer-Verlag
Year
1982
Tongue
English
Weight
800 KB
Volume
24
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Generalized random recursive constructio
Generalized random recursive constructions and geometric properties of random fractals
✍ Yan-Yan Liu; Zhi-Ying Wen; Jun Wu πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 184 KB

## Abstract We study random recursive constructions in which the contracting vectors have different distributions at different stages. With such constructions, the one parameter family of martingales are introduced and the probabilistic behaviours of the limit random objects (not identically distri

Generalized Transition Waves and Their P
Generalized Transition Waves and Their Properties
✍ Henri Berestycki; FranΓ§ois Hamel πŸ“‚ Article πŸ“… 2012 πŸ› John Wiley and Sons 🌐 English βš– 428 KB

## Abstract In this paper, we generalize the usual notions of waves, fronts, and propagation speeds in a very general setting. These new notions, which cover all usual situations, involve uniform limits, with respect to the geodesic distance, to a family of hypersurfaces that are parametrized by ti

Some properties of Bernoulli polynomials
Some properties of Bernoulli polynomials and their generalizations
✍ Da-Qian Lu πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 220 KB

In this work, we investigate some well-known and new properties of the Bernoulli polynomials and their generalizations by using quasi-monomial, lowering operator and operational methods. Some of these general results can indeed be suitably specialized in order to deduce the corresponding properties

Generalized factorizations of words and
Generalized factorizations of words and their algorithmic properties
✍ Juhani KarhumΓ€ki; Wojciech Plandowski; Wojciech Rytter πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 837 KB

We formalize the notion of a factorization of a word, a so-called S-factorization, introduced in [7] when solving some open problems on word equations. We show that most of the factorizations considered in the literature fit well into that framework, and in particular that central algorithmic proble