Related papers: Presentations of NET maps
Charts are oriented labeled graphs in a disk. Any simple surface braid (2-dimensional braid) can be described by using a chart. Also, a chart represents an oriented closed surface embedded in 4-space. In this paper, we investigate embedded…
Processing large complex networks recently attracted considerable interest. Complex graphs are useful in a wide range of applications from technological networks to biological systems like the human brain. Sometimes these networks are…
Suppose N is a phylogenetic network indicating a complicated relationship among individuals and taxa. Often of interest is a much simpler network, for example, a species tree T, that summarizes the most fundamental relationships. The…
We consider rational maps $f$ on the Riemann sphere $\widehat {\mathbb{C}}$ with an $f$-invariant set $P\subset \widehat {\mathbb{C}}$ of four marked points containing the postcritical set of $f$. We show that the dynamics of the…
Graph neural networks face two fundamental challenges rooted in the linear structure of Euclidean vector spaces: (1) Current architectures represent geometry through vectors (directions, gradients), yet many tasks require matrix-valued…
Embedding graphs in continous spaces is a key factor in designing and developing algorithms for automatic information extraction to be applied in diverse tasks (e.g., learning, inferring, predicting). The reliability of graph embeddings…
In this work we compare the semialgebraic subsets that are images of regulous maps with those that are images of regular maps. Recall that a map f : R n $\rightarrow$ R m is regulous if it is a rational map that admits a continuous…
Mapping the Internet generally consists in sampling the network from a limited set of sources by using "traceroute"-like probes. This methodology, akin to the merging of different spanning trees to a set of destinations, has been argued to…
Every finite graph admits a \emph{simple (topological) drawing}, that is, a drawing where every pair of edges intersects in at most one point. However, in combination with other restrictions simple drawings do not universally exist. For…
The homological scaffold leverages persistent homology to construct a topologically sound summary of a weighted network. However, its crucial dependency on the choice of representative cycles hinders the ability to trace back global…
We consider the ability of deep neural networks to represent data that lies near a low-dimensional manifold in a high-dimensional space. We show that deep networks can efficiently extract the intrinsic, low-dimensional coordinates of such…
Graphs are a representation of structured data that captures the relationships between sets of objects. With the ubiquity of available network data, there is increasing industrial and academic need to quickly analyze graphs with billions of…
The U-Net architecture, built upon the fully convolutional network, has proven to be effective in biomedical image segmentation. However, U-Net applies skip connections to merge semantically different low- and high-level convolutional…
We prove that holomorphic maps from an open subset of a complex smooth projective curve to a complex smooth projective rationally simply connected variety can be approximated by algebraic maps for the compact-open topology. This theorem can…
We show that for the standard map family, for all values of the parameter, except one, the mapping has positive topological entropy. The main tool is the following result. Let $S$ be a compact connected orientable surface and $f:S…
Fold maps are higher dimensional versions of Morse functions, which play important roles in the studies of smooth manifolds, and such general maps also have been fundamental tools in the studies of smooth manifolds by using generic maps. In…
While using invariant and equivariant maps, it is possible to apply deep learning to a range of primitive data structures, a formalism for dealing with hierarchy is lacking. This is a significant issue because many practical structures are…
We consider geodesic nets (critical points of a length functional on the space of embedded graphs) on doubled polygons (topological 2-spheres endowed with a flat metric away from finitely many cone singularities). We use the theorem of…
Let X be a normal connected complex algebraic variety equipped with a semisimple complex representation of its fundamental group. Then, under a maximality assumption, we prove that the covering space of X associated to the kernel of the…
The complexity of urban street networks is well accepted to reside in the information space where roads map to nodes and junctions to links between nodes. Assuming that information networks preserve their amount of surprisal on average…