probabilistic methods discrete mathematics (27 Ergebnisse)

Softcover. Octavo, xvii, 323 pages. In Very Good condition. Spine is yellow with blue print. Illustrated: b&w figures. Series ISSN: 0937-5511. NOTE: Shelved in Netdesk Column G. 1379439. FP New Rockville Stock.

Hardcover. 323 p. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. C-04504 9783540646228 Sprache: Englisch Gewicht in Gramm: 550.

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Zustand: New. pp. x + 389 Illus.

Zustand: Good. Volume 16. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,700grams, ISBN:9783540646228.

Zustand: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.

Zustand: New. pp. 348 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.

Zustand: New.

Zustand: New.

Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 348 | Sprache: Englisch | Produktart: Bücher | Leave nothing to chance. This cliche embodies the common belief that ran­ domness has no place in carefully planned methodologies, every step should be spelled out, each i dotted and each t crossed. In discrete mathematics at least, nothing could be further from the truth. Introducing random choices into algorithms can improve their performance. The application of proba­ bilistic tools has led to the resolution of combinatorial problems which had resisted attack for decades. The chapters in this volume explore and celebrate this fact. Our intention was to bring together, for the first time, accessible discus­ sions of the disparate ways in which probabilistic ideas are enriching discrete mathematics. These discussions are aimed at mathematicians with a good combinatorial background but require only a passing acquaintance with the basic definitions in probability (e.g. expected value, conditional probability). A reader who already has a firm grasp on the area will be interested in the original research, novel syntheses, and discussions of ongoing developments scattered throughout the book. Some of the most convincing demonstrations of the power of these tech­ niques are randomized algorithms for estimating quantities which are hard to compute exactly. One example is the randomized algorithm of Dyer, Frieze and Kannan for estimating the volume of a polyhedron. To illustrate these techniques, we consider a simple related problem. Suppose S is some region of the unit square defined by a system of polynomial inequalities: Pi (x. y) ~ o.

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 470 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Taschenbuch. Zustand: Neu. Probabilistic Methods for Algorithmic Discrete Mathematics | Michel Habib (u. a.) | Taschenbuch | xvii | Englisch | 2010 | Springer | EAN 9783642084263 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Buch. Zustand: Neu. Neuware -Leave nothing to chance. This cliche embodies the common belief that ran domness has no place in carefully planned methodologies, every step should be spelled out, each i dotted and each t crossed. In discrete mathematics at least, nothing could be further from the truth. Introducing random choices into algorithms can improve their performance. The application of proba bilistic tools has led to the resolution of combinatorial problems which had resisted attack for decades. The chapters in this volume explore and celebrate this fact. Our intention was to bring together, for the first time, accessible discus sions of the disparate ways in which probabilistic ideas are enriching discrete mathematics. These discussions are aimed at mathematicians with a good combinatorial background but require only a passing acquaintance with the basic definitions in probability (e.g. expected value, conditional probability). A reader who already has a firm grasp on the area will be interested in the original research, novel syntheses, and discussions of ongoing developments scattered throughout the book. Some of the most convincing demonstrations of the power of these tech niques are randomized algorithms for estimating quantities which are hard to compute exactly. One example is the randomized algorithm of Dyer, Frieze and Kannan for estimating the volume of a polyhedron. To illustrate these techniques, we consider a simple related problem. Suppose S is some region of the unit square defined by a system of polynomial inequalities: Pi (x. y) ~ o.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 348 pp. Englisch.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Leave nothing to chance. This cliche embodies the common belief that ran domness has no place in carefully planned methodologies, every step should be spelled out, each i dotted and each t crossed. In discrete mathematics at least, nothing could be further from the truth. Introducing random choices into algorithms can improve their performance. The application of proba bilistic tools has led to the resolution of combinatorial problems which had resisted attack for decades. The chapters in this volume explore and celebrate this fact. Our intention was to bring together, for the first time, accessible discus sions of the disparate ways in which probabilistic ideas are enriching discrete mathematics. These discussions are aimed at mathematicians with a good combinatorial background but require only a passing acquaintance with the basic definitions in probability (e.g. expected value, conditional probability). A reader who already has a firm grasp on the area will be interested in the original research, novel syntheses, and discussions of ongoing developments scattered throughout the book. Some of the most convincing demonstrations of the power of these tech niques are randomized algorithms for estimating quantities which are hard to compute exactly. One example is the randomized algorithm of Dyer, Frieze and Kannan for estimating the volume of a polyhedron. To illustrate these techniques, we consider a simple related problem. Suppose S is some region of the unit square defined by a system of polynomial inequalities: Pi (x. y) ~ o.

