Probabilistic Methods in Discrete Mathematics
eBook - PDF

Probabilistic Methods in Discrete Mathematics

Proceedings of the Fifth International Petrozavodsk Conference, Petrozavodsk, Russia, June 1–6, 2000

  1. 399 pages
  2. English
  3. PDF
  4. Available on iOS & Android
eBook - PDF

Probabilistic Methods in Discrete Mathematics

Proceedings of the Fifth International Petrozavodsk Conference, Petrozavodsk, Russia, June 1–6, 2000

Frequently asked questions

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
No, books cannot be downloaded as external files, such as PDFs, for use outside of Perlego. However, you can download books within the Perlego app for offline reading on mobile or tablet. Learn more here.
Perlego offers two plans: Essential and Complete
  • Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
  • Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Both plans are available with monthly, semester, or annual billing cycles.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes! You can use the Perlego app on both iOS or Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Yes, you can access Probabilistic Methods in Discrete Mathematics by V. F. Kolchin, V. Ya Kozlov, V. V. Mazalov, Yu. L. Pavlov, Yu. V. Prokhorov in PDF and/or ePUB format, as well as other popular books in Mathematics & Mathematics General. We have over one million books available in our catalogue for you to explore.

Information

Publisher
De Gruyter
Year
2020
Print ISBN
9783112302835
eBook ISBN
9783112314104

Table of contents

  1. CONTENTS
  2. Preface
  3. INJECTIVE MAPPINGS OF WORDS WHICH DO NOT MULTIPLY SYMBOL SKIP AND INSERTION ERRORS
  4. MODELS FOR COMPUTER SECURITY
  5. PROBABILITY DISTRIBUTIONS OF THE NUMBERS OF CONFIGURATIONS AND DISCORDANCES OF RANDOM PERMUTATIONS FROM REGULAR CYCLIC CLASSES
  6. EQUILIBRIUM IN AN ARBITRATION GAME
  7. DYNAMIC GAMES WITH RANDOM DURATION AND UNCERTAIN PAYOFFS
  8. ON STOPPING GAMES WHEN MORE THAN ONE STOP IS POSSIBLE
  9. LOCAL STRUCTURE OF A RANDOM POLYNOMIAL OVER FINITE FIELD
  10. GALTON-WATSON FORESTS
  11. ON THE EXISTENCE OF A GIANT COMPONENT IN SCHEMES OF ALLOCATING PARTICLES
  12. STATISTICAL ESTIMATION OF DISTRIBUTIONS OF SAMPLING CHARACTERISTICS IN THE CASE OF GAMMA FAMILIES
  13. ON ESTIMATION AND GROUP CLASSIFICATION IN THE SPACE OF A SUFFICIENT STATISTIC OF THE NEGATIVE BINOMIAL DISTRIBUTION
  14. ON THE REPRESENTATION OF BENT FUNCTIONS BY BENT RECTANGLES
  15. ON DESTRUCTION OF A LATTICE IN LOCAL LIMIT THEOREMS
  16. ISOPERIODS OF OUTPUT SEQUENCES OF AUTOMATA
  17. ON JOINT APPLICATION OF STATISTICAL TESTS
  18. CHEBYSHEV SYSTEMS AND GENERALISED CONVEX GAMES VERSUS NATURE
  19. ON THE NECESSARY NUMBER OF OBSERVATIONS NEEDED FOR UNIQUE DETECTION OF INSERTIONS IN THE MULTINOMIAL SCHEME
  20. LOCAL LIMIT THEOREMS FOR AN ARRAY SCHEME AND GALTON-WATSON FORESTS
  21. ASYMPTOTIC BEHAVIOUR OF THE WAITING TIME IN SCHEMES OF ALLOCATING PARTICLES IN GROUPS OF RANDOM SIZES
  22. RANDOM PARTITIONS AND THEIR APPLICATIONS
  23. RANDOM PARTITIONS OF A SET AND THE GENERALISED ALLOCATION SCHEME
  24. ON A PROBLEM OF A. N. KOLMOGOROV
  25. ESTIMATION OF STOCHASTIC DEPENDENCE AND TESTING FOR THE N-DIMENSIONAL UNIFORMITY BY SAMPLE CHARACTERISTIC FUNCTIONS
  26. CYCLOTOMIC INTEGERS AND DISCRETE LOGARITHMS IN GF(p<sup>2</sup>)
  27. LIMIT DISTRIBUTION OF THE NUMBER OF LEAVES OF A GALTON-WATSON FOREST
  28. THE BAYES RISK ASYMPTOTICS UNDER TESTING COMPOSITE HYPOTHESES ON MARKOV CHAINS
  29. A GENERALISED MTP2 AND A SEQUENTIAL STOCHASTIC MODEL ON A PARTIALLY OBSERVABLE MARKOV PROCESS
  30. AN OPTIMAL DICHOTOMOUS SEARCH
  31. CONSTRUCTION OF THE HEDGING STRATEGIES FOR ONE MODEL OF (B, S)-MARKET
  32. ON APPLICATION OF STATISTICAL METHODS TO AUTHORSHIP ATTRIBUTION
  33. ON THE DISTRIBUTION OF THE NUMBER OF OCCUPIED ONE-PLACE CELLS BY PARTICLES OF TWO TYPES
  34. CHARACTERISTICS OF A RANDOM SYSTEMS OF BOOLEAN EQUATIONS WITH NON-REGULAR LEFT-HAND SIDE
  35. ON THE PROBLEM OF OPTIMAL STACK CONTROL
  36. ON THE DIMENSION OF BAYESIAN NETWORKS WITH LATENT VARIABLES
  37. ON THE ASYMPTOTICS OF THE PROBABILITY OF LARGE DEVIATIONS IN THE EQUIPROBABLE SCHEMES OF ALLOCATIONS
  38. ON ASYMPTOTIC EXPANSIONS OF THE NUMBER OF ALLOCATIONS OF PARTICLES TO CELLS WITH RESTRICTIONS ON THE SIZES OF CELLS