Analytic combinatorics aims to enable precise quantitative predictions of the properties of
large combinatorial structures. The theory has emerged over recent decades as essential …

Asymptotic enumeration methods provide quantitative information about the rate of growth of
functions that count combinatorial objects. Typical questions that these methods answer …

This is an expository paper dealing with those tools in asymptotic analysis which are
especially useful in obtaining asymptotic results in enumeration problems. Emphasis is on …

The book is devoted to the study of classical combinatorial structures such as random
graphs, permutations, and systems of random linear equations in finite fields. The author …

We show that a number of graph-theoretic counting problems remain \calNP-hard, indeed
#\calP-complete, in very restricted classes of graphs. In particular, we prove that the …

Дастся систематическое изложение интенсивно развивающегося в течение последних
десяти лет направления в теории вероятностей, связанного со случайными …

This work explores the role of probabilistic methods for solving combinatorial problems. The
subjects studied are nonnegative matrices, partitions and mappings of finite sets, with …

Once on the forefront of mathematical research in America, the asymptotics of the solutions
of linear recurrence equations is now almost forgotten, especially by the people who need it …

Discrete mathematics is an important tool for the investigation of various models of
functioning of technical devices, especially in the field of cybernetics. Here the author …

Книга посвящена применениям асимптотических методов теории вероятностей к
изучению случайных отображений конечного множества в себя. Предельные …