Buch. Zustand: Neu. Neuware -Frontmatter -- CONTENTS -- Preface -- THE CONTRIBUTION OF THE RUSSIAN MATHEMATICIANS TO THE STUDY OF URN MODELS -- RANDOM FORESTS -- ASYMPTOTIC PROPERTIES OF RANDOM INTERVAL GRAPHS AND THEIR USE IN CLUSTER ANALYSIS -- ON NODES OF GIVEN DEGREE IN RANDOM TREES -- A GENERALIZATION OF THE NUMBER FIELD SIEVE -- OPERATOR AND RECURSION EQUATIONS FOR RUNS IN RANDOM SEQUENCES -- ON THE LIMIT DISTRIBUTION OF THE HEIGHT OF LEAVES IN A PLANE PLANTED TREE -- ON THE DISTRIBUTION OF THE WEIGHTS OF THE RANDOM REED-MULLER CODEWORDS -- ON A METHOD OF PROVING LIMIT THEOREMS FOR BRANCHING PROCESSES WITH IMMIGRATION -- ASYMPTOTIC BEHAVIOUR OF GENERALIZED NON-ORDINARY COX PROCESSES -- THE STEADY STATE DISTRIBUTION OF THE QUEUE LENGTH FOR A QUEUE WITH BULK ARRIVAL AND PROCESSOR SHARING DISCIPLINE -- STATISTICAL ANALYSIS OF RENEWAL PROCESSES -- FUNCTIONAL LIMIT THEOREMS FOR OBSERVATIONS OF STOCHASTIC PROCESSES AT A RANDOM TIME POINT -- FUNCTIONAL LIMIT THEOREMS FOR SUMS OF INDEPENDENT RANDOM VARIABLES WITH REPLACEMENTS -- ON THE LIMIT DISTRIBUTION OF THE ASYMMETRY OF RANDOM GRAPHS -- THE DISTRIBUTION OF VERTICES IN STRATA OF PLANE PLANTED FOREST -- THE LIMIT DISTRIBUTION OF THE NUMBERS OF EMPTY CELLS IN THE SCHEME OF ALLOCATING GROUPED PARTICLES TO GROUPED CELLS -- ESTIMATES OF THE DEVIATION OF THE DISTRIBUTION OF r-INDEPENDENT RANDOM VARIABLES FROM THE NORMAL DISTRIBUTION -- ON THE NUMBER OF PERMUTATIONS OF H OBJECTS WITH GREATEST CYCLE LENGTH k -- EXPLICIT BOUNDS FOR PROBABILITIES OF LARGE DEVIATIONS OF SUMS OF RANDOM VECTORS WITH A GIVEN GRAPH OF DEPENDENCIES -- COMPOSITION OF A TRUSTED COMPUTER SECURITY SYSTEM ON THE BASE OF UNTRUSTED ELEMENTS -- DECOMPOSABLE STATISTICS AND WAITING TIME IN THE MARKOV-PÓLYA URN MODEL -- THE EXACT AND ASYMPTOTIC MAXIMUM LIKELIHOOD ESTIMATES OF THE STRUCTURE OF A STRATIFIED POPULATION -- DISCRETE DISTRIBUTIONS IN CONTROL PROBLEMS -- A RELATION BETWEEN THE UNIFORM AND COMPOSED MEAN PROBABILISTIC METRICS -- ON THE MONTE-CARLO ESTIMATION OF THE DISTRIBUTION FUNCTION OF A FUNCTIONAL OF THE WIENER PROCESS -- ON THE ASYMPTOTIC BEHAVIOUR OF THE NUMBER OF HYPERFORESTS -- SYSTEMS OF RANDOM LINEAR EQUATIONS WITH SMALL NUMBER OF NON-ZERO COEFFICIENTS IN FINITE FIELDS -- ON THE ABSOLUTE CONSTANT IN THE REMAINDER TERM ESTIMATE IN THE CENTRAL LIMIT THEOREM FOR POISSON RANDOM SUMS -- THE MEAN NUMBER OF SOLUTIONS OF A SYSTEM OF RANDOM CONGRUENCES -- ESTIMATION OF THE DISTRIBUTION OF A SUMMAND ON THE BASE OF OBSERVATIONS OF SUMS OF TWO RANDOM SUMMANDS IN A FINITE ABELIAN GROUP -- THE LIMIT DISTRIBUTIONS OF THE MISES FUNCTIONAL OVER NON-EQUIPROBABLE BERNOULLI VECTORS -- ON A CLASS OF DISTRIBUTIONS CONNECTED WITH A NON-HOMOGENEOUS RANDOM WALK ON A FINITE ABELIAN GROUP -- THE NUMBER OF SOLUTIONS OF SYSTEMS OF RANDOM MONOMIAL AND BINOMIAL LINEAR EQUATIONS -- ON A CONDITION OF EXISTENCE OF INTEGER-VALUED RANDOM VARIABLES WITH GIVEN TWO MOMENTS -- ON THE PROBLEM OF OPTIMAL STACK CONTROL IN TWO-LEVEL MEMORY -- LOCAL THEOREMS ON LARGE DEVIATIONS IN THE INVERSE ALLOCATION PROBLEM -- ASYMPTOTIC EXPANSIONS IN LOCAL THEOREMS ON LARGE DEVIATIONS IN THE EQUIPROBABLE ALLOCATION SCHEME -- LIST OF CONTRIBUTORS -- ORGANIZING COMMITTEEWalter de Gruyter GmbH, Genthiner Strasse 13, 10785 Berlin 380 pp. Englisch.

