Tech Quarto
Search Advanced SearchView Cart   Checkout   
 Location:  Home » Mobile & Wireless » Random Walks and Electrical Networks (Carus Mathematical Monographs)  
Categories
Computer Science
The Internet
For Dummies
Web Browsers
Windows
Digital Culture
Multimedia
Mobile & Wireless
Visit Laptop Nirvana for the best Cheap Discount Laptops
Bestsellers
Microwave Transmission Networks : Planning, Design and Deployment
Privatization, Restructuring, and Regulation of Network Utilities (Walras-Pareto Lectures)
Practical Network Cabling (Practical)
Network Design Basics for Cabling Professionals
Passive and Active Network Analysis and Synthesis
Electrical Spectrum & Network Analyzers: A Practical Approach
Network Analysis with Applications (4th Edition)
Signals and Linear Systems
FACTS: Modelling and Simulation in Power Networks
Random Walks and Electrical Networks (Carus Mathematical Monographs)

Random Walks and Electrical Networks (Carus Mathematical Monographs)

Random Walks and Electrical Networks (Carus Mathematical Monographs)

zoom enlarge 
Authors: Peter G. Doyle, J. Laurie Snell
Publisher: Mathematical Assn of America
Category: Book

Buy Used: $166.30



Used (2) from $166.30

Avg. Customer Rating: 5.0 out of 5 stars 4 reviews
Sales Rank: 1321322

Media: Hardcover
Number Of Items: 1
Pages: 159
Shipping Weight (lbs): 0.7
Dimensions (in): 8 x 5.1 x 0.7

ISBN: 0883850249
Dewey Decimal Number: 519.282
EAN: 9780883850244
ASIN: 0883850249

Publication Date: December 1984
Availability: Usually ships in 1-2 business days
Shipping: International shipping available
Condition: Excellent customer service. Order inquiries handled promptly.

Customer Reviews:

5 out of 5 stars Excellent   January 14, 2007
This book is a real and rare gem of mathematical teaching. It explains in easy and accessible language the links between the topics in the title with remarkable clarity and simplicity. Of course the real strength of a book like this is to show to beginner mathematicians the power one can acquire by looking at a given problem from several perspectives, and this is where the book really excels.
The authors are doing a great job in reducing all concepts to the essential, but never - on the other side - trivializing or leaving essential things unexplained. College algebra is all what is required to understand it, and you will certainly be rewarded.



5 out of 5 stars Relationship between Random Walks and Electric Networks!   January 27, 2002
 3 out of 3 found this review helpful

The book brings together two of my passions : random
walks and electric networks. It turns out that there are
interesting relationships between these two areas, so insights
in one provide can be used to prove things in the other.

There is this beautiful theorem by Polya which states that a
random walker on an infinite street network in d-dimensional
space is bound to return to the starting point when d = 2,
but has a positive probability of escaping to infinity without
returning to the starting point when d >= 3. The book
reinterprets this theorem as a statement about electric networks,
and then proves the theorem using techniques from classical
network theory. The proof relies on showing that the resistance
of the corresponding electric network in 1 and 2 dimensions
is infinite, whereas it is finite in the 3 dimensional case.
Thus some current [like our random walker] can flow to infinity.

Strongly recommended!. Also check out Peter Doyle's webpage
at Dartmouth "http://math.dartmouth.edu/~doyle/"


5 out of 5 stars Relationship between Random Walks and Electric Networks!   January 27, 2002
 4 out of 4 found this review helpful

The book brings together two of my passions : random
walks and electric networks. It turns out that there are
interesting relationships between these two areas, so insights
in one can be used to prove things in the other.

There is this beautiful theorem by Polya which states that a
random walker on an infinite street network in d-dimensional
space is bound to return to the starting point when d = 2,
but has a positive probability of escaping to infinity without
returning to the starting point when d >= 3. The book
reinterprets this theorem as a statement about electric networks,
and then proves the theorem using techniques from classical
network theory. The proof relies on showing that the resistance
of the corresponding electric network in 1 and 2 dimensions
is infinite, whereas it is finite in the 3 dimensional case.
Thus some current [like our random walker] can flow to infinity.

Strongly recommended!.


5 out of 5 stars cool analogies   April 1, 2001
This book provides fascinating insights and analogies between random walks and electric networks- and how you can exploit these analogies to solve difficult problems in one using the other... there's also a nice proof of the "Polya's theorem" using these analogies- basically Polya's theorem says that a random walk in dimensions >2 is transient, while a random walk on a plane or a line always returns to its starting point...

Powered by Associate-O-Matic