Related papers: Presentations of NET maps
A finite morphism $f:X\to \mathbb P^2$ of a a smooth irreducible projective surface $X$ is called an almost generic cover if for each point $p\in \mathbb P^2$ the fibre $f^{-1}(p)$ is supported at least on $deg(f)-2$ distinct points and $f$…
Identifying critical nodes and links in graphs is a crucial task. These nodes/links typically represent critical elements/communication links that play a key role in a system's performance. However, a majority of the methods available in…
The notion of basic net (called also basic polyhedron) on $S^2$ plays a central role in Conway's approach to enumeration of knots and links in $S^3$. Drobotukhina applied this approach for links in $RP^3$ using basic nets on $RP^2$. By a…
This paper considers generalised network, intended as networks where (a) the edges connecting the nodes are nonlinear, and (b) stochastic processes are continuously indexed over both vertices and edges. Such topological structures are…
We determine all factorisations $X=AB$, where $X$ is a finite almost simple group and $A,B$ are core-free subgroups such that $A\cap B$ is cyclic or dihedral. As a main application, we classify the graphs $\Gamma$ admitting an almost simple…
In the second paper [LZ24b] of this series, we obtained an analog of the prime number theorem for a class of branched covering maps on the $2$-sphere $S^2$ called expanding Thurston maps, which are topological models of some non-uniformly…
We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.
We present a theorem of Sard type for semi-algebraic set-valued mappings whose graphs have dimension no larger than that of their range space: the inverse of such a mapping admits a single-valued analytic localization around any pair in the…
A graph is normal if it admits a clique cover $\mathcal C$ and a stable set cover $\mathcal S$ such that each clique in $\mathcal C$ and each stable set in $\mathcal S$ have a vertex in common. The pair $(\mathcal{C,S})$ is a normal cover…
Infrastructure monitoring is critical for safe operations and sustainability. Water distribution networks (WDNs) are large-scale networked critical systems with complex cascade dynamics which are difficult to predict. Ubiquitous monitoring…
Motivated by a uniform boundedness conjecture of Morton and Silverman, we study the graphs of pre-periodic points for maps in three families of dynamical systems, namely the collections of rational functions of degree two having a periodic…
Let $X(\RR)$ be a geometrically connected variety defined over $\RR$ and such that the set of all its (also complex) points $X(\CC)$ is non-degenerate. We introduce the notion of \emph{admissible rank} of a point $P$ with respect to $X$ to…
How can we design neural networks that allow for stable universal approximation of maps between topologically interesting manifolds? The answer is with a coordinate projection. Neural networks based on topological data analysis (TDA) use…
We present an algorithm for the fast computation of the general $N$-point spatial correlation functions of any discrete point set embedded within an Euclidean space of $\mathbb{R}^n$. Utilizing the concepts of kd-trees and graph databases,…
Expanding Thurston maps were introduced by M. Bonk and D. Meyer with motivation from complex dynamics and Cannon's conjecture from geometric group theory via Sullivan's dictionary. In this paper, we show that the entropy map of an expanding…
When is a topological branched self-cover of the sphere equivalent to a rational map on CP^1? William Thurston gave one answer in 1982, giving a negative criterion (an obstruction to a map being rational). We give a complementary, positive…
Graph isomorphism is an important problem as its worst-case time complexity is not yet fully understood. In this study, we try to draw parallels between a related optimization problem called point set registration. A graph can be…
We consider convex maps f:R^n -> R^n that are monotone (i.e., that preserve the product ordering of R^n), and nonexpansive for the sup-norm. This includes convex monotone maps that are additively homogeneous (i.e., that commute with the…
Embedding networks into a fixed dimensional feature space, while preserving its essential structural properties is a fundamental task in graph analytics. These feature vectors (graph descriptors) are used to measure the pairwise similarity…
Let $f:\mathbb{CP}^2\dashrightarrow\mathbb{CP^2}$ be a rational map with algebraic and topological degrees both equal to $d\geq 2$. Little is known in general about the ergodic properties of such maps. We show here, however, that for an…