Zustand: New. 476.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Leave nothing to chance. This cliche embodies the common belief that ran domness has no place in carefully planned methodologies, every step should be spelled out, each i dotted and each t crossed. In discrete mathematics at least, nothing could be further from the truth. Introducing random choices into algorithms can improve their performance. The application of proba bilistic tools has led to the resolution of combinatorial problems which had resisted attack for decades. The chapters in this volume explore and celebrate this fact. Our intention was to bring together, for the first time, accessible discus sions of the disparate ways in which probabilistic ideas are enriching discrete mathematics. These discussions are aimed at mathematicians with a good combinatorial background but require only a passing acquaintance with the basic definitions in probability (e.g. expected value, conditional probability). A reader who already has a firm grasp on the area will be interested in the original research, novel syntheses, and discussions of ongoing developments scattered throughout the book. Some of the most convincing demonstrations of the power of these tech niques are randomized algorithms for estimating quantities which are hard to compute exactly. One example is the randomized algorithm of Dyer, Frieze and Kannan for estimating the volume of a polyhedron. To illustrate these techniques, we consider a simple related problem. Suppose S is some region of the unit square defined by a system of polynomial inequalities: Pi (x. y) ~ o.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Frontmatter -- CONTENTS -- Preface -- THE CONTRIBUTION OF THE RUSSIAN MATHEMATICIANS TO THE STUDY OF URN MODELS -- RANDOM FORESTS -- ASYMPTOTIC PROPERTIES OF RANDOM INTERVAL GRAPHS AND THEIR USE IN CLUSTER ANALYSIS -- ON NODES OF GIVEN DEGREE IN RANDOM TREES -- A GENERALIZATION OF THE NUMBER FIELD SIEVE -- OPERATOR AND RECURSION EQUATIONS FOR RUNS IN RANDOM SEQUENCES -- ON THE LIMIT DISTRIBUTION OF THE HEIGHT OF LEAVES IN A PLANE PLANTED TREE -- ON THE DISTRIBUTION OF THE WEIGHTS OF THE RANDOM REED-MULLER CODEWORDS -- ON A METHOD OF PROVING LIMIT THEOREMS FOR BRANCHING PROCESSES WITH IMMIGRATION -- ASYMPTOTIC BEHAVIOUR OF GENERALIZED NON-ORDINARY COX PROCESSES -- THE STEADY STATE DISTRIBUTION OF THE QUEUE LENGTH FOR A QUEUE WITH BULK ARRIVAL AND PROCESSOR SHARING DISCIPLINE -- STATISTICAL ANALYSIS OF RENEWAL PROCESSES -- FUNCTIONAL LIMIT THEOREMS FOR OBSERVATIONS OF STOCHASTIC PROCESSES AT A RANDOM TIME POINT -- FUNCTIONAL LIMIT THEOREMS FOR SUMS OF INDEPENDENT RANDOM VARIABLES WITH REPLACEMENTS -- ON THE LIMIT DISTRIBUTION OF THE ASYMMETRY OF RANDOM GRAPHS -- THE DISTRIBUTION OF VERTICES IN STRATA OF PLANE PLANTED FOREST -- THE LIMIT DISTRIBUTION OF THE NUMBERS OF EMPTY CELLS IN THE SCHEME OF ALLOCATING GROUPED PARTICLES TO GROUPED CELLS -- ESTIMATES OF THE DEVIATION OF THE DISTRIBUTION OF r-INDEPENDENT RANDOM VARIABLES FROM THE NORMAL DISTRIBUTION -- ON THE NUMBER OF PERMUTATIONS OF H OBJECTS WITH GREATEST CYCLE LENGTH k -- EXPLICIT BOUNDS FOR PROBABILITIES OF LARGE DEVIATIONS OF SUMS OF RANDOM VECTORS WITH A GIVEN GRAPH OF DEPENDENCIES -- COMPOSITION OF A TRUSTED COMPUTER SECURITY SYSTEM ON THE BASE OF UNTRUSTED ELEMENTS -- DECOMPOSABLE STATISTICS AND WAITING TIME IN THE MARKOV-PÓLYA URN MODEL -- THE EXACT AND ASYMPTOTIC MAXIMUM LIKELIHOOD ESTIMATES OF THE STRUCTURE OF A STRATIFIED POPULATION -- DISCRETE DISTRIBUTIONS IN CONTROL PROBLEMS -- A RELATION BETWEEN THE UNIFORM AND COMPOSED MEAN PROBABILISTIC METRICS -- ON THE MONTE-CARLO ESTIMATION OF THE DISTRIBUTION FUNCTION OF A FUNCTIONAL OF THE WIENER PROCESS -- ON THE ASYMPTOTIC BEHAVIOUR OF THE NUMBER OF HYPERFORESTS -- SYSTEMS OF RANDOM LINEAR EQUATIONS WITH SMALL NUMBER OF NON-ZERO COEFFICIENTS IN FINITE FIELDS -- ON THE ABSOLUTE CONSTANT IN THE REMAINDER TERM ESTIMATE IN THE CENTRAL LIMIT THEOREM FOR POISSON RANDOM SUMS -- THE MEAN NUMBER OF SOLUTIONS OF A SYSTEM OF RANDOM CONGRUENCES -- ESTIMATION OF THE DISTRIBUTION OF A SUMMAND ON THE BASE OF OBSERVATIONS OF SUMS OF TWO RANDOM SUMMANDS IN A FINITE ABELIAN GROUP -- THE LIMIT DISTRIBUTIONS OF THE MISES FUNCTIONAL OVER NON-EQUIPROBABLE BERNOULLI VECTORS -- ON A CLASS OF DISTRIBUTIONS CONNECTED WITH A NON-HOMOGENEOUS RANDOM WALK ON A FINITE ABELIAN GROUP -- THE NUMBER OF SOLUTIONS OF SYSTEMS OF RANDOM MONOMIAL AND BINOMIAL LINEAR EQUATIONS -- ON A CONDITION OF EXISTENCE OF INTEGER-VALUED RANDOM VARIABLES WITH GIVEN TWO MOMENTS -- ON THE PROBLEM OF OPTIMAL STACK CONTROL IN TWO-LEVEL MEMORY -- LOCAL THEOREMS ON LARGE DEVIATIONS IN THE INVERSE ALLOCATION PROBLEM -- ASYMPTOTIC EXPANSIONS IN LOCAL THEOREMS ON LARGE DEVIATIONS IN THE EQUIPROBABLE ALLOCATION SCHEME -- LIST OF CONTRIBUTORS -- ORGANIZING COMMITTEE.

