Related papers: Basic nets in the projective plane
We introduce new geometric objects called spectral networks. Spectral networks are networks of trajectories on Riemann surfaces obeying certain local rules. Spectral networks arise naturally in four-dimensional N=2 theories coupled to…
The well-known 1-2-3 Conjecture asserts that the edges of every graph without an isolated edge can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general. We prove that every…
We prove that simply connected local 2-dimensional simplicial complexes embed in 3-space if and only if their dual matroids are graphic. Examples are provided that the assumptions of simply connectedness and locality are necessary. This may…
We develop a theory of confluence of graphs. We describe an algorithm for proving that a given system of reduction rules for abstract graphs and graphs in surfaces is locally confluent. We apply this algorithm to show that each simple Lie…
We classify nets of conics in Desarguesian projective planes over finite fields of odd order, namely, two-dimensional linear systems of conics containing a repeated line. Our proof is geometric in the sense that we solve the equivalent…
Quantification of symmetries in complex networks is typically done globally in terms of automorphisms. Extending previous methods to locally assess the symmetry of nodes is not straightforward. Here we present a new framework to quantify…
This note is purely expository. We show how in the course of the Kolmogorov-Arnold solution of Hilbert's 13-th problem on superpositions there appeared the notion of a basic embedding. A subset K of R^2 is {\it basic} if for each continuous…
The notion of network connectivity is used to characterize the robustness and failure tolerance of networks, with high connectivity being a desirable feature. In this paper, we develop a novel approach to the problem of identifying critical…
Final revision. To appear in the Journal of Differential Geometry. This paper studies knots that are transversal to the standard contact structure in $\reals^3$, bringing techniques from topological knot theory to bear on their transversal…
The Meridional Rank Conjecture asks whether the bridge number of a knot in $S^3$ is equal to the minimal number of meridians needed to generate the fundamental group of its complement. In this paper we investigate the analogous conjecture…
Analogous to a classical knot diagram, a surface-link can be generically projected to 3-space and given crossing information to create a broken sheet diagram. The triple point number of a surface-link is the minimal number of triple points…
Random walks on graphs are a fundamental concept in graph theory and play a crucial role in solving a wide range of theoretical and applied problems in discrete math, probability, theoretical computer science, network science, and machine…
This paper studies knots in three dimensional projective space. Our technique is to associate a virtual link to a link in projective space so that equivalent projective links go to equivalent virtual links (modulo a special flype move). We…
Network backbones provide useful sparse representations of weighted networks by keeping only their most important links, permitting a range of computational speedups and simplifying network visualizations. A key limitation of existing…
We introduce a graph structure on Euclidean polytopes. The vertices of this graph are the $d$-dimensional polytopes contained in $\mathbb{R}^d$ and its edges connect any two polytopes that can be obtained from one another by either…
Many real-world applications give rise to large heterogeneous networks where nodes and edges can be of any arbitrary type (e.g., user, web page, location). Special cases of such heterogeneous graphs include homogeneous graphs, bipartite,…
The Lefschetz fixed point theorem provides a powerful obstruction to the existence of minimal homeomorphisms on well-behaved spaces such as finite CW-complexes. We show that these obstructions do not hold for more general spaces. More…
We prove a generalization of the fixed point theorem of Cartwright and Littlewood. Namely, suppose $h : \mathbb{R}^2 \to\mathbb{R}^2$ is an orientation preserving planar homeomorphism, and let $C$ be a continuum such that $h^{-1}(C)\cup C$…
Complex networks can be used to represent complex systems which originate in the real world. Here we study a transformation of these complex networks into simplicial complexes, where cliques represent the simplices of the complex. We extend…
In this paper are studied the nets of principal curvature lines on surfaces embedded in Euclidean $3-$space near their end points, at which the surfaces tend to infinity. This is a natural complement and extension to smooth surfaces of the…