Related papers: Sodalite Network: Height and Spherical Content (Co…
We discuss issues relating to the topology of Euclidean de Sitter space. We show that in (2+1) dimensions, the Euclidean continuation of the`causal diamond', i.e the region of spacetime accessible to a timelike observer, is a…
In the continuum a skyrmion is a topological nontrivial map between Riemannian manifolds, and a stationary point of a particular energy functional. This paper describes lattice analogues of the aforementioned skyrmions, namely a natural way…
For line bundles on arithmetic varieties we construct height functions using arithmetic intersection theory. In the case of an arithmetic surface, generically of genus g, for line bundles of degree g equivalence is shown to the height on…
We study the existence of minimal networks in the unit sphere $\mathbf{S}^d$ and the unit ball $\mathbf{B}^d$ of $\mathbf{R}^d$ endowed with Riemannian metrics close to the standard ones. We employ a finite-dimensional reduction method,…
This paper proves the following results: Besides parallelograms and centrally symmetric hexagons, there is no other convex domain which can form a two-, three- or four-fold lattice tiling in the Euclidean plane. If a centrally symmetric…
Suppose that there exists a discrete subset $X$ of a complete, connected, $n$-dimensional Riemannian manifold $M$ such that the Riemannian distances between points of $X$ correspond to the Euclidean distances of a net in $\mathbb{R}^{n}$.…
Given a holomorphic family of Bridgeland stability conditions over a surface, we define a notion of spectral network which is an object in a Fukaya category of the surface with coefficients in a triangulated DG-category. These spectral…
A rich class of network models associate each node with a low-dimensional latent coordinate that controls the propensity for connections to form. Models of this type are well established in the network analysis literature, where it is…
Simplicial complexes capture the underlying network topology and geometry of complex systems ranging from the brain to social networks. Here we show that algebraic topology is a fundamental tool to capture the higher-order dynamics of…
The goal of this work is to continue the study the smoothings of 3-dimensional manifolds with singularities obtained as small covers of non simple right-angle Coxeter polyhedral orbifolds. They appear in the study of coaxial intersections…
We construct convex bodies that can be "captured by nets." More precisely, for each dimension $n \geq 2$, we construct a family of Riemannian $n$-spheres, each with a stable geodesic net, which is a stable 1-dimensional integral varifold.…
Networks are a fundamental tool for understanding and modeling complex systems in physics, biology, neuroscience, engineering, and social science. Many networks are known to exhibit rich, lower-order connectivity patterns that can be…
A network embedding is a representation of a large graph in a low-dimensional space, where vertices are modeled as vectors. The objective of a good embedding is to preserve the proximity between vertices in the original graph. This way,…
We present a simple method to obtain information regarding the connectivity of the 1-skeleta of a wide family of simplicial complexes through bounds for the Castelnuovo-Mumford regularity of their Stanley-Reisner rings. In this way we…
The icosidodecahedron has 30 vertices, one at the center of each edge of a regular icosahedron -- or equivalently, one at the center of each edge of a regular dodecahedron. It is a beautiful, highly symmetrical shape. But it is just a…
Spatially embedded networks have attracted increasing attention in the last decade. In this context, new types of network characteristics have been introduced which explicitly take spatial information into account. Among others, edge…
Unifying the correlative single-view satellite image building extraction and height estimation tasks indicates a promising way to share representations and acquire generalist model for large-scale urban 3D reconstruction. However, the…
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…
An unbounded one-dimensional solid-on-solid model with integer heights is studied. Unbounded here means that there is no a priori restrictions on the discret e gradient of the interface. The interaction Hamiltonian of the interface is given…
We explain that spectral networks are a unifying framework that incorporates both shear (Fock-Goncharov) and length-twist (Fenchel-Nielsen) coordinate systems on moduli spaces of flat SL(2,C) connections, in the following sense. Given a…