|
![]() |
|||
|
||||
OverviewEinstein proved that the mean square displacement of Brownian motion is proportional to time. He also proved that the diffusion constant depends on the mass and on the conductivity (sometimes referred to Einstein’s relation). The main aim of this book is to reveal similar connections between the physical and geometric properties of space and diffusion. This is done in the context of random walks in the absence of algebraic structure, local or global spatial symmetry or self-similarity. The author studies the heat diffusion at this general level and discusses the following topics: The multiplicative Einstein relation, Isoperimetric inequalities, Heat kernel estimates Elliptic and parabolic Harnack inequality. Full Product DetailsAuthor: Andras TelcsPublisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K Edition: 2006 ed. Volume: 1885 Dimensions: Width: 15.50cm , Height: 1.10cm , Length: 23.50cm Weight: 0.454kg ISBN: 9783540330271ISBN 10: 3540330275 Pages: 200 Publication Date: 17 May 2006 Audience: College/higher education , Undergraduate Format: Paperback Publisher's Status: Active Availability: Out of stock ![]() The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available. Table of ContentsReviewsFrom the reviews: <p> This book studies random walks on countable infinite connected weighted graphs, with particular emphasis on fractal graphs like the Sierpinski triangular graph or the weighted Vicsek tree. a ] The book is intended to be self-contained and accessible to graduate and Ph.D. students. It contains a wealth of references, also on various aspects of random walks not covered by the text. (Wolfgang KAnig, Mathematical Reviews, Issue 2007 d) <p> This book studies random walks on countable infinite connected weighted graphs, with particular emphasis on fractal graphs like the Sierpinski triangular graph or the weighted Vicsek tree. a ] The book is intended to be self-contained and accessible to graduate and PhD students. It contains a wealth of references, also on various aspects of random walks not covered by the text. At the end of the book a list of some dozens of types of inequalities appear that are introduced in the book (Wolfgang KAnig, Zentralblatt MATH, Vol. 1104 (6), 2007) From the reviews: This book studies random walks on countable infinite connected weighted graphs, with particular emphasis on fractal graphs like the Sierpinski triangular graph or the weighted Vicsek tree. ... The book is intended to be self-contained and accessible to graduate and Ph.D. students. It contains a wealth of references, also on various aspects of random walks not covered by the text. (Wolfgang Konig, Mathematical Reviews, Issue 2007 d) This book studies random walks on countable infinite connected weighted graphs, with particular emphasis on fractal graphs like the Sierpinski triangular graph or the weighted Vicsek tree. ... The book is intended to be self-contained and accessible to graduate and PhD students. It contains a wealth of references, also on various aspects of random walks not covered by the text. At the end of the book a list of some dozens of types of inequalities appear that are introduced in the book (Wolfgang Konig, Zentralblatt MATH, Vol. 1104 (6), 2007) From the reviews: This book studies random walks on countable infinite connected weighted graphs, with particular emphasis on fractal graphs like the Sierpinski triangular graph or the weighted Vicsek tree. ! The book is intended to be self-contained and accessible to graduate and Ph.D. students. It contains a wealth of references, also on various aspects of random walks not covered by the text. (Wolfgang Konig, Mathematical Reviews, Issue 2007 d) This book studies random walks on countable infinite connected weighted graphs, with particular emphasis on fractal graphs like the Sierpinski triangular graph or the weighted Vicsek tree. ! The book is intended to be self-contained and accessible to graduate and PhD students. It contains a wealth of references, also on various aspects of random walks not covered by the text. At the end of the book a list of some dozens of types of inequalities appear that are introduced in the book (Wolfgang Konig, Zentralblatt MATH, Vol. 1104 (6), 2007) "From the reviews: ""This book studies random walks on countable infinite connected weighted graphs, with particular emphasis on fractal graphs like the Sierpinski triangular graph or the weighted Vicsek tree. ! The book is intended to be self-contained and accessible to graduate and Ph.D. students. It contains a wealth of references, also on various aspects of random walks not covered by the text."" (Wolfgang Konig, Mathematical Reviews, Issue 2007 d) ""This book studies random walks on countable infinite connected weighted graphs, with particular emphasis on fractal graphs like the Sierpinski triangular graph or the weighted Vicsek tree. ! The book is intended to be self-contained and accessible to graduate and PhD students. It contains a wealth of references, also on various aspects of random walks not covered by the text. At the end of the book a list of some dozens of types of inequalities appear that are introduced in the book"" (Wolfgang Konig, Zentralblatt MATH, Vol. 1104 (6), 2007)" Author InformationAndrás Telcs is associated professor of the Budapest University of Technology. Formerly he taught statistics in business schools as well as worked for major libraries. His main research interests are random walks, discrete potential theory, active on different application of probability and statistics. Tab Content 6Author Website:Countries AvailableAll regions |