Related papers: Triple-loop networks with arbitrarily many minimum…
This paper presents and explores a theory of \emph{multiholomorphic maps}. This group of ideas generalizes the theory of pseudoholomorphic curves in a direction suggested by consideration of the kinds of compatible geometric structures that…
A $triangulation$ is an embedding of a graph on surfaces where every face has length three. In this article, we show the existence of contractible Hamiltonian cycle in triangulated maps of which minimum degree is four.
Crossing minimization is one of the central problems in graph drawing. Recently, there has been an increased interest in the problem of minimizing crossings between paths in drawings of graphs. This is the metro-line crossing minimization…
The distributions of the random distances associated with hexagons, rhombuses and triangles have been derived and verified in the existing work. All of these geometric shapes are related to each other and have various applications in…
We describe a new class of minimal link diagrams. This class includes certain alternating diagrams, the standard diagrams of all torus links, and numerous homogeneous diagrams whose minimality has not been proven before. Besides, we…
Flip graphs are a ubiquitous class of graphs, which encode relations induced on a set of combinatorial objects by elementary, local changes. Skeletons of associahedra, for instance, are the graphs induced by quadrilateral flips in…
A useful connection between two-loop massive vacuum integrals and one-loop off-shell triangle diagrams with massless internal particles is established for arbitrary values of the space-time dimension n.
This paper studies the theory of linear analog error correction coding. Since classical concepts of minimum Hamming distance and minimum Euclidean distance fail in the analog context, a new metric, termed the "minimum (squared Euclidean)…
We study the minimum distance of codes defined on bipartite graphs. Weight spectrum and the minimum distance of a random ensemble of such codes are computed. It is shown that if the vertex codes have minimum distance $\ge 3$, the overall…
Understanding the structural complexity and predictability of complex networks is a central challenge in network science. Although recent studies have revealed a relationship between compression-based entropy and link prediction…
Intrigued by the capacity of random networks, we start by proving a max-flow min-cut theorem that is applicable to any random graph obeying a suitably defined independence-in-cut property. We then show that this property is satisfied by…
This paper addresses the issue of design of low-rate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which needs to be satisfied when the linear minimum distance is to be ensured.…
High order networks are weighted hypergraphs col- lecting relationships between elements of tuples, not necessarily pairs. Valid metric distances between high order networks have been defined but they are difficult to compute when the…
The minimum distance of a linear code is a key concept in information theory. Therefore, the time required by its computation is very important to many problems in this area. In this paper, we introduce a family of implementations of the…
The chordal ring (CR) graphs are a well-known family of graphs used to model some interconnection networks for computer systems in which all nodes are in a cycle. Generalizing the CR graphs, in this paper, we introduce the families of…
Biology presents many examples of planar distribution and structural networks having dense sets of closed loops. An archetype of this form of network organization is the vasculature of dicotyledonous leaves, which showcases a…
The degree distribution, referred to as the delta-sequence of a network is studied. Using the non-normalized Lorenz curve, we apply a generalized form of the classical majorization partial order. Next, we introduce a new class of small…
Networks are structures that encode relationships between pairs of elements or nodes. However, there is no imposed connection between these relationships, i.e., the relationship between two nodes can be independent of every other one in the…
Distance-increasing maps from binary vectors to permutations, namely DIMs, are useful for the construction of permutation arrays. While a simple mapping algorithm defining DIMs of even length is known, existing DIMs of odd length are either…
A new family of graphs, {\it entangled networks}, with optimal properties in many respects, is introduced. By definition, their topology is such that optimizes synchronizability for many dynamical processes. These networks are shown to have…