Convergence of the probabilistic interpretation of modulus
From MaRDI portal
Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Length, area, volume, other geometric measure theory (28A75) Capacity and harmonic measure in the complex plane (30C85) Programming involving graphs or networks (90C35)
Cites work
- Beurling's criterion and extremal metrics for Fuglede modulus
- Blocking duality for \(p\)-modulus on networks and applications
- Determination of the modulus of quadrilaterals by finite element methods
- Graphs and geometry
- scientific article; zbMATH DE number 54314 (Why is no real title available?)
- scientific article; zbMATH DE number 3596197 (Why is no real title available?)
- scientific article; zbMATH DE number 1515832 (Why is no real title available?)
- scientific article; zbMATH DE number 2174317 (Why is no real title available?)
- scientific article; zbMATH DE number 3427691 (Why is no real title available?)
- Minimal subfamilies and the probabilistic interpretation for modulus on graphs
- Modulus of continuity of harmonic functions
- Modulus of families of walks on graphs
- Modulus on graphs as a generalization of standard graph theoretic quantities
- On the sharp lower bound for duality of modulus
- Probability on trees and networks
- Reprint of: Delaunay refinement algorithms for triangular mesh generation
- The boundary value problem for discrete analytic functions
- The Dirichlet problem for orthodiagonal maps
- The dissection of rectangles into squares
- Tiling by rectangles and alternating current
This page was built for publication: Convergence of the probabilistic interpretation of modulus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6977186)