The extremal length of a network
From MaRDI portal
Cites work
- An Analysis of the Wang Algebra of Networks
- scientific article; zbMATH DE number 3121286 (Why is no real title available?)
- scientific article; zbMATH DE number 3121292 (Why is no real title available?)
- scientific article; zbMATH DE number 3142372 (Why is no real title available?)
- scientific article; zbMATH DE number 3150629 (Why is no real title available?)
- scientific article; zbMATH DE number 3312693 (Why is no real title available?)
- Maximal Flow Through a Network
- Monotone networks
Cited in
(65)- Combinatorial modulus and type of graphs
- Extremal length of an infinite network related to an accessible boundary point
- Reexamination of Ohm's law and a relation to generalized analytic functions
- Square tilings with prescribed combinatorics
- The combinatorial Riemann mapping theorem
- The random pseudo-metric on a graph defined via the zero-set of the Gaussian free field on its metric graph
- Hyperbolic and parabolic packings
- Circuit duality for recurrent Markov processes
- Transboundary extremal length
- The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs
- Shortest paths in distance-regular graphs
- Testing idealness in the filter oracle model
- Inverse optimization problems with multiple weight functions
- Generalization of effective conductance centrality for egonetworks
- First passage sets of the 2D continuum Gaussian free field
- Entire functions arising from trees
- Hyperbolic and parabolic unimodular random maps
- Discrete uniformizing metrics on distributional limits of sphere packings
- Blocking duality for \(p\)-modulus on networks and applications
- Deltas, extended odd holes and their blockers
- Energy and length in a topological planar quadrilateral
- Estimating Dirichlet's integral and electrical conductance for systems which are not self-adjoint
- Robust discrete complex analysis: a toolbox
- Modulus on graphs as a generalization of standard graph theoretic quantities
- Single commodity-flow algorithms for lifts of graphic and cographic matroids
- Functions with finite Dirichlet sum of order p and quasi-monomorphisms of infinite graphs
- From rubber bands to rational maps: a research report
- Random infinite squarings of rectangles
- Generalized network measures based on modulus of families of walks
- A survey on flows in graphs and matroids
- Bounded outdegree and extremal length on discrete Riemann surfaces
- Boundary value problems on planar graphs and flat surfaces with integer cone singularities, I: The Dirichlet problem
- Heat kernels on infinite graph networks and deformed Sierpinski gaskets
- Random walk on the Speiser graph of a Riemann surface
- Combinatorics encoding geometry: the legacy of Bill Thurston in the story of one theorem
- A Thomson's principle and a Rayleigh's monotonicity law for nonlinear networks
- Extremal Length and Width of Blocking Polyhedra, Kirchhoff Spaces and Multiport Networks
- On the width—length inequality
- A homogenization result for planar, polygonal networks
- Extremal length and rayleigh's reciprocal theorem
- Extremal length and rayleigh's reciprocal theorem
- On the width-length inequality
- Rough Isometries and Dirichlet Finite Harmonic Functions on Graphs
- Modulus of families of walks on graphs
- Packing rooted directed cuts in a weighted directed graph
- Lack of sphere packing of graphs via nonlinear potential theory
- Some criteria for circle packing types and combinatorial Gauss-Bonnet theorem
- EXPANSION CONSTANTS AND HYPERBOLIC EMBEDDINGS OF FINITE GRAPHS
- Elastic graphs
- Minimal subfamilies and the probabilistic interpretation for modulus on graphs
- Boundary value problems on planar graphs and flat surfaces with integer cone singularities. II: The mixed Dirichlet-Neumann problem
- Blocking and anti-blocking pairs of polyhedra
- Perfect, ideal and balanced matrices
- Spanning tree modulus for secure broadcast games
- Relations between scaling exponents in unimodular random graphs
- On limits of graphs sphere packed in Euclidean space and applications
- Oded Schramm: from circle packing to SLE
- Rigidity of the Delaunay triangulations of the plane
- Path planning with divergence-based distance functions
- Disk patterns, quasi-duality and the uniform bounded diameter conjecture
- From coordinate subspaces over finite fields to ideal multipartite uniform clutters
- Ideal clutters
- Topics in geometric theory of meromorphic functions
- Rapidly growing entire functions with three singular values
- Characterization of the Walrasian equilibria of the assignment model
This page was built for publication: The extremal length of a network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1130499)
