Search arXivSearch

arXiv · 1908.10025

On the effective impedance of finite and infinite networks

Abstract

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 depending on a complex parameter $λ$ (by the physical meaning, $λ=iω$, where $ω$ is the frequency of the AC). For finite networks, we prove some estimates of the effective impedance. Using these estimates, we show that, for infinite networks, the sequence of impedances of finite graph approximations converges in certain domains in $\mathbb{C}$ to a holomorphic function of $λ$, which allows us to define the effective impedance of the infinite network.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anna Muranova. 2019-08-26. On the effective impedance of finite and infinite networks. https://doi.org/10.1007/s11118-021-09901-8

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO