Alexander Grigor'yan (43 results)

hardcover. Condition: Very Good. Hardcover, no dust jacket. Very good condition. Previous owners name written discreetly on the front free endpaper. No date on the title page. Copyright page dated 2000. 326 pages. Pages are free of any writing or markings. This description is written by a real person, who is holding the book in front of them to make sure it's properly described. Please send us an email if you have questions or would like to request photos.…

Paperback. Condition: Very Good. Explores the discrete Laplace operator on finite and infinite graphs. The eigenvalues of the discrete Laplace operator have long been used in graph theory as a convenient tool for understanding the structure of complex graphs. They can also be used in order to estimate the rate of convergence to equilibrium of a random walk on finite graphs.…

Condition: New.

Paperback. Condition: New. A central object of this book is the discrete Laplace operator on finite and infinite graphs. The eigenvalues of the discrete Laplace operator have long been used in graph theory as a convenient tool for understanding the structure of complex graphs. They can also be used in order to estimate the rate of convergence to equilibrium of a random walk (Markov chain) on finite graphs. For infinite graphs, a study of the heat kernel allows to solve the type problem-a problem of deciding whether the random walk is recurrent or transient.This book starts with elementary properties of the eigenvalues on finite graphs, continues with their estimates and applications, and concludes with heat kernel estimates on infinite graphs and their application to the type problem. The book is suitable for beginners in the subject and accessible to undergraduate and graduate students with a background in linear algebra I and analysis I. It is based on a lecture course taught by the author and includes a wide variety of exercises. The book will help the reader to reach a level of understanding sufficient to start pursuing research in this exciting area.…

PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.

Paperback. Condition: Very Good. Explores the discrete Laplace operator on finite and infinite graphs. The eigenvalues of the discrete Laplace operator have long been used in graph theory as a convenient tool for understanding the structure of complex graphs. They can also be used in order to estimate the rate of convergence to equilibrium of a random walk on finite graphs.…

Hardcover. Condition: Very Good. Some pencil notes.

Paperback. Condition: Brand New. 150 pages. 9.75x7.00x0.50 inches. In Stock.

Condition: As New. Unread book in perfect condition.

Condition: New.

Paperback / softback. Condition: New. New copy - Usually dispatched within 4 working days.

Condition: As New. Unread book in perfect condition.

Paperback. Condition: Brand New. 476 pages. 10.00x7.00x1.08 inches. In Stock.

Condition: New. In English.

Hardcover. Condition: Very Good. No Dust Jacket. Hard cover, no jacket, in very good condition. From the collection of a London Professor of Mathematics, (ret'd.). Light shelfwear only; minor discolouration to pageblock head, otherwise in fine condition, pages tightly bound, content unmarked. CN.

Taschenbuch. Condition: Neu. Neuware - Explores the discrete Laplace operator on finite and infinite graphs. The eigenvalues of the discrete Laplace operator have long been used in graph theory as a convenient tool for understanding the structure of complex graphs. They can also be used in order to estimate the rate of convergence to equilibrium of a random walk on finite graphs.…

Condition: New. Series: AMS/IP Studies in Advanced Mathematics. Num Pages: 482 pages. BIC Classification: PBMS. Category: (P) Professional & Vocational. . . 2012. Paperback. . . . .

Condition: New.

Paperback. Condition: New. A central object of this book is the discrete Laplace operator on finite and infinite graphs. The eigenvalues of the discrete Laplace operator have long been used in graph theory as a convenient tool for understanding the structure of complex graphs. They can also be used in order to estimate the rate of convergence to equilibrium of a random walk (Markov chain) on finite graphs. For infinite graphs, a study of the heat kernel allows to solve the type problem-a problem of deciding whether the random walk is recurrent or transient.This book starts with elementary properties of the eigenvalues on finite graphs, continues with their estimates and applications, and concludes with heat kernel estimates on infinite graphs and their application to the type problem. The book is suitable for beginners in the subject and accessible to undergraduate and graduate students with a background in linear algebra I and analysis I. It is based on a lecture course taught by the author and includes a wide variety of exercises. The book will help the reader to reach a level of understanding sufficient to start pursuing research in this exciting area.…

Condition: New. Series: AMS/IP Studies in Advanced Mathematics. Num Pages: 482 pages. BIC Classification: PBMS. Category: (P) Professional & Vocational. . . 2012. Paperback. . . . . Books ship from the US and Ireland.

Condition: As New. Unread book in perfect condition.

Condition: New.

Condition: very good. Gut/Very good: Buch bzw. Schutzumschlag mit wenigen Gebrauchsspuren an Einband, Schutzumschlag oder Seiten. / Describes a book or dust jacket that does show some signs of wear on either the binding, dust jacket or pages.

Condition: As New. Unread book in perfect condition.

paperback. Condition: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.

Condition: New. In English.

Condition: New.

Condition: New.

Condition: As New. Unread book in perfect condition.