Mapping Networks: Perspectives and Applications

• Mapping networks are a family of methods that convert objects, states, or parameters into alternate network forms while preserving structural, dynamical, or semantic relations.
• They enable operations such as virtual network allocation, hyperbolic and topology-preserving embedding, and projection of multiway interactions into weighted networks.
• These approaches support practical applications including resource optimization, community detection, semantic inference, and neural parameterization in machine learning.

“Mapping networks” is not a single method but a family of constructions in which objects, states, flows, or parameters are represented in another network, coordinate system, or latent space. In the cited literature, the term covers at least four recurrent operations: assignment of one network to another substrate, projection of higher-order or geometric data into graph form, embedding of networks into latent spaces such as hyperbolic geometry or low-rank topology maps, and parametric mappings used in machine learning and semantic inference. The same phrase therefore appears in network virtualization (Javadpour et al., 2020), hyperbolic and topology-preserving embedding (Papadopoulos et al., 2012, Jayasumana et al., 2018, Rodríguez-Flores et al., 2020), information-theoretic flow mapping (Blöcker et al., 2020, Edler et al., 2017), structural transformations such as hypergraph projection and state-mapping networks (López, 2012, Li et al., 2014), and neural parameterization via latent-to-weight maps (Sen et al., 22 Feb 2026).

1. Scope and principal meanings

Across the surveyed work, “mapping” denotes a transformation that preserves selected structural, dynamical, or semantic relations while changing representation. In virtual network embedding, virtual nodes and virtual links are mapped onto substrate nodes and substrate links under CPU, bandwidth, and switch-memory constraints (Javadpour et al., 2020). In fracture analysis, each fracture sheet is represented by a node and intersections become links, yielding an intersection graph of fractures (Andresen et al., 2012). In hypergraph projection, pairwise edge weights are generated from the number of hyperedges jointly incident on a node pair (López, 2012). In digital chaos, every representable state becomes a node and each quantized state transition becomes a directed edge in a state-mapping network (Li et al., 2014). In analogical reasoning, semantic relation networks are matched probabilistically across analogs (Lu et al., 2021). In neural parameterization, a compact latent vector is mapped into the full parameter vector of a target network (Sen et al., 22 Feb 2026).

Domain	Mapped object	Resulting representation
Network virtualization	Virtual nodes and virtual links	Substrate nodes and substrate links
Hypergraph projection	Multiway interactions	Weighted projected networks
Digital chaos	Finite-precision states	State-mapping networks
Hyperbolic/topology embedding	Network connectivity	Hyperbolic coordinates or TPMs
Flow analysis	Random-walk trajectories	Modules from the map equation
Neural parameterization	Latent vector $z$	Target weights $\theta$

A recurrent ambiguity is whether a “mapping network” is the object being mapped, the graph produced by the mapping, or a parametric model that performs the mapping. The literature contains all three usages. This suggests that the unifying criterion is not ontology but preservation: each construction attempts to preserve some combination of adjacency, flow, similarity, reachability, or task loss under a change of representation.

2. Assignment, projection, and infrastructure-aware placement

In network virtualization, mapping is an allocation problem over a heterogeneous substrate. A virtual network is modeled as a graph of virtual nodes and virtual links, and these are mapped onto substrate nodes and substrate links. One substrate node may host multiple virtual nodes, one virtual link may be mapped onto one or more substrate links, and virtual resources may be formed by combining several substrate resources. The embedding must satisfy capacity constraints such as CPU on nodes, bandwidth on links, and switch memory for flow rules, while remaining economical in resource use (Javadpour et al., 2020).

The SDN-based method in “Managing Heterogeneous Substrate Resources by Mapping and Visualization Based on Software-Defined Network” places a resource management module inside the controller. It performs an initial mapping when a request arrives, queues successful mappings, postpones switch rule installation until the $n$-th successful request, and writes only modified rules to the corresponding switches. For each virtual link $l_{uv}$, the paper defines used substrate resources $R_{u'v'}$, available substrate resources $A_{u'v'}$, and the weight

$W_{u'v'} = R_{u'v'} - A_{u'v'}.$

Virtual links are sorted in descending order of weight, node mapping is greedy, and link mapping uses multi-commodity flow without path splitting. In NS2 v2.35, the method reduces delay and cost while maintaining acceptance rate relative to SSPSM and SDN-VN (Javadpour et al., 2020).

