Related papers: Sodalite Network: Height and Spherical Content (Co…
Numerous complex systems, both natural and artificial, are characterized by the presence of intertwined supply and/or drainage networks. Here we present a minimalist model of such co-evolving networks in a spatially continuous domain, where…
A large variety of interacting complex systems are characterized by interactions occurring between more than two nodes. These systems are described by simplicial complexes. Simplicial complexes are formed by simplices (nodes, links,…
For an oriented surface link $S$, we can take a satellite construction called a 2-dimensional braid over $S$, which is a surface link in the form of a covering over $S$. We demonstrate that 2-dimensional braids over surface links are useful…
A periodic lattice in Euclidean space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
The topological information of a network can be retrieved equivalently from its complement consisting of the same nodes but complementary edges. Hence the partition of a network into certain substructures based on given criteria should be…
Metric networks are network-shaped, one-dimensional structures on which one can solve differential equations to simulate a wide range of physical systems including conjugated molecules, photonic crystals, quantum mechanics in waveguide…
We study a problem of geometric graph theory: We determine the triply periodic graph in Euclidean 3-space which minimizes length among all graphs spanning a fundamental domain of 3-space with the same volume. The minimizer is the so-called…
Discrete conjugate systems are quadrilateral nets with all planar faces. Discrete orthogonal systems are defined by the additional property of all faces being concircular. Their geometric properties allow one to consider them as proper…
In order to study the fundamental limits of network densification, we look at the spatial spectral efficiency gain achieved when densely deployed communication devices embedded in the $d$-dimensional Euclidean space are optimally `matched'…
In this paper, we find all constant slope surfaces in the Euclidean 3-space, namely those surfaces for which the position vector of a point of the surface makes constant angle with the normal at the surface in that point. These surfaces…
The trophic levels of nodes in directed networks can reveal their functional properties. Moreover, the trophic coherence of a network, defined in terms of trophic levels, is related to properties such as cycle structure, stability and…
We introduce several novel and computationally efficient methods for detecting "core--periphery structure" in networks. Core--periphery structure is a type of mesoscale structure that includes densely-connected core vertices and…
The regular polyhedra have the highest order of 3D symmetries and are exceptionally at- tractive templates for (self)-assembly using minimal types of building blocks, from nano-cages and virus capsids to large scale constructions like glass…
Latent Euclidean embedding models a given network by representing each node in a Euclidean space, where the probability of two nodes sharing an edge is a function of the distances between the nodes. This implies that for two nodes to share…
We demonstrate that the self-similarity of some scale-free networks with respect to a simple degree-thresholding renormalization scheme finds a natural interpretation in the assumption that network nodes exist in hidden metric spaces.…
A general net of quadric surfaces, together with a choice of a base point, defines a net of plane cubics via the Gale transformation of the remaining seven base points. To both nets, one can also naturally associate the same smooth plane…
The study of complex networks is a significant development in modern science, and has enriched the social sciences, biology, physics, and computer science. Models and algorithms for such networks are pervasive in our society, and impact…
We investigate the structural properties of a simple model for tetrahedral patchy colloids in which the patch width and the patch range can be tuned independently. For wide bond angles, a fully bonded network can be generated by standard…
The structure of the spectrum of the three-dimensional Dirichlet Laplacian in the 3D polyhedral layer of fixed width is studied. It appears that the essential spectrum is defined by the smallest dihedral angle that forms the boundary of the…
Given a trivalent graph in the 3-dimensional Euclidean space, we call it a discrete surface because it has a tangent space at each vertex determined by its neighbor vertices. To abstract a continuum object hidden in the discrete surface, we…