Electrical networks with prescribed current and applications to random walks on graphs
From MaRDI portal
Publication:1737102
DOI10.3934/ipi.2019018zbMath1410.35287arXiv1703.02252OpenAlexW2594097718WikidataQ128550722 ScholiaQ128550722MaRDI QIDQ1737102
Christina Knox, Amir Moradifam
Publication date: 26 March 2019
Published in: Inverse Problems and Imaging (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.02252
Inverse problems for PDEs (35R30) Circuits, networks (94C99) Inverse problems in optimal control (49N45) Random walks on graphs (05C81)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Operator splittings, Bregman methods and frame shrinkage in image processing
- A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Existence and uniqueness of minimizers of general least gradient problems
- Current Density Impedance Imaging of an Anisotropic Conductivity in a Known Conformal Class
- Current density impedance imaging
- Equipotential line method for magnetic resonance electrical impedance tomography
- A convergent algorithm for the hybrid problem of reconstructing conductivity from minimal interior data
- The Split Bregman Method for L1-Regularized Problems
- Split Bregman Methods and Frame Based Image Restoration
- Recovering the conductivity from a single measurement of interior data
- Uniqueness and convergence of conductivity image reconstruction in magnetic resonance electrical impedance tomography
- On a Nonlinear Partial Differential Equation Arising in Magnetic Resonance Electrical Impedance Tomography
- Conductivity Imaging from One Interior Measurement in the Presence of Perfectly Conducting and Insulating Inclusions
- Existence and structure of minimizers of least gradient problems
- $\omega$-Harmonic Functions and Inverse Conductivity Problems on Networks
- Reconstruction of Planar Conductivities in Subdomains from Incomplete Data
- Coalescing Random Walks and Voting on Connected Graphs
- Conductivity imaging with a single measurement of boundary and interior data
- A Weighted Minimum Gradient Problem with Complete Electrode Model Boundary Conditions for Conductivity Imaging
This page was built for publication: Electrical networks with prescribed current and applications to random walks on graphs