A closely related placement problem arises in distributed-memory computing. “An MPI-based Algorithm for Mapping Complex Networks onto Hierarchical Architectures” maps an application graph onto processing elements of a hierarchical machine by minimizing

$$Coco(\mu) := \sum_{e_a=\{u_a,v_a\}\in E_a} \omega_a(e_a)\, d(\mu(u_a),\mu(v_a)).$$

The architecture is modeled implicitly as a labeled tree with hierarchy

$$H=\{h_0,h_1,\ldots,h_{l-1}\}, \qquad k = \prod_{i=0}^{l-1} h_i,$$

and distance parameters $D=\{d_0,d_1,\ldots,d_{l-1}\}$. Mapping is induced by vertex labels and refined by topology-aware parallel label propagation. The paper presents its ParHIP-based implementation as the first public implementation of a parallel graph mapping algorithm and reports good scalability up to a few thousand processing elements (Predari et al., 2021).

Projection furnishes a different kind of mapping. In “Weighted projected networks: mapping hypergraphs to networks”, a hypergraph with rank $\theta$0 is mapped to a weighted network by setting

$\theta$1

where $\theta$2 is the set of hyperedges containing both $\theta$3 and $\theta$4. The additive projection uses $\theta$5, whereas the nominal projection uses $\theta$6. In homogeneous ensembles,

$\theta$7

so for $\theta$8 the expected projected weight grows with $\theta$9. The paper proposes this scaling as a signature of hidden multiway interaction in weighted network data (López, 2012).

Geological fracture systems supply another explicit graphification rule. “Topology of Fracture Networks” maps each fracture sheet to a node and places a link whenever two sheets intersect. Applied to eight geological fracture outcrops from southeast Sweden, the equivalent networks show broad degree distributions, high clustering, small-world behavior, and disassortative mixing. By contrast, networks generated by the Discrete Fracture Network model are also small-world but assortative, indicating that some synthetic models reproduce clustering and efficiency while missing the degree-correlation structure of natural fracture systems (Andresen et al., 2012).

3. Geometric and topological embeddings

A major strand of mapping research embeds a network into a latent geometric space. In “Network Mapping by Replaying Hyperbolic Growth”, HyperMap infers hidden hyperbolic coordinates by replaying a growth process derived from the PSO/E-PSO model. Nodes are assigned radial coordinates

$n$0

with angular coordinates inferred by maximizing a local likelihood over candidate $n$1. The model uses the hyperbolic distance

$n$2

and connection probability

$n$3

On the AS Internet, the resulting angular coordinates identify soft communities of autonomous systems from the same geographic region, yield AUC values of $n$4, $n$5, and $n$6 for $n$7, $n$8, and $n$9 missing links, and support greedy routing with more than $l_{uv}$0 success probability (Papadopoulos et al., 2012).

Temporal human proximity networks admit a related treatment after aggregation. “Hyperbolic Mapping of Human Proximity Networks” argues that if a temporal proximity system is generated by the dynamic-$l_{uv}$1 model, its time-aggregated network retains a distance-dependent connection law compatible with standard static embedding tools. For an aggregated window of length $l_{uv}$2,

$l_{uv}$3

Using Mercator on six real systems, the paper reports meaningful communities, substantial gains for Human-to-Human Greedy Routing over random routing, future-link prediction with AUROC values such as $l_{uv}$4, $l_{uv}$5, $l_{uv}$6, and $l_{uv}$7 on several datasets, and positive correlation between epidemic arrival time and hyperbolic distance from infection sources (Rodríguez-Flores et al., 2020).

Topology-preserving mapping replaces physical distance by graph geodesics. “Network Topology Mapping from Partial Virtual Coordinates and Graph Geodesics” treats the hop-distance matrix as approximately low-rank and completes it by nuclear-norm minimization: $l_{uv}$8 After completion, the method applies spectral embedding using double centering,

$l_{uv}$9

On 2-D and 3-D sensor networks, the resulting maps preserve main shapes, boundaries, and voids even when large fractions of sparse observations are deleted; on a Gowalla social-network subgraph with $R_{u'v'}$0 nodes and $R_{u'v'}$1 edges, using only $R_{u'v'}$2 of the hop-distance entries yields about $R_{u'v'}$3 mean error and absolute hop error less than $R_{u'v'}$4 (Jayasumana et al., 2018).

