The total length of the edges of a polyhedron
J. M. Hammersley (1951)
Compositio Mathematica
Similarity:
Displaying similar documents to “About a special class of nonconvex optimization problems”
The total length of the edges of a polyhedron
Estimates for simple random walks on fundamental groups of surfaces
Laurent Bartholdi, Serge Cantat, Tullio Ceccherini-Silberstein, Pierre de la Harpe (1997)
Colloquium Mathematicae
Similarity:
Numerical estimates are given for the spectral radius of simple random walks on Cayley graphs. Emphasis is on the case of the fundamental group of a closed surface, for the usual system of generators.
Vertices in
Ryszard Grzaślewicz (1997)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
Prediction in stochastic linear programming
Tomáš Cipra (1987)
Kybernetika
Similarity:
A remark on the norm of a random walk on surface groups
Andrzej Żuk (1997)
Colloquium Mathematicae
Similarity:
We show that the norm of the random walk operator on the Cayley graph of the surface group in the standard presentation is bounded by 1/√g where g is the genus of the surface.
Algorithms for Triangulating Polyhedra Into a Small Number of Tethraedra
Milica Stojanović (2005)
Matematički Vesnik
Similarity: