相关论文: Metric and ultrametric inequalities for resistance…

The graphical notion of effective resistance has found wide-ranging applications in many areas of pure mathematics, applied mathematics and control theory. By the nature of its construction, effective resistance can only be computed in…

Let $G$ be a finite plane multigraph and $G'$ its dual. Each edge $e$ of $G$ is interpreted as a resistor of resistance $R_e$, and the dual edge $e'$ is assigned the dual resistance $R_{e'}:=1/R_e$. Then the equivalent resistance $r_e$ over…

In Part I of this work we defined a generalization of the concept of effective resistance to directed graphs, and we explored some of the properties of this new definition. Here, we use the theory developed in Part I to compute effective…

Let $G=(V(G),E(G))$ be a graph with vertex set $V(G)$ and edge set $E(G)$. The resistance distance $R_G(x,y)$ between two vertices $x,y$ of $G$ is defined to be the effective resistance between the two vertices in the corresponding…

In causal inference on directed acyclic graphs, the orientation of edges is in general only recovered up to Markov equivalence classes. We study Markov equivalence classes of uniformly random directed acyclic graphs. Using a tower…

We give identities for the voltage and resistance functions on a metrized graph to show how these functions behave under any edge deletion/contraction and the identification of any two vertices. This leads to explicit versions of Rayleigh's…

Effective resistances are ubiquitous in graph algorithms and network analysis. In this work, we study sublinear time algorithms to approximate the effective resistance of an adjacent pair $s$ and $t$. We consider the classical adjacency…

A generalized Ohm's law is derived to treat strongly magnetized plasmas in which the electron gyrofrequency significantly exceeds the electron plasma frequency. The frictional drag due to Coulomb collisions between electrons and ions is…

Let $r(u,v)$ be the resistance distance between two vertices $u, v$ of a simple graph $G$, which is the effective resistance between the vertices in the corresponding electrical network constructed from $G$ by replacing each edge of $G$…

We study the resilience of random and pseudorandom directed graphs with respect to the property of having long directed cycles. For every $0 < \gamma < 1/2$ we find a constant $c=c(\gamma)$ such that the following holds. Let $G=(V,E)$ be a…

Let $G$ be a strongly connected and balanced directed graph. The Laplacian matrix of $G$ is then the matrix (not necessarily symmetric) $L:=D-A$, where $A$ is the adjacency matrix of $G$ and $D$ is the diagonal matrix such that the row sums…

This work presents a new method for symmetrization of directed graphs that constructs an undirected graph with equivalent pairwise effective resistances as a given directed graph. Consequently a graph metric, square root of effective…

Resistance distance has been studied extensively in the past years, with the majority of previous studies devoted to undirected networks, in spite of the fact that various realistic networks are directed. Although several generalizations of…

The concept of effective resistance, originally introduced in electrical circuit theory, has been extended to the setting of graphs by interpreting each edge as a resistor. In this context, the effective resistance between two vertices…

The notion of resistance distance, introduced by Klein and Randi\'c, has become a fundamental concept in spectral graph theory and network analysis, as it captures both the structural and electrical properties of a graph. The associated…

We study theoretically electronic transport through a normal metal-- superconductor (NS) interface and show that more than one conductance may be defined, depending on the pair of chemical potentials whose difference one chooses to relate…

This paper extends the definitions of effective resistance and effective conductance to characterize the overall relation (positive coupling or antagonism) between any two disjoint sets of nodes in a signed graph. It generalizes the…

The behavior of the electromagnetic field near a common edge of a resistive half-plane and a perfectly conducting wedge is investigated. The possible appearance besides power terms also of logarithmic functions in the field expansions at…

We consider infinite weighted graphs $G$, i.e., sets of vertices $V$, and edges $E$ assumed countable infinite. An assignment of weights is a positive symmetric function $c$ on $E$ (the edge-set), conductance. From this, one naturally…

For a connected graph $G$, its resistance distance matrix is denoted by $R(G)$. A graph is called resistance regular if all the row (or column) sums of $R(G)$ are equal. We provide a necessary and sufficient condition for a simple connected…