A distinct but related embedding principle appears in bibliometrics. “A unified approach to mapping and clustering of bibliometric networks” shows that VOS mapping and a weighted, parameterized variant of modularity-based clustering can be derived from a shared objective,

$R_{u'v'}$5

with association strength

$R_{u'v'}$6

For mapping, $R_{u'v'}$7; for clustering, $R_{u'v'}$8 within a cluster and $R_{u'v'}$9 across clusters. The framework thereby makes spatial layout and discrete clustering mathematically compatible representations of the same bibliometric structure (Waltman et al., 2010).

4. Flow mapping, compression, and higher-order structure

Information-theoretic flow mapping is centered on the map equation and its extensions. In bipartite networks, “Mapping Flows on Bipartite Networks” observes that random walks must alternate node types, which contributes one bit of information in the idealized case. The standard map equation therefore discards useful regularity. The paper introduces a coding scheme with node-type memory, including the fully bipartite two-level description length

$A_{u'v'}$0

and a fuzzy node-type memory parameter $A_{u'v'}$1 with available information

$A_{u'v'}$2

Across 21 real bipartite networks, increasing node-type information generally lowers code length, yields smaller effective module size, and produces deeper hierarchies and higher resolution (Blöcker et al., 2020).

Higher-order flows require more than node-type alternation. “Mapping higher-order network flows in memory and multilayer networks with Infomap” distinguishes physical nodes from state nodes. State-node transition probabilities are written as

$A_{u'v'}$3

while physical-node visit rates are recovered by summing over state nodes associated with the same physical node: $A_{u'v'}$4 This sparse memory network formalism supports memory networks, multilayer networks, and combinations thereof. The map equation is then applied to state-node-guided flows while sharing code words among state nodes of the same physical node when they occur in the same module. The resulting Infomap framework identifies overlapping and nested flow modules that first-order models can obscure (Edler et al., 2017).

The conceptual issue at stake is whether mapping should preserve adjacency or dynamics. Flow-based methods answer in favor of dynamics: modules are chosen because they compress random-walk trajectories, not because they maximize purely topological density. By contrast, bibliometric VOS mapping and hyperbolic embedding preserve similarity or latent geometry. This distinction explains why methods with superficially similar outputs—maps, clusters, or coordinates—often optimize different objects.

5. Data-to-network transformations and network-state inference

Some mapping networks are explicit transformations from non-network data into graph form. In “Dynamic Analysis of Digital Chaotic Maps via State-Mapping Networks”, the state space of a digital chaotic map is finite, so every representable value becomes a node and the quantized image determines a directed edge: $A_{u'v'}$5 For the Logistic map, the paper proves that the cumulative in-degree distribution satisfies

$A_{u'v'}$6

and hence the corresponding state-mapping network is scale-free. For the Tent map, the in-degree structure has only three possible values, $A_{u'v'}$7, $A_{u'v'}$8, and $A_{u'v'}$9. The contrast is used to explain degeneration of digital chaos under finite precision and to analyze chaos-based pseudo-random number generators beyond output-test statistics (Li et al., 2014).

“Mapping images into ordinal networks” generalizes ordinal-network methods from time series to two-dimensional images. A sliding $W_{u'v'} = R_{u'v'} - A_{u'v'}.$0 patch is flattened, converted to an ordinal pattern, and treated as a node; directed edges record first-neighbor transitions in the symbolic image, with weights

$W_{u'v'} = R_{u'v'} - A_{u'v'}.$1

The method defines local node entropy $W_{u'v'} = R_{u'v'} - A_{u'v'}.$2, global node entropy $W_{u'v'} = R_{u'v'} - A_{u'v'}.$3, weighted average shortest path $W_{u'v'} = R_{u'v'} - A_{u'v'}.$4, and the Gini index $W_{u'v'} = R_{u'v'} - A_{u'v'}.$5. For $W_{u'v'} = R_{u'v'} - A_{u'v'}.$6, once one ordinal pattern is fixed, only 12 of the 24 possible patterns can follow horizontally; for $W_{u'v'} = R_{u'v'} - A_{u'v'}.$7 the network can have at most 24 nodes and 416 edges, whereas for $W_{u'v'} = R_{u'v'} - A_{u'v'}.$8 it can have 720 nodes and 104,184 edges. The resulting descriptors capture roughness, symmetry, periodicity, and Ising criticality, and the paper reports about $W_{u'v'} = R_{u'v'} - A_{u'v'}.$9 accuracy for Hurst-exponent classification and about $$Coco(\mu) := \sum_{e_a=\{u_a,v_a\}\in E_a} \omega_a(e_a)\, d(\mu(u_a),\mu(v_a)).$$0 for detecting Ising criticality, with robustness improved further by PCA on edge weights (Pessa et al., 2020).

