Discrete Extremal Length
Suppose that is some graph and is a collection of paths in . There are two variants of extremal length in this setting. To define the edge extremal length, originally introduced by R. J. Duffin, consider a function . The -length of a path is defined as the sum of over all edges in the path, counted with multiplicity. The "area" is defined as . The extremal length of is then defined as before. If is interpreted as a resistor network, where each edge has unit resistance, then the effective resistance between two sets of veritces is precisely the edge extremal length of the collection of paths with one endpoint in one set and the other endpoint in the other set. Thus, discrete extremal length is useful for estimates in discrete potential theory.
Another notion of discrete extremal length that is appropriate in other contexts is vertex extremal length, where, the area is, and the length of a path is the sum of over the vertices visited by the path, with multiplicity.
Read more about this topic: Extremal Length
Famous quotes containing the words discrete and/or length:
“The mastery of one’s phonemes may be compared to the violinist’s mastery of fingering. The violin string lends itself to a continuous gradation of tones, but the musician learns the discrete intervals at which to stop the string in order to play the conventional notes. We sound our phonemes like poor violinists, approximating each time to a fancied norm, and we receive our neighbor’s renderings indulgently, mentally rectifying the more glaring inaccuracies.”
—W.V. Quine (b. 1908)
“Rivers must have been the guides which conducted the footsteps of the first travelers. They are the constant lure, when they flow by our doors, to distant enterprise and adventure; and, by a natural impulse, the dwellers on their banks will at length accompany their currents to the lowlands of the globe, or explore at their invitation the interior of continents.”
—Henry David Thoreau (1817–1862)