Operating points in infinite nonlinear networks approximated by finite networks

Calvert, Bruce; Zemanian, Armen

doi:10.1090/S0002-9947-99-02228-X

Operating points in infinite nonlinear networks approximated by finite networks
HTML articles powered by AMS MathViewer

by Bruce D. Calvert and Armen H. Zemanian PDF

Trans. Amer. Math. Soc. 352 (2000), 753-780 Request permission

Abstract:

Given a nonlinear infinite resistive network, an operating point can be determined by approximating the network by finite networks obtained by shorting together various infinite sets of nodes, and then taking a limit of the nodal potential functions of the finite networks. Initially, by taking a completion of the node set of the infinite network under a metric given by the resistances, limit points are obtained that represent generalized ends, which we call “terminals,” of the infinite network. These terminals can be shorted together to obtain a generalized kind of node, a special case of a 1-node. An operating point will involve Kirchhoff’s current law holding at 1-nodes, and so the flow of current into these terminals is studied. We give existence and bounds for an operating point that also has a nodal potential function, which is continuous at the 1-nodes. The existence is derived from the said approximations.

References

Bruce D. Calvert, Infinite nonlinear resistive networks, after Minty, Circuits Systems Signal Process. 15 (1996), no. 6, 727–733. MR 1424109, DOI 10.1007/BF01190125
Bruce D. Calvert, Unicursal resistive networks, Circuits Systems Signal Process. 16 (1997), no. 3, 307–324. MR 1446795, DOI 10.1007/BF01246715
Noel Cressie and Subhash Lele, New models for Markov random fields, J. Appl. Probab. 29 (1992), no. 4, 877–884. MR 1188543, DOI 10.2307/3214720
Vaclav Dolezal, Monotone operators and applications in control and network theory, Studies in Automation and Control, vol. 2, Elsevier Scientific Publishing Co., Amsterdam-New York, 1979. MR 554232
James Dugundji, Topology, Allyn and Bacon, Inc., Boston, Mass., 1966. MR 0193606
Harley Flanders, Infinite networks. I: Resistive networks, IEEE Trans. Circuit Theory CT-18 (1971), 326–331. MR 275998
Albert Eagle, Series for all the roots of the equation $(z-a)^m=k(z-b)^n$, Amer. Math. Monthly 46 (1939), 425–428. MR 6, DOI 10.2307/2303037
R. Halin, Über unendliche Wege in Graphen, Math. Ann. 157 (1964), 125–137 (German). MR 170340, DOI 10.1007/BF01362670
H. A. Jung, Connectivity in infinite graphs, Studies in Pure Mathematics (Presented to Richard Rado), Academic Press, London, 1971, pp. 137–143. MR 0278982
D. König, Theorie der endlichen und unendlichen Graphen, Akademische Verlagsgesellschaft M. B. H., Leipzig, 1936.
Terry Lyons, A simple criterion for transience of a reversible Markov chain, Ann. Probab. 11 (1983), no. 2, 393–402. MR 690136
Masao Iri, Network flow, transportation and scheduling, Mathematics in Science and Engineering, Vol. 57, Academic Press, New York-London, 1969. MR 0281480
G. J. Minty, Monotone networks, Proc. Roy. Soc. London Ser. A 257 (1960), 194–212. MR 120163, DOI 10.1098/rspa.1960.0144
Norbert Polat, Aspects topologiques de la séparation dans les graphes infinis. I, Math. Z. 165 (1979), no. 1, 73–100 (French). MR 521521, DOI 10.1007/BF01175130
Paolo M. Soardi, Approximation of currents in infinite nonlinear resistive networks, Circuits Systems Signal Process. 12 (1993), no. 4, 603–612. MR 1229184, DOI 10.1007/BF01188098
Paolo M. Soardi, Potential theory on infinite networks, Lecture Notes in Mathematics, vol. 1590, Springer-Verlag, Berlin, 1994. MR 1324344, DOI 10.1007/BFb0073995
Wolfgang Woess, Random walks on infinite graphs and groups—a survey on selected topics, Bull. London Math. Soc. 26 (1994), no. 1, 1–60. MR 1246471, DOI 10.1112/blms/26.1.1
Armen H. Zemanian, Infinite electrical networks, Cambridge Tracts in Mathematics, vol. 101, Cambridge University Press, Cambridge, 1991. MR 1144278, DOI 10.1017/CBO9780511895432
A. H. Zemanian, Connectedness in transfinite graphs and the existence and uniqueness of node voltages, Discrete Math. 142 (1995), no. 1-3, 247–269. MR 1341450, DOI 10.1016/0012-365X(93)E0223-Q
Armen H. Zemanian, Transfiniteness, Birkhäuser Boston, Inc., Boston, MA, 1996. For graphs, electrical networks, and random walks. MR 1368633, DOI 10.1007/978-1-4612-0767-2