Crowdsourced social-network mapping uses a different input modality: local human knowledge. “Human Atlas: A Tool for Mapping Social Networks” defines the “publicly knowable graph” as ties that are publicly observable and confirmable by others in the community. The web-based tool supports an ego view, physical view, and global view, and allows users to add ties among their neighbors as well as their own ties. In a study of the MIT Media Lab, 22 of 29 invitees used the tool, and in 4.6 man-hours they mapped 984 connections. A notable result is that 39% of all captured links were links between a user’s immediate connections, showing that third-party reporting substantially expands coverage (Saveski et al., 2016).

Mapping can also target latent failure states rather than explicit social ties. “Mapping Network States Using Connectivity Queries” models infrastructure as an undirected graph $$Coco(\mu) := \sum_{e_a=\{u_a,v_a\}\in E_a} \omega_a(e_a)\, d(\mu(u_a),\mu(v_a)).$$1 with supply, demand, and transshipment nodes, and seeks to infer the failed edge set $$Coco(\mu) := \sum_{e_a=\{u_a,v_a\}\in E_a} \omega_a(e_a)\, d(\mu(u_a),\mu(v_a)).$$2 and serviced demand-node set $$Coco(\mu) := \sum_{e_a=\{u_a,v_a\}\in E_a} \omega_a(e_a)\, d(\mu(u_a),\mu(v_a)).$$3 from connectivity probes $$Coco(\mu) := \sum_{e_a=\{u_a,v_a\}\in E_a} \omega_a(e_a)\, d(\mu(u_a),\mu(v_a)).$$4 and a small sample of point probes $$Coco(\mu) := \sum_{e_a=\{u_a,v_a\}\in E_a} \omega_a(e_a)\, d(\mu(u_a),\mu(v_a)).$$5. The paper uses a two-part MDL formulation over models $$Coco(\mu) := \sum_{e_a=\{u_a,v_a\}\in E_a} \omega_a(e_a)\, d(\mu(u_a),\mu(v_a)).$$6 and shows that the resulting NetPathState problem is NP-hard to approximate within $$Coco(\mu) := \sum_{e_a=\{u_a,v_a\}\in E_a} \omega_a(e_a)\, d(\mu(u_a),\mu(v_a)).$$7. Its greedy JointPathMap algorithm searches over disaster scenarios and candidate failed edges, recomputing serviceability by BFS. The main empirical conclusion is that connectivity-only inference has low recall because many true failures are “u-edges”, undiscoverable from reachability alone (Rodríguez et al., 2020).

6. Machine-learning, semantic, and neuromorphic uses

In cognitive modeling, mapping networks are structured semantic graphs rather than neural layers. “Probabilistic Analogical Mapping with Semantic Relation Networks” constructs attributed graphs whose nodes are concepts represented by 300-dimensional Word2vec vectors and whose edges are semantic relation vectors learned by BART. BART is trained on 270 relations, then augmented with 270 role probabilities, giving a 540-dimensional edge representation. Analogical mapping is posed as Bayesian graph matching: $$Coco(\mu) := \sum_{e_a=\{u_a,v_a\}\in E_a} \omega_a(e_a)\, d(\mu(u_a),\mu(v_a)).$$8 with approximately one-to-one constraints on the mapping matrix $$Coco(\mu) := \sum_{e_a=\{u_a,v_a\}\in E_a} \omega_a(e_a)\, d(\mu(u_a),\mu(v_a)).$$9. The likelihood combines edge and node similarities,

$$H=\{h_0,h_1,\ldots,h_{l-1}\}, \qquad k = \prod_{i=0}^{l-1} h_i,$$0

and graduated assignment minimizes the corresponding energy. The model accounts for systematicity, compatibility, pragmatic goal effects, developmental relational shift, and retrieval patterns; in a Turney analogy dataset it selected the intended source in 17 of 20 cases (Lu et al., 2021).

