Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Kolchin V.F. — Random Mappings
Kolchin V.F. — Random Mappings



Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Random Mappings

Автор: Kolchin V.F.

Аннотация:

Historically, there has always been a close connection between Probability Theory and Combinatorial Problems. As more sophisticated techniques have become available in Probability Theory, it has become possible to use such methods in answering some of the more complex questions arising in the study of Combinatorial Systems. The recent growth in computer science has increased the interest in certain combinatorial problems. This book, which uses probabilistic methods to study some difficult combinatorial questions, will be of great interest to those who deal with Combinatorial Structures.


Язык: en

Рубрика: Математика/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 1986

Количество страниц: 206

Добавлена в каталог: 18.11.2009

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Attracting center      197
Attracting center, single      197
Branching process, critical      99 105 112 178
Branching process, extinct      100
Branching process, subcritical      99
Branching process, supercritical      99
Connected component      3 32
Decomposable property R      27
Direct descendants of a particle      97
Distribution of the central terms of a sequence      48
Distribution of the number of offsping of a particle      98
Distribution, logarithmic      35 64
Distribution, polynomial      8
Enumerative combinatorial problem      4
Forest      3 14 149 174
Forest, identical      173—174
Galton Watson process      97
Graph      4
Height of a vertex of a forest      172
Height of a vertex of a tree      107
Hypergraph      33
Linear combinations      50
Local theorem on convergence to the normal distribution      16
Mapping, height of a      177
Mapping, random      5
Mapping, single-valued      3
Matrix, admissible      108 111 172
Matrix, inadmissible      108 112
Matrix, R-admissible      141 176
Moment of extinction of a critical branching process      101
Multiplicity of a vertex      3 107 172
Number of cycles of minimal length      47
Probability of extinction of a process      100
Random Element of a set      5
Root      34
Scheme of allocating particles, classical      9 12 136
Scheme of allocating particles, equiprobable      8 9
Scheme of allocating particles, general      8 14 20 29
Scheme of allocating particles, general, reduction of combinatorial problems to the      12
Space of elementary events      4
Stirling’s formula      153 155
Substitution of degree n      4
Substitution, identity      59
Substitution, order of a      59—60 62
Theorem, integral limit      7
Theorem, local limit      16
Total probability formula      120
Total progeny      104
Tree, height of a      6
Tree, identical      109
Tree, mapping      149
Tree, root of a      4
Tree, rooted      4
Vertex, cyclic      3 152
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2024
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте