Related papers: Electric currents in infinite networks
In this paper we deal with the notion of the effective impedance of AC networks consisting of resistances, coils and capacitors. Mathematically such a network is a locally finite graph whose edges are endowed with complex-valued weights…
We show that if the sum of the resistances of an electrical network $N$ is finite, then there is a unique electrical current in $N$ provided we do not allow, in a sense, any flow to escape to infinity.
We develop a method to calculate the persistent currents and their spatial distribution (and transport properties) on graphs made of quasi-1D diffusive wires. They are directly related to the field derivatives of the determinant of a matrix…
In this work, we present novel general analytical solutions for the currents that are developed in the edges of network-like circuits when some nodes of the network act as sources/sinks of DC or AC current. We assume that Ohm's law is valid…
Finding the equivalent resistance of an infinite ladder circuit is a classical problem in physics. We expand this well-known challenge to new classes of network topologies, in which the unit cells are much more entangled together. The exact…
A Riemann-Roch theorem on graph was initiated by M. Baker and S. Norine. In their article [2], a Riemann-Roch theorem on a finite graph with uniform vertex-weight and uniform edge-weight was established and it was suggested a Riemann-Roch…
In infinite graph theory, the notion of ends, first introduced by Freudenthal and Jung for locally finite graphs, plays an important role when generalizing statements from finite graphs to infinite ones. Nash-Willian's Tree-Packing Theorem…
A rooted network consists of a connected, locally finite graph G, equipped with edge conductances and a distinguished vertex o. A nonnegative function on the vertices of G which vanishes at o, has Laplacian 1 at o, and is harmonic at all…
Network theory has unveiled the underlying structure of complex systems such as the Internet or the biological networks in the cell. It has identified universal properties of complex networks, and the interplay between their structure and…
It is known that electrical networks with resistors are related to the Laplace operator and random walk on weighted graphs. In this paper we consider more general electrical networks with coils, capacitors, and resistors. We give two…
We study infinite resistor networks perturbed by line defects, in which the resistances are periodically modified along a single line. Using the Sherman-Morrison identity applied to the reciprocal-space representation of the lattice Green's…
Extending work of Foster, Doyle, and others, we show how the Foster Theorems, a family of results concerning effective resistances on finite graphs, can in certain cases be extended to infinite graphs. A family of sum rules is then…
We consider the directed network (DN) of edge states on the surface of a cylinder of length L and circumference C. By mapping it to a ferromagnetic superspin chain, and using a scaling analysis, we show its equivalence to a one-dimensional…
We survey various aspects of infinite extremal graph theory and prove several new results. The lead role play the parameters connectivity and degree. This includes the end degree. Many open problems are suggested.
One explanation for the impressive recent boom in network theory might be that it provides a promising tool for an understanding of complex systems. Network theory is mainly focusing on discrete large-scale topological structures rather…
For a given infinite connected graph $G=(V,E)$ and an arbitrary but fixed conductance function $c$, we study an associated graph Laplacian $\Delta_{c}$; it is a generalized difference operator where the differences are measured across the…
In this paper, we study properties of effective impedance of finite electrical networks and calculate the effective impedance of a finite ladder network over an ordered field. Moreover, we consider two particular examples of infinite ladder…
We study the inverse problem of determining the conductivity matrix of an electrical network from the prescribed knowledge of the magnitude of the induced current along the edges coupled with the imposed voltage or injected current on the…
A prior work (see Chapter 8 of the book, ``Graphs and Networks: Transfinite and Nonstandard,'' Birkhauser-Boston, Cambridge, Mass., USA, 2004) examined the propagation of an electromagnetic wave on a transfinite transmission line,…
This paper contains the proofs of Theorems 2 and 3 of the article entitled Random Electrical Networks on Complete Graphs, written by the same authors and published in the Journal of the London Mathematical Society, vol. 30 (1984), pp.…