Let $G=(V,E)$ be a network. Each arc $e$ has a resistance $r_e>0$. Let $f_e$ be the current flowing though $e=(u,v)$. By Ohm's law we know that a voltage $\phi$ is induced on the nodes and $f_e = \frac{\phi_u - \phi_v}{r_e}$. We define the electical energy of the network as $\mathcal{E}_r(f) = \sum_e f_e^2 r_e$. Note that $\phi$ is a mapping from the node set to $\mathbb{R}$. Given a real number $x$, define $E_x=\{e=(u,v)\in E : \min(\phi_u,\phi_v)\leq x\leq \max(\phi_u,\phi_v)\}$. Also $F_x=\sum_{e\in E_x}f_e$. Now show that $\int_{\mathbb{R}}F(x)dx = \mathcal{E}_r(f)$. I think this follows from the definition of integration, but can not find the connection. I am asking this question question in relation to max-flow computation using electrical flows.
2026-03-27 10:44:49.1774608289
A question about electrical energy in a network
58 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in INTEGRATION
- How can I prove that $\int_0^{\frac{\pi}{2}}\frac{\ln(1+\cos(\alpha)\cos(x))}{\cos(x)}dx=\frac{1}{2}\left(\frac{\pi^2}{4}-\alpha^2\right)$?
- How to integrate $\int_{0}^{t}{\frac{\cos u}{\cosh^2 u}du}$?
- Show that $x\longmapsto \int_{\mathbb R^n}\frac{f(y)}{|x-y|^{n-\alpha }}dy$ is integrable.
- How to find the unit tangent vector of a curve in R^3
- multiplying the integrands in an inequality of integrals with same limits
- Closed form of integration
- Proving smoothness for a sequence of functions.
- Random variables in integrals, how to analyze?
- derive the expectation of exponential function $e^{-\left\Vert \mathbf{x} - V\mathbf{x}+\mathbf{a}\right\Vert^2}$ or its upper bound
- Which type of Riemann Sum is the most accurate?
Related Questions in GRAPH-THEORY
- characterisation of $2$-connected graphs with no even cycles
- Explanation for the static degree sort algorithm of Deo et al.
- A certain partition of 28
- decomposing a graph in connected components
- Is it true that if a graph is bipartite iff it is class 1 (edge-coloring)?
- Fake induction, can't find flaw, every graph with zero edges is connected
- Triangle-free graph where every pair of nonadjacent vertices has exactly two common neighbors
- Inequality on degrees implies perfect matching
- Proving that no two teams in a tournament win same number of games
- Proving that we can divide a graph to two graphs which induced subgraph is connected on vertices of each one
Related Questions in NETWORK
- On the Hex/Nash connection game theorem
- minimal number of edges for a graph of size N so that there are two paths between any pair of nodes
- what is mean "Number of connected Triplets of vertices" in global clustering
- What is this "logarithmic golden ratio of scale-free networks" really called?
- Are there textbooks or resources on the mathematics of networks?
- Proving an inequality when a graph is not connected
- Probability of at least two bits
- Probability in terms of slots wasted during network contention
- Network Science: Terminology for graphs with different kinds of edges
- Number of Spanning Trees With A Relation to Contraction of Graph
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Note that the energy can also be written as $\sum_e \Delta \phi(e)^2/r_e$. (To a physicist, this is the familiar $P=IV=I^2 R=V^2/R$ formula, but you don't need to know anything about electromagnetism to get this.) Now each edge contributes to the integral of $F$ on an interval of length $\Delta \phi(e)$, and contributes $f_e=\Delta \phi(e)/r_e$ there. Multiplying that gives that the contribution of each edge to the integral is $\Delta \phi(e)^2/r_e$; summing over edges gives the desired result.