Дискретная математика
Математика
  • формат djvu
  • размер 4.83 МБ
  • добавлен 24 октября 2011 г.
Bollob?s B., Riordan O. Percolation
Издательство Cambridge University Press, 2006, -336 pp.
Качество среднее (бледный текст).
Percolation theory was founded by Broadbent and Hammersley almost half a century ag: by now thousands of papers and many books have been devoted to the subject. The original aim was to open up to mathematical analysis the study of random physical processes such as the flow of through a disorders porous medium. These problems in applied mathematics have attracted attention of many physicists as well as pure mathematicians, and have led to the accumulation of much experimental and heuristic evidence for many remarkable phenomena. Mathematically, the subject has tued out to be much more difficult than might have been expected, with several deep results and many more conjectured.
Basic concepts and results.
Probabilistic tools.
Boud percolation on Z2 - the Harris-Kestell Theorem.
Exponential decay and critical probabilities – theorems of Menshikov and Aizenman & Barsky.
Uniqueness of the infinite open cluster and critical probabilities.
Estimating critical probabilities.
Conformal invariance - Smiov's Theorem.
Continuum pelcolation.
Похожие разделы
Смотрите также

Ahlswede R., B?umer L., Cai N., Aydinian H., Blinovsky V., Deppe C., Mashurian H. (eds.) General Theory of Information Transfer and Combinatorics

  • формат pdf
  • размер 9.46 МБ
  • добавлен 31 января 2012 г.
Издательство Springer, 2006, -1137 pp. The Center for Interdisciplinary Research (ZiF) of the University of Bielefeld hosted a research group under the title General Theory of Information Transfer and Combinatorics, abbreviated as GTIT-C, from October 1, 2001 to September 30, 2004. As head of the research group the editor shaped the group’s scientific directions and its personal composition. He followed ideas, problems and results which had occu...

Bollob?s B. (ed.) Advances in Graph Theory

  • формат djvu
  • размер 2.16 МБ
  • добавлен 23 октября 2011 г.
Издательство North Holland, 1978, -305 pp. Annals of Discrete Mathematics, Number 3. which received an equally memorable reply. Several of the papers were quickly and efficiently retyped by Mrs. J.E. Scutt. The editorial burden was greatly relieved by the excellent work of Mr. A.G. Thomason. Linear separation of dominating sets in graphs. Regularisable graphs. Hamiltonian decompositions of graphs, directed graphs and hypergraphs. Extremal gr...

Bollob?s B. (ed.) Graph Theory

  • формат djvu
  • размер 1.12 МБ
  • добавлен 23 октября 2011 г.
Издательство North Holland, 1982, -210 pp. Annals of Discrete Mathematics, Number 13. Proceedings of the Conference on Graph Theory, Cambridge. The Cambridge Graph Theory Conference, held at Trinity College from 11 to 13 March 1981, brought together top ranking workers from diverse areas of the subject. The papers presented were by invitation only. This volume contains most of the contributions, suitably refereed and revised. For many years now,...

Bollob?s B. (ed.) Surveys in Combinatorics

  • формат pdf
  • размер 1.57 МБ
  • добавлен 04 октября 2011 г.
Издательство Cambridge University Press, 1979, -270 pp. Proceedings of the 7th British Combinatorial Conference. Since its inception at Oxford in 1969 the British Combinatorial Conference has become a regular feature of the international mathematical calendar. This year the seventh conference will be held in Cambridge from 13th to 17th August, under the auspices of the Department of Pure Mathematics and Mathematical Statistics. The participants...

Bollob?s B. Combinatorics. Set Systems, Hypergraphs, Families of Vectors and Probabilistic Combinatorics

  • формат djvu
  • размер 1.39 МБ
  • добавлен 06 октября 2011 г.
Издательство Cambridge University Press, 1986, -187 pp. This book is an expanded account of a first-year graduate course in combinatorics, given at Louisiana State University, Baton Rouge during the fall semester of 1985. The traditional ingredients of an initial combinatorics course seem to be combinatorial identities and generating functions, with some introductory design theory or graph theory. Usually, set systems, hyper- graphs and sets o...

Bollob?s B. Graph Theory and Combinatorics

  • формат djvu
  • размер 3 МБ
  • добавлен 04 октября 2011 г.
Издательство North Holland, 1988, -419 pp. Proceedings of the Cambridge Combinatorial Conference in Honour of Paul Erd?s The 1988 Cambridge Combinatorial Conference was held at Trinity College, Cambridge, from 21 to 25 March 1988, under the auspices of the London Mathematical Society, the Department of Pure Mathematics and Mathematical Statistics of Cambridge University and Trinity College, Cambridge. The financial support from these institution...

Comtet L. Advanced Combinatorics. The Art of Finite and Infinite Expansions

  • формат djvu
  • размер 4.48 МБ
  • добавлен 04 октября 2011 г.
Издательство D. Reidel Publishing, 1974, -354 pp. Notwithstanding its title, the reader will not find in this book a systematic account of this huge subject. Certain classical aspects have been passed by, and the true title ought to be "Various questions of elementary combinatorial analysis". For instance, we only touch upon the subject of graphs and configurations, but there exists a very extensive and good literature on this subject. For this...

Gazeau J.-P., Ne?et?il N., Rovan B. (eds.) Physics and Theoretical Computer Science. From Numbers and Languages to (Quantum) Cryptography

  • формат pdf
  • размер 5.86 МБ
  • добавлен 31 января 2012 г.
Издательство IOS Press, 2007, -348 pp. As a part of the NATO Security Through Science Programme, the goal of the Advanced Study Institute Physics and Computer Science was to reinforce the interface between physical sciences, theoretical computer science, and discrete mathematics. No one can dispute the current importance of applied as well as theoretical Computer Science in the development and the practice of Physical Sciences. Physicists of cou...