Related papers: Minimal elastic networks
A graph in a certain graph class is called minimizing if the least eigenvalue of the adjacency matrix of the graph attains the minimum among all graphs in that class. Bell {\it et al.} have characterized the minimizing graphs in the class…
For a weakly mixing bounded rank-one construction the disjointness of its powers is proved. For non-rigid constructions we get minimal self-joinings. Examples of non-mixing rank one actions with explicit weak closure are proposed.
We systematically explore a class of constrained optimization problems with linear objective function and constraints that are linear combinations of logarithms of the optimization variables. Such problems can be viewed as a generalization…
The structure of pipe networks minimizing the total energy dissipation rate is studied analytically. Among all the possible pipe networks that can be built with a given total pipe volume (or pipe lateral surface area), the network which…
Potential energy landscapes can be represented as a network of minima linked by transition states. The community structure of such networks has been obtained for a series of small Lennard-Jones clusters. This community structure is compared…
A convergence result is proved for the equilibrium configurations of a three-dimensional thin elastic beam, as the diameter h of the cross-section goes to zero. More precisely, we show that stationary points of the nonlinear elastic…
This paper studies the problem of computing quasi-upward planar drawings of bimodal plane digraphs with minimum curve complexity, i.e., drawings such that the maximum number of bends per edge is minimized. We prove that every bimodal plane…
We consider a variational model for periodic partitions of the upper half-space into three regions, where two of them have prescribed volume and are subject to the geometrical constraint that their union is the subgraph of a function, whose…
We consider the so called combined energy of a deformation between two concentric annuli and minimize it, provided that it keep order of the boundaries. It is an extension of the corresponding result of Euclidean energy. It is intrigue…
We discuss the global regularity of 2 dimensional minimal sets that are near a union of two planes, and prove that every global minimal set in R^4 that looks like a union of two almost orthogonal planes at infinity is a cone. The main point…
Two new classes of networks are introduced that resemble small-world properties. These networks are recursively constructed but retain a fixed, regular degree. They consist of a one-dimensional lattice backbone overlayed by a hierarchical…
We prove the existence of minimal models for fibrations between dendroidal sets in the model structure for infinity-operads, as well as in the covariant model structure for algebras and in the stable one for connective spectra. In an…
A well-known property of linear resistive electrical networks is that the current distribution minimizes the total dissipated energy. When the circuit includes resistors with nonlinear monotonic characteristic, the current distribution…
In this note we present a natural generalization of the minimum angle condition, commonly used in the finite element analysis for planar triangulations, to the case of simplicial meshes in any space dimension. The equivalence of this…
Subgraphs reveal information about the geometry and functionalities of complex networks. For scale-free networks with unbounded degree fluctuations, we obtain the asymptotics of the number of times a small connected graph occurs as a…
A connected graph $G$ with at least two vertices is matching covered if each of its edges lies in a perfect matching. A matching covered graph is minimal if the removal of any edge results in a graph that is no longer matching covered. An…
We study the following version of cut sparsification. Given a large edge-weighted network $G$ with $k$ terminal vertices, compress it into a smaller network $H$ with the same terminals, such that every minimum terminal cut in $H$…
In this note we study the boundary regularity of minimizers of a family of weak anchoring energies that model the states of liquid crystals. We establish optimal boundary regularity in all dimensions $n\geq 3 .$ In dimension $n=3,$ this…
We study compact stable embedded minimal surfaces whose boundary is given by two collections of closed smooth Jordan curves in close planes of Euclidean 3-space. Our main result is a classification of these minimal surfaces, under certain…
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a ``semi-duality'' between minimum cuts and maximum spanning tree packings combined with our previously developed random sampling…