Buch. Zustand: Neu. Neuware -Frontmatter -- CONTENTS -- Preface -- INJECTIVE MAPPINGS OF WORDS WHICH DO NOT MULTIPLY SYMBOL SKIP AND INSERTION ERRORS -- MODELS FOR COMPUTER SECURITY -- PROBABILITY DISTRIBUTIONS OF THE NUMBERS OF CONFIGURATIONS AND DISCORDANCES OF RANDOM PERMUTATIONS FROM REGULAR CYCLIC CLASSES -- EQUILIBRIUM IN AN ARBITRATION GAME -- DYNAMIC GAMES WITH RANDOM DURATION AND UNCERTAIN PAYOFFS -- ON STOPPING GAMES WHEN MORE THAN ONE STOP IS POSSIBLE -- LOCAL STRUCTURE OF A RANDOM POLYNOMIAL OVER FINITE FIELD -- GALTON-WATSON FORESTS -- ON THE EXISTENCE OF A GIANT COMPONENT IN SCHEMES OF ALLOCATING PARTICLES -- STATISTICAL ESTIMATION OF DISTRIBUTIONS OF SAMPLING CHARACTERISTICS IN THE CASE OF GAMMA FAMILIES -- ON ESTIMATION AND GROUP CLASSIFICATION IN THE SPACE OF A SUFFICIENT STATISTIC OF THE NEGATIVE BINOMIAL DISTRIBUTION -- ON THE REPRESENTATION OF BENT FUNCTIONS BY BENT RECTANGLES -- ON DESTRUCTION OF A LATTICE IN LOCAL LIMIT THEOREMS -- ISOPERIODS OF OUTPUT SEQUENCES OF AUTOMATA -- ON JOINT APPLICATION OF STATISTICAL TESTS -- CHEBYSHEV SYSTEMS AND GENERALISED CONVEX GAMES VERSUS NATURE -- ON THE NECESSARY NUMBER OF OBSERVATIONS NEEDED FOR UNIQUE DETECTION OF INSERTIONS IN THE MULTINOMIAL SCHEME -- LOCAL LIMIT THEOREMS FOR AN ARRAY SCHEME AND GALTON-WATSON FORESTS -- ASYMPTOTIC BEHAVIOUR OF THE WAITING TIME IN SCHEMES OF ALLOCATING PARTICLES IN GROUPS OF RANDOM SIZES -- RANDOM PARTITIONS AND THEIR APPLICATIONS -- RANDOM PARTITIONS OF A SET AND THE GENERALISED ALLOCATION SCHEME -- ON A PROBLEM OF A. N. KOLMOGOROV -- ESTIMATION OF STOCHASTIC DEPENDENCE AND TESTING FOR THE N-DIMENSIONAL UNIFORMITY BY SAMPLE CHARACTERISTIC FUNCTIONS -- CYCLOTOMIC INTEGERS AND DISCRETE LOGARITHMS IN GF(p2) -- LIMIT DISTRIBUTION OF THE NUMBER OF LEAVES OF A GALTON-WATSON FOREST -- THE BAYES RISK ASYMPTOTICS UNDER TESTING COMPOSITE HYPOTHESES ON MARKOV CHAINS -- A GENERALISED MTP2 AND A SEQUENTIAL STOCHASTIC MODEL ON A PARTIALLY OBSERVABLE MARKOV PROCESS -- AN OPTIMAL DICHOTOMOUS SEARCH -- CONSTRUCTION OF THE HEDGING STRATEGIES FOR ONE MODEL OF (B, S)-MARKET -- ON APPLICATION OF STATISTICAL METHODS TO AUTHORSHIP ATTRIBUTION -- ON THE DISTRIBUTION OF THE NUMBER OF OCCUPIED ONE-PLACE CELLS BY PARTICLES OF TWO TYPES -- CHARACTERISTICS OF A RANDOM SYSTEMS OF BOOLEAN EQUATIONS WITH NON-REGULAR LEFT-HAND SIDE -- ON THE PROBLEM OF OPTIMAL STACK CONTROL -- ON THE DIMENSION OF BAYESIAN NETWORKS WITH LATENT VARIABLES -- ON THE ASYMPTOTICS OF THE PROBABILITY OF LARGE DEVIATIONS IN THE EQUIPROBABLE SCHEMES OF ALLOCATIONS -- ON ASYMPTOTIC EXPANSIONS OF THE NUMBER OF ALLOCATIONS OF PARTICLES TO CELLS WITH RESTRICTIONS ON THE SIZES OF CELLSWalter de Gruyter GmbH, Genthiner Strasse 13, 10785 Berlin 400 pp. Englisch.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Frontmatter -- CONTENTS -- Preface -- INJECTIVE MAPPINGS OF WORDS WHICH DO NOT MULTIPLY SYMBOL SKIP AND INSERTION ERRORS -- MODELS FOR COMPUTER SECURITY -- PROBABILITY DISTRIBUTIONS OF THE NUMBERS OF CONFIGURATIONS AND DISCORDANCES OF RANDOM PERMUTATIONS FROM REGULAR CYCLIC CLASSES -- EQUILIBRIUM IN AN ARBITRATION GAME -- DYNAMIC GAMES WITH RANDOM DURATION AND UNCERTAIN PAYOFFS -- ON STOPPING GAMES WHEN MORE THAN ONE STOP IS POSSIBLE -- LOCAL STRUCTURE OF A RANDOM POLYNOMIAL OVER FINITE FIELD -- GALTON-WATSON FORESTS -- ON THE EXISTENCE OF A GIANT COMPONENT IN SCHEMES OF ALLOCATING PARTICLES -- STATISTICAL ESTIMATION OF DISTRIBUTIONS OF SAMPLING CHARACTERISTICS IN THE CASE OF GAMMA FAMILIES -- ON ESTIMATION AND GROUP CLASSIFICATION IN THE SPACE OF A SUFFICIENT STATISTIC OF THE NEGATIVE BINOMIAL DISTRIBUTION -- ON THE REPRESENTATION OF BENT FUNCTIONS BY BENT RECTANGLES -- ON DESTRUCTION OF A LATTICE IN LOCAL LIMIT THEOREMS -- ISOPERIODS OF OUTPUT SEQUENCES OF AUTOMATA -- ON JOINT APPLICATION OF STATISTICAL TESTS -- CHEBYSHEV SYSTEMS AND GENERALISED CONVEX GAMES VERSUS NATURE -- ON THE NECESSARY NUMBER OF OBSERVATIONS NEEDED FOR UNIQUE DETECTION OF INSERTIONS IN THE MULTINOMIAL SCHEME -- LOCAL LIMIT THEOREMS FOR AN ARRAY SCHEME AND GALTON-WATSON FORESTS -- ASYMPTOTIC BEHAVIOUR OF THE WAITING TIME IN SCHEMES OF ALLOCATING PARTICLES IN GROUPS OF RANDOM SIZES -- RANDOM PARTITIONS AND THEIR APPLICATIONS -- RANDOM PARTITIONS OF A SET AND THE GENERALISED ALLOCATION SCHEME -- ON A PROBLEM OF A. N. KOLMOGOROV -- ESTIMATION OF STOCHASTIC DEPENDENCE AND TESTING FOR THE N-DIMENSIONAL UNIFORMITY BY SAMPLE CHARACTERISTIC FUNCTIONS -- CYCLOTOMIC INTEGERS AND DISCRETE LOGARITHMS IN GF(p2) -- LIMIT DISTRIBUTION OF THE NUMBER OF LEAVES OF A GALTON-WATSON FOREST -- THE BAYES RISK ASYMPTOTICS UNDER TESTING COMPOSITE HYPOTHESES ON MARKOV CHAINS -- A GENERALISED MTP2 AND A SEQUENTIAL STOCHASTIC MODEL ON A PARTIALLY OBSERVABLE MARKOV PROCESS -- AN OPTIMAL DICHOTOMOUS SEARCH -- CONSTRUCTION OF THE HEDGING STRATEGIES FOR ONE MODEL OF (B, S)-MARKET -- ON APPLICATION OF STATISTICAL METHODS TO AUTHORSHIP ATTRIBUTION -- ON THE DISTRIBUTION OF THE NUMBER OF OCCUPIED ONE-PLACE CELLS BY PARTICLES OF TWO TYPES -- CHARACTERISTICS OF A RANDOM SYSTEMS OF BOOLEAN EQUATIONS WITH NON-REGULAR LEFT-HAND SIDE -- ON THE PROBLEM OF OPTIMAL STACK CONTROL -- ON THE DIMENSION OF BAYESIAN NETWORKS WITH LATENT VARIABLES -- ON THE ASYMPTOTICS OF THE PROBABILITY OF LARGE DEVIATIONS IN THE EQUIPROBABLE SCHEMES OF ALLOCATIONS -- ON ASYMPTOTIC EXPANSIONS OF THE NUMBER OF ALLOCATIONS OF PARTICLES TO CELLS WITH RESTRICTIONS ON THE SIZES OF CELLS.

