Kolchin, V. F.  | Cambridge

116,000원  | 20210101  | 9780521119689

A study of classical combinatorial structures such as random graphs, permutations, and systems of random linear equations in finite fields, concentrating on research by Russian mathematicians. The book shows how to reduce combinatorial problems to classical problems of probability theory on the summation of independent random variables.

Bollobs, Bla  | Cambridge

531,060원  | 20210101  | 9780521809207

This is a new edition of the now classic text. The already extensive treatment given in the first edition has been heavily revised by the author. The addition of two new sections, numerous new results and 150 references means that this represents ...

Bollobas, Bela/ Bollobas, B.  | Cambridge

228,370원  | 20011008  | 9780521797221

This is a new edition of the now classic text. The already extensive treatment given in the first edition has been heavily revised by the author. The addition of two new sections, numerous new results and 150 references means that this represents ...

 | Createspace

40,120원  | 20140723  | 9781500613655

In this monograph we attempt to motivate the following question: to the extent that quantum theory is random, regardless of the origin of this randomness, is there anything in the physics that properties of random graphs can model or help to explain? A graph is random if the decision whether or not to attach pairs of vertices with an edge is taken at random.

Remco van der Hofstad  | Cambridge University Press

126,870원  | 20161222  | 9781107172876

Network science is one of the fastest growing areas in science and business. This classroom-tested, self-contained book is designed for master's-level courses and provides a rigorous treatment of random graph models for networks, featuring many examples of real-world networks for motivation and numerous exercises to build intuition and experience.

 | AV Akademikerverlag

105,120원  | 20120522  | 9783639414837

Revision with unchanged content. The theory of random graphs was founded by Paul Erd?s and Alfred Renyi around 1959. Since then this interesting and fruitful branch of combinatorics attracted many experts from mathematics and theoretical computer science. This book discusses several questions from the realm of classical graph theory in the context of random graphs.

 | AV Akademikerverlag

125,060원  | 20120627  | 9783639432862

Revision with unchanged content. Many random graph processes exhibit a phase transition, where the compo­nent structure of the graph changes radically caused by the addition of relatively few random edges. Before the phase transition the graph consists, with high probability, of many small components, while after the phase transition it contains, with high probability, a unique component of linear size, called the giant component, which is much larger than every other component in the graph.

Michael Krivelevich  | Cambridge University Press

89,710원  | 20160726  | 9781316501917

A self-contained and concise introduction to recent developments, particularly those of a geometric and topological nature, in the theory of random graphs. Such material is seldom covered in the formative study of young combinatorialists and probabilists, making this essential reading for beginning researchers in these fields.

Markus Heydenreich, Remco van der Hofstad  | Springer Verlag

114,160원  | 20171204  | 9783319624723

The text may also be useful in advanced courses and seminars, as well as for reference and individual study. Part I, consisting of 3 chapters, presents a general introduction to percolation, stating the main results, defining the central objects, and proving its main properties.

Marchette  | Wiley

40,000원  | 20040206  | 9780471221760

Marchette (a researcher at the U.S. Naval Surface Warfare Center) categorizes the intersection of random graphs and statistical pattern recognition as consisting of random graph methodologies applied to statistical pattern recognition, and the study of random graphs that arise from statistical pattern recognition.

Kolchin, V. F. (Valentin Fedor  | Cambridge

268,250원  | 19981101  | 9780521440813

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 shows how the application of the generalized scheme of allocation in th...

 | Amer Mathematical Society

93,620원  | 20060201  | 9780821838259

Presents generalization of Szemeredi's Regularity Lemma to a certain hypergraph setting.

Penrose, Mathew  | Oxford University Press

344,370원  | 20210101  | 9780198506263

This monograph provides and explains the probability theory of geometric graphs. Applications of the theory include communications networks, classification, spatial statistics, epidemiology, astrophysics and neural networks.

Geoffrey Grimmett  | Cambridge

0원  | 20210101  | 9780521197984

This introduction to some of the principal models in the theory of disordered systems leads the reader through the basics, to the very edge of contemporary research, with the minimum of technical fuss. Topics covered include random walk, percolation, self-avoiding walk, interacting particle systems, uniform spanning tree, random graphs, as well as the Ising, Potts, and random-cluster models for ferromagnetism, and the Lorentz model for motion in a random medium. Schramm��밚철wn...

Barlow, Martin T.  | Cambridge University Press

146,810원  | 20170812  | 9781107674424

This introduction to random walks on infinite graphs, in both discrete and continuous time, gives a systematic account of transition densities, including useful but hard-to-find results. The book is aimed at researchers and graduate students in mathematics who have a basic familiarity with analysis and some familiarity with probability.