Read and Download eBook Full
Author: Jacob E. Goodman
Publisher: Cambridge University Press
Published: 2005-08-08
Total Pages: 640
ISBN-13: 9780521848626
DOWNLOAD EBOOKThis 2005 book deals with interest topics in Discrete and Algorithmic aspects of Geometry.
Author: Tullio Ceccherini-Silberstein
Publisher: Springer Nature
Published: 2022-01-01
Total Pages: 468
ISBN-13: 3030881091
DOWNLOAD EBOOKThis book provides a detailed exposition of a wide range of topics in geometric group theory, inspired by Gromov’s pivotal work in the 1980s. It includes classical theorems on nilpotent groups and solvable groups, a fundamental study of the growth of groups, a detailed look at asymptotic cones, and a discussion of related subjects including filters and ultrafilters, dimension theory, hyperbolic geometry, amenability, the Burnside problem, and random walks on groups. The results are unified under the common theme of Gromov’s theorem, namely that finitely generated groups of polynomial growth are virtually nilpotent. This beautiful result gave birth to a fascinating new area of research which is still active today. The purpose of the book is to collect these naturally related results together in one place, most of which are scattered throughout the literature, some of them appearing here in book form for the first time. In this way, the connections between these topics are revealed, providing a pleasant introduction to geometric group theory based on ideas surrounding Gromov's theorem. The book will be of interest to mature undergraduate and graduate students in mathematics who are familiar with basic group theory and topology, and who wish to learn more about geometric, analytic, and probabilistic aspects of infinite groups.
Author: Wolfgang Woess
Publisher: Cambridge University Press
Published: 2000-02-13
Total Pages: 350
ISBN-13: 0521552923
DOWNLOAD EBOOKThe main theme of this book is the interplay between the behaviour of a class of stochastic processes (random walks) and discrete structure theory. The author considers Markov chains whose state space is equipped with the structure of an infinite, locally finite graph, or as a particular case, of a finitely generated group. The transition probabilities are assumed to be adapted to the underlying structure in some way that must be specified precisely in each case. From the probabilistic viewpoint, the question is what impact the particular type of structure has on various aspects of the behaviour of the random walk. Vice-versa, random walks may also be seen as useful tools for classifying, or at least describing the structure of graphs and groups. Links with spectral theory and discrete potential theory are also discussed. This book will be essential reading for all researchers working in stochastic process and related topics.
Author: Vadim Kaimanovich
Publisher: Walter de Gruyter
Published: 2008-08-22
Total Pages: 545
ISBN-13: 3110198088
DOWNLOAD EBOOKDie jüngsten Entwicklungen zeigen, dass sich Wahrscheinlichkeitsverfahren zu einem sehr wirkungsvollen Werkzeug entwickelt haben, und das auf so unterschiedlichen Gebieten wie statistische Physik, dynamische Systeme, Riemann'sche Geometrie, Gruppentheorie, harmonische Analyse, Graphentheorie und Informatik.
Author: Gerald L. Alexanderson
Publisher: Cambridge University Press
Published: 2000-04-27
Total Pages: 324
ISBN-13: 9780883855287
DOWNLOAD EBOOKBoth a biography of Plya's life, and a review of his many mathematical achievements by today's experts.
Author: Asaf Nachmias
Publisher: Springer Nature
Published: 2019-10-04
Total Pages: 126
ISBN-13: 3030279685
DOWNLOAD EBOOKThis open access book focuses on the interplay between random walks on planar maps and Koebe’s circle packing theorem. Further topics covered include electric networks, the He–Schramm theorem on infinite circle packings, uniform spanning trees of planar maps, local limits of finite planar maps and the almost sure recurrence of simple random walks on these limits. One of its main goals is to present a self-contained proof that the uniform infinite planar triangulation (UIPT) is almost surely recurrent. Full proofs of all statements are provided. A planar map is a graph that can be drawn in the plane without crossing edges, together with a specification of the cyclic ordering of the edges incident to each vertex. One widely applicable method of drawing planar graphs is given by Koebe’s circle packing theorem (1936). Various geometric properties of these drawings, such as existence of accumulation points and bounds on the radii, encode important probabilistic information, such as the recurrence/transience of simple random walks and connectivity of the uniform spanning forest. This deep connection is especially fruitful to the study of random planar maps. The book is aimed at researchers and graduate students in mathematics and is suitable for a single-semester course; only a basic knowledge of graduate level probability theory is assumed.
Author: Brian H. Kaye
Publisher: John Wiley & Sons
Published: 2008-07-11
Total Pages: 452
ISBN-13: 3527615989
DOWNLOAD EBOOKFractal geometry is revolutionizing the descriptive mathematics of applied materials systems. Rather than presenting a mathematical treatise, Brian Kaye demonstrates the power of fractal geometry in describing materials ranging from Swiss cheese to pyrolytic graphite. Written from a practical point of view, the author assiduously avoids the use of equations while introducing the reader to numerous interesting and challenging problems in subject areas ranging from geography to fine particle science. The second edition of this successful book provides up-to-date literature coverage of the use of fractal geometry in all areas of science. From reviews of the first edition: "...no stone is left unturned in the quest for applications of fractal geometry to fine particle problems....This book should provide hours of enjoyable reading to those wishing to become acquainted with the ideas of fractal geometry as applied to practical materials problems." MRS Bulletin
Author: M. T. Barlow
Publisher: Cambridge University Press
Published: 2017-02-23
Total Pages: 239
ISBN-13: 1107674425
DOWNLOAD EBOOKUseful but hard-to-find results enrich this introduction to the analytic study of random walks on infinite graphs.
Author: Rabi Bhattacharya
Publisher: Springer Nature
Published: 2021-09-20
Total Pages: 396
ISBN-13: 303078939X
DOWNLOAD EBOOKThis textbook offers an approachable introduction to stochastic processes that explores the four pillars of random walk, branching processes, Brownian motion, and martingales. Building from simple examples, the authors focus on developing context and intuition before formalizing the theory of each topic. This inviting approach illuminates the key ideas and computations in the proofs, forming an ideal basis for further study. Consisting of many short chapters, the book begins with a comprehensive account of the simple random walk in one dimension. From here, different paths may be chosen according to interest. Themes span Poisson processes, branching processes, the Kolmogorov–Chentsov theorem, martingales, renewal theory, and Brownian motion. Special topics follow, showcasing a selection of important contemporary applications, including mathematical finance, optimal stopping, ruin theory, branching random walk, and equations of fluids. Engaging exercises accompany the theory throughout. Random Walk, Brownian Motion, and Martingales is an ideal introduction to the rigorous study of stochastic processes. Students and instructors alike will appreciate the accessible, example-driven approach. A single, graduate-level course in probability is assumed.
Author: A. A. Borovkov
Publisher: Cambridge University Press
Published: 2020-10-29
Total Pages: 437
ISBN-13: 1108901204
DOWNLOAD EBOOKThis is a companion book to Asymptotic Analysis of Random Walks: Heavy-Tailed Distributions by A.A. Borovkov and K.A. Borovkov. Its self-contained systematic exposition provides a highly useful resource for academic researchers and professionals interested in applications of probability in statistics, ruin theory, and queuing theory. The large deviation principle for random walks was first established by the author in 1967, under the restrictive condition that the distribution tails decay faster than exponentially. (A close assertion was proved by S.R.S. Varadhan in 1966, but only in a rather special case.) Since then, the principle has always been treated in the literature only under this condition. Recently, the author jointly with A.A. Mogul'skii removed this restriction, finding a natural metric for which the large deviation principle for random walks holds without any conditions. This new version is presented in the book, as well as a new approach to studying large deviations in boundary crossing problems. Many results presented in the book, obtained by the author himself or jointly with co-authors, are appearing in a monograph for the first time.
