Search arXivSearch

arXiv · 2009.14316

Metric and ultrametric inequalities for resistances in directed graphs

Abstract

Consider an electrical circuit $G$ each directed edge $e$ of which is a semiconductor with a monomial conductance function $y_e^* = f_e(y_e) = y_e^s / μ_e^r$ if $y_e \geq 0$ and $y_e^* = 0$ if $y_e \leq 0$. Here $e$ is a directed edge, $y_e$ is the potential difference (voltage), $y_e^*$ is the current in $e$, and $μ_e$ is the resistance of $e$; furthermore, $r$ and $s$ are two strictly positive real parameters common for all edges. In particular, case $r = s = 1$ corresponds to the Ohm law, while $r = \frac{1}{2}, s =1$ may be interpreted as the square law of resistance typical for hydraulics and gas dynamics. We will show that for every ordered pair of nodes $a, b$ of the circuit, the effective resistance $μ_{a,b}$ is well-defined. In other words, any two-pole network with poles $a$ and $b$ can be effectively replaced by two oppositely directed edges, from $a$ to $b$ of resistance $μ_{a,b}$ and from $b$ to $a$ of resistance $μ_{b,a}$. Furthermore, for every three nodes $a, b, c$ the inequality $μ_{a,c}^{s/r} + μ_{c,b}^{s/r} \geq μ_{a,b}^{s/r}$ holds, in which the equality is achieved if and only if every directed path from $a$ to $b$ contains $c$. MSC classes: 11J83, 90C25, 94C15,94C99

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vladimir Gurvich. 2020-09-29. Metric and ultrametric inequalities for resistances in directed graphs. https://arxiv.org/abs/2009.14316

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