Buch. Zustand: Neu. Neuware -Frontmatter -- CONTENTS -- Preface -- A Survey of the Early History of the Theory of Random Mappings -- On Goncharov's Works in the Field of Combinatorics -- Probability Distributions in Prime Number Theory -- Polynomial and Polynomial-Like Allocations: Recent Developments -- Properties of Random Permutations with Constraints on the Maximum Cycle Length -- Stochastic Properties of Systems of Random Linear Equations over Finite Algebraic Structures -- On the Number of Solutions of Systems of Pseudo-Boolean Random Equations -- Problems of Security in Information Processing Systems -- Decomposable Statistics Based on the Spacings and Spacing-Frequencies of Higher Orders -- On the Allocation Processes with Given Distributions of Frequency Vectors -- Statistical Problems Concerned with Estimation of the Composition of -Radioactive Wastes -- On Transient Phenomena for Branching Migration Processes -- Asymptotic Behaviour of Waiting Times in a Scheme of Particle Allocation -- Limit Theorems for U-Statistics of Dependent Random Variables -- Limit Theorems for Decomposable Statistics of Dependent Random Variables -- Estimating Finite Stratified Population -- Asymptotic Expansions for Permutation Tests with Several Samples -- On Approximation of Weighted Sums of Random Variables with Two-Dimensional Indices -- On a Lower Bound for the Isoperimetric Number of Cubic Graphs -- A Risk Function in Global Optimization Problem -- On an Existence Theorem for Decomposable Statistics -- The Propriety of Phase Transitions in Random Graphs -- On Sums of Values of the Legendre Symbol over Components in a Scheme of Generation of Random Vectors -- On the Strong Law of Large Numbers for Sums of Pairwise Independent Random Variables -- On a Special Class of Functions Associated with the Complexity of String Correction Problem -- Operator Moments of Random Euclidean Mappings -- Percolation Method in a System of Numerous Particles -- Models of -Percolation -- On Estimation of the Coefficient of Asymptotic Relative Efficiency of Discrete-Analogue Algorithms to Detect Signals in a Non-Gaussian Noise -- Random Mappings and Trees: Relations between Asymptotics of Moments of Certain Characteristics -- On a Nonlinear Generalization of the Occupancy Problem -- Weak Convergence of Certain Multiple Sums of Dependent Random Variables -- On Problems of Renewal System Theory for Finite Time Interval -- On the Generating Functions of Coloured Partitions and Limit Theorems for Sums of Indicators -- Probabilistic Methods in the Theory of Approximation of Discrete Functions -- Chernoff's Inequality for Sum of Independent Random Vectors -- Some Limit Theorems in Batch Allocation Scheme with Random Levels Defined by an Allocation Scheme -- Runs in Finite Markov Chains -- How Often is Addition Equal to Bitwise Addition -- Boolean Functions and Approximation of Vectors -- Limit Theorems for Random A-Permutations -- LIST OF CONTRIBUTORS -- ORGANIZING COMMITTEEWalter de Gruyter GmbH, Genthiner Strasse 13, 10785 Berlin 480 pp. Englisch.

Hardcover. Zustand: Brand New. 380 pages. 6.69x0.88x9.61 inches. In Stock.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Frontmatter -- CONTENTS -- Preface -- A Survey of the Early History of the Theory of Random Mappings -- On Goncharov's Works in the Field of Combinatorics -- Probability Distributions in Prime Number Theory -- Polynomial and Polynomial-Like Allocations: Recent Developments -- Properties of Random Permutations with Constraints on the Maximum Cycle Length -- Stochastic Properties of Systems of Random Linear Equations over Finite Algebraic Structures -- On the Number of Solutions of Systems of Pseudo-Boolean Random Equations -- Problems of Security in Information Processing Systems -- Decomposable Statistics Based on the Spacings and Spacing-Frequencies of Higher Orders -- On the Allocation Processes with Given Distributions of Frequency Vectors -- Statistical Problems Concerned with Estimation of the Composition of -Radioactive Wastes -- On Transient Phenomena for Branching Migration Processes -- Asymptotic Behaviour of Waiting Times in a Scheme of Particle Allocation -- Limit Theorems for U-Statistics of Dependent Random Variables -- Limit Theorems for Decomposable Statistics of Dependent Random Variables -- Estimating Finite Stratified Population -- Asymptotic Expansions for Permutation Tests with Several Samples -- On Approximation of Weighted Sums of Random Variables with Two-Dimensional Indices -- On a Lower Bound for the Isoperimetric Number of Cubic Graphs -- A Risk Function in Global Optimization Problem -- On an Existence Theorem for Decomposable Statistics -- The Propriety of Phase Transitions in Random Graphs -- On Sums of Values of the Legendre Symbol over Components in a Scheme of Generation of Random Vectors -- On the Strong Law of Large Numbers for Sums of Pairwise Independent Random Variables -- On a Special Class of Functions Associated with the Complexity of String Correction Problem -- Operator Moments of Random Euclidean Mappings -- Percolation Method in a System of Numerous Particles -- Models of -Percolation -- On Estimation of the Coefficient of Asymptotic Relative Efficiency of Discrete-Analogue Algorithms to Detect Signals in a Non-Gaussian Noise -- Random Mappings and Trees: Relations between Asymptotics of Moments of Certain Characteristics -- On a Nonlinear Generalization of the Occupancy Problem -- Weak Convergence of Certain Multiple Sums of Dependent Random Variables -- On Problems of Renewal System Theory for Finite Time Interval -- On the Generating Functions of Coloured Partitions and Limit Theorems for Sums of Indicators -- Probabilistic Methods in the Theory of Approximation of Discrete Functions -- Chernoff's Inequality for Sum of Independent Random Vectors -- Some Limit Theorems in Batch Allocation Scheme with Random Levels Defined by an Allocation Scheme -- Runs in Finite Markov Chains -- How Often is Addition Equal to Bitwise Addition -- Boolean Functions and Approximation of Vectors -- Limit Theorems for Random A-Permutations -- LIST OF CONTRIBUTORS -- ORGANIZING COMMITTEE.

Hardcover. Zustand: Brand New. 400 pages. 6.69x0.88x9.61 inches. In Stock.

Hardcover. Zustand: Brand New. reprint edition. 480 pages. 6.69x1.06x9.61 inches. In Stock.

Zustand: Gebraucht / Used. Hardcover. vi,365pp.