In robotics and scene understanding, mapping networks couple semantics to geometry. “DA-RNN: Semantic Mapping with Data Associated Recurrent Neural Networks” inserts a recurrent layer into a semantic segmentation pipeline and wires recurrence by data association derived from KinectFusion. A pixel in the new frame inherits the hidden state and accumulated weight of its associated predecessor if an association exists; otherwise the state is initialized to zero. The Data Associated Recurrent Unit updates hidden states by a weighted moving average rather than an LSTM- or GRU-style gate, and semantic class probabilities are fused into a TSDF voxel map, with voxel labels taken by $$H=\{h_0,h_1,\ldots,h_{l-1}\}, \qquad k = \prod_{i=0}^{l-1} h_i,$$1. The system runs at about 5 fps for labeling and reconstruction and yields dense semantic 3D maps (Xiang et al., 2017).

Neuromorphic conversion studies use mapping in a stricter constructive sense. “An Exact Mapping From ReLU Networks to Spiking Neural Networks” proves a lossless conversion from a pretrained ReLU network, possibly including convolution, batch normalization, and max pooling, to a time-to-first-spike SNN in which each neuron fires exactly one spike in the main construction. The conversion uses spike-time encoding

$$H=\{h_0,h_1,\ldots,h_{l-1}\}, \qquad k = \prod_{i=0}^{l-1} h_i,$$2

and maps ANN weights $$H=\{h_0,h_1,\ldots,h_{l-1}\}, \qquad k = \prod_{i=0}^{l-1} h_i,$$3 to SNN weights

$$H=\{h_0,h_1,\ldots,h_{l-1}\}, \qquad k = \prod_{i=0}^{l-1} h_i,$$4

The paper reports zero percent drop in accuracy on CIFAR10, CIFAR100, Places365, and PASS (Stanojevic et al., 2022).

The 2026 paper titled “Mapping Networks” uses the phrase in yet another way: a trainable latent vector $$H=\{h_0,h_1,\ldots,h_{l-1}\}, \qquad k = \prod_{i=0}^{l-1} h_i,$$5 is mapped to the full parameter vector $$H=\{h_0,h_1,\ldots,h_{l-1}\}, \qquad k = \prod_{i=0}^{l-1} h_i,$$6 of a target network through

$$H=\{h_0,h_1,\ldots,h_{l-1}\}, \qquad k = \prod_{i=0}^{l-1} h_i,$$7

The central claim is that trained parameters reside on a low-dimensional manifold $$H=\{h_0,h_1,\ldots,h_{l-1}\}, \qquad k = \prod_{i=0}^{l-1} h_i,$$8. Under Lipschitz and smooth-manifold assumptions, the Mapping Theorem states that for every $$H=\{h_0,h_1,\ldots,h_{l-1}\}, \qquad k = \prod_{i=0}^{l-1} h_i,$$9 there exist $D=\{d_0,d_1,\ldots,d_{l-1}\}$0, a $D=\{d_0,d_1,\ldots,d_{l-1}\}$1 map $D=\{d_0,d_1,\ldots,d_{l-1}\}$2, and a latent vector $D=\{d_0,d_1,\ldots,d_{l-1}\}$3 such that

$D=\{d_0,d_1,\ldots,d_{l-1}\}$4

and

$D=\{d_0,d_1,\ldots,d_{l-1}\}$5

The practical architecture uses a fixed mapping network with latent modulation, a Mapping Loss

$D=\{d_0,d_1,\ldots,d_{l-1}\}$6

and reports up to 99.5% reduction in trainable parameters, or about $D=\{d_0,d_1,\ldots,d_{l-1}\}$7, while matching or exceeding baseline performance on MNIST, Fashion-MNIST, Celeb-DF, FF++, Cityscapes, air-pollution forecasting, and ResNet50 fine-tuning settings (Sen et al., 22 Feb 2026).

Taken together, these works establish that “mapping networks” is a genuinely polysemous technical term. It can refer to network assignment under resource constraints, graphification of higher-order or non-network data, latent geometric embedding, flow-compression and community discovery, semantic relation matching, exact architectural conversion, or latent-to-weight parameterization. The consistent thread is that a mapping is judged by what it preserves: feasibility and resource efficiency in SDN virtualization, communication cost on hierarchical hardware, overlap statistics in hypergraph projection, dynamical fidelity in state-mapping networks and higher-order Infomap, structural regularity in hyperbolic embedding, or task loss in neural parameter manifolds. This suggests that the most precise use of the term always requires an explicit statement of source representation, target representation, and invariants intended to survive the transformation.