Signed and weighted graphs (05C22) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Random walks on graphs (05C81) Ordered fields (12J15) Boundary value problems on graphs and networks for ordinary differential equations (34B45) Discrete version of topics in analysis (39A12) Analytic circuit theory (94C05)
Abstract: 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 mathematical models of such networks: complex-weighted graphs and graphs with weight from the ordered field of rational functions. The notion of effective impedance in both approaches is defined.
Recommendations
Cites work
- scientific article; zbMATH DE number 3934150 (Why is no real title available?)
- Introduction to analysis on graphs
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Synthesis of a Finite Two-terminal Network whose Driving-point Impedance is a Prescribed Function of Frequency
Cited in
(11)- Simplicial networks and effective resistance
- On the effective impedance of finite and infinite networks
- Some fundamental transmission properties of impedance transitions
- scientific article; zbMATH DE number 3880539 (Why is no real title available?)
- Why RLC Realizations of Certain Impedances Need Many More Energy Storage Elements Than Expected
- The Impedance Mismatch in Light of the Unified State Model
- Effective impedance over ordered fields
- Random walks, conductance, and resistance for the connection graph Laplacian
- Dynamical processes on metric networks
- Recurrence and transience for non-Archimedean and directed graphs
- Capacity of infinite graphs over non-Archimedean ordered fields
This page was built for publication: On the notion of effective impedance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3389284)
