The extremal length of a network
From MaRDI portal
Publication:1130499
DOI10.1016/S0022-247X(62)80004-3zbMath0107.43604WikidataQ92163575 ScholiaQ92163575MaRDI QIDQ1130499
Publication date: 1962
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Related Items
Robust discrete complex analysis: a toolbox, Boundary value problems on planar graphs and flat surfaces with integer cone singularities, I: The Dirichlet problem, 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, The combinatorial Riemann mapping theorem, A homogenization result for planar, polygonal networks, Characterization of the Walrasian equilibria of the assignment model, Hyperbolic and parabolic packings, Generalization of effective conductance centrality for egonetworks, Circuit duality for recurrent Markov processes, A Thomson's principle and a Rayleigh's monotonicity law for nonlinear networks, The random pseudo-metric on a graph defined via the zero-set of the Gaussian free field on its metric graph, Transboundary extremal length, The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs, First passage sets of the 2D continuum Gaussian free field, Heat kernels on infinite graph networks and deformed Sierpinski gaskets, Blocking duality for \(p\)-modulus on networks and applications, Deltas, extended odd holes and their blockers, Spanning tree modulus for secure broadcast games, Relations between scaling exponents in unimodular random graphs, Blocking and anti-blocking pairs of polyhedra, On limits of graphs sphere packed in Euclidean space and applications, Extremal Length and Width of Blocking Polyhedra, Kirchhoff Spaces and Multiport Networks, Oded Schramm: from circle packing to SLE, Shortest paths in distance-regular graphs, Bounded outdegree and extremal length on discrete Riemann surfaces, Path planning with divergence-based distance functions, Energy and length in a topological planar quadrilateral, Reexamination of Ohm's law and a relation to generalized analytic functions, Entire functions arising from trees, Minimal subfamilies and the probabilistic interpretation for modulus on graphs, LACK OF SPHERE PACKING OF GRAPHS VIA NONLINEAR POTENTIAL THEORY, Rough Isometries and Dirichlet Finite Harmonic Functions on Graphs, Ideal clutters, Random walk on the Speiser graph of a Riemann surface, Boundary value problems on planar graphs and flat surfaces with integer cone singularities. II: The mixed Dirichlet-Neumann problem, Extremal length and rayleigh's reciprocal theorem, On the width—length inequality, EXPANSION CONSTANTS AND HYPERBOLIC EMBEDDINGS OF FINITE GRAPHS, Extremal length and rayleigh's reciprocal theorem, Perfect, ideal and balanced matrices, Modulus on graphs as a generalization of standard graph theoretic quantities, Modulus of families of walks on graphs, Rapidly growing entire functions with three singular values, On the width-length inequality, Estimating Dirichlet's integral and electrical conductance for systems which are not self-adjoint, Combinatorics Encoding Geometry: The Legacy of Bill Thurston in the Story of One Theorem, Single Commodity-Flow Algorithms for Lifts of Graphic and CoGraphic Matroids, Unnamed Item, ELASTIC GRAPHS, Combinatorial modulus and type of graphs, Hyperbolic and parabolic unimodular random maps, Discrete uniformizing metrics on distributional limits of sphere packings, Square tilings with prescribed combinatorics, Testing idealness in the filter oracle model, Extremal length of an infinite network related to an accessible boundary point, Packing rooted directed cuts in a weighted directed graph, Some criteria for circle packing types and combinatorial Gauss-Bonnet Theorem, Inverse optimization problems with multiple weight functions
Cites Work
