Heterogeneous Vertex Model Overview

• Heterogeneous Vertex Model is a framework that characterizes systems with vertex-based heterogeneity, including cell mechanics and network growth, by incorporating variable parameters.
• In tissue mechanics, the model leverages cell-specific target areas, elastic moduli, and gauge symmetry to decouple dynamic pressures and stresses.
• In network science, degree-dependent activation and inactivation preserve scale-free topology while modulating growth rates and inducing oscillatory dynamics.

The expression heterogeneous vertex model is used in more than one technical sense across the recent literature. In tissue mechanics, it denotes a vertex model for confluent epithelia in which cells differ in size and stiffness through cell-specific target areas, target perimeters, and elastic moduli; in that setting, a central result is that the average product of target areas and area stiffness is dynamically irrelevant unless a gauge is fixed (Godolphim et al., 25 Aug 2025). In network science, it denotes a scale-free growth model under degree-dependent activation and inactivation of vertices, where removal and recovery schedules depend on vertex tier while the network retains a power-law degree distribution (Li et al., 2013). Closely related but terminologically distinct work in heterogeneous graph learning uses vertex-centric formulations to process typed vertices and relations, rather than a “vertex model” in the biophysical sense (Han et al., 11 Aug 2025, Lee et al., 2021).

1. Terminological scope and disciplinary usage

In the tissue-mechanics usage, the model concerns a confluent two-dimensional tissue made of polygonal cells, vertices, and edges. Heterogeneity is attached to cell-level material and geometric parameters, specifically $A_{0c}$, $K_{Ac}$, $L_{0c}$, and $K_{Lc}$, so that distinct cells can differ in preferred area, area stiffness, preferred perimeter, and perimeter stiffness (Godolphim et al., 25 Aug 2025). The term “vertex” refers to the geometric degrees of freedom at cell junctions.

In the network-science usage introduced by Li and Wang, heterogeneity is attached to degree-dependent control of vertex availability. Each vertex alternates between active and inactive periods, with durations determined by a tier ranking derived from its current degree and the current maximum degree $k_{\max}$ (Li et al., 2013). Here, “vertex” refers to a node in a growing scale-free network rather than to a geometric junction in a tissue.

A source of terminological ambiguity is that heterogeneous-graph learning also places strong emphasis on vertices, edge types, and relation types. For example, a heterogeneous graph is written as $G=(V,E,\mathcal T,\mathcal R)$ or $G=(V,E,\mathcal T_V,\mathcal T_E,X)$, with typed vertices and typed edges (Han et al., 11 Aug 2025, Lee et al., 2021). These formalisms are not presented as a heterogeneous vertex model per se, but they establish a neighboring usage in which heterogeneity is combinatorial and semantic rather than mechanical or degree-control based.

2. Heterogeneous vertex model in tissue mechanics

Godolphim, Brunnet, and Soto formulate the heterogeneous vertex model through an energy functional on a confluent epithelial tiling with $N_c$ cells, $N_v$ vertices, and $N_e$ edges (Godolphim et al., 25 Aug 2025). Each cell $K_{Ac}$0 carries its own preferred area $K_{Ac}$1, area stiffness $K_{Ac}$2, target perimeter $K_{Ac}$3, and perimeter stiffness $K_{Ac}$4. The total energy is

$K_{Ac}$5

The overdamped dynamics of each vertex $K_{Ac}$6 is governed by

$K_{Ac}$7

with uniform drag coefficient $K_{Ac}$8. In this formulation, geometry enters through the instantaneous cell areas $K_{Ac}$9 and perimeters $L_{0c}$0, while heterogeneity enters through the cell-indexed parameters.

The model also admits a virtual-work decomposition in terms of cell pressure $L_{0c}$1 and edge tension $L_{0c}$2,

$L_{0c}$3

which yields

$L_{0c}$4

and

$L_{0c}$5

where the sum in $L_{0c}$6 runs over the two cells sharing edge $L_{0c}$7 (Godolphim et al., 25 Aug 2025). This decomposition makes explicit how heterogeneity in target geometry and elastic moduli maps onto pressures and tensions.

A notable implication is that the heterogeneous model is not merely the homogeneous model with parameter noise added. The cellwise products $L_{0c}$8 play a distinguished role in the dynamics and in the interpretation of observables. This becomes central in the degeneracy analysis.

3. Area-target degeneracy and gauge structure

The key structural result in the tissue model is that the quantity

$L_{0c}$9

is dynamically irrelevant in the bulk (Godolphim et al., 25 Aug 2025). The symmetry is generated by the one-parameter family of target-area shifts

$K_{Lc}$0

Under this transformation, while $K_{Lc}$1, $K_{Lc}$2, and $K_{Lc}$3 remain unchanged, the force change on a bulk vertex vanishes because the signed sum of surrounding cell areas is constant under an infinitesimal bulk-vertex displacement. The interior dynamics is therefore unchanged.

This establishes a genuine parameter degeneracy: many distinct parameter sets $K_{Lc}$4 are dynamically equivalent. Fixing $K_{Lc}$5 is equivalent to fixing the global internal tissue pressure, and failure to do so undermines the physical relevance of numerical values assigned to several observables (Godolphim et al., 25 Aug 2025).

The degeneracy has immediate consequences for measured quantities. Cell pressure transforms as

$K_{Lc}$6

so only the relative pressure

$K_{Lc}$7

is invariant. Likewise, for the cell stress tensor

$K_{Lc}$8

the isotropic part shifts by $K_{Lc}$9. Replacing $k_{\max}$0 by $k_{\max}$1 restores gauge invariance (Godolphim et al., 25 Aug 2025).

The same issue affects the shape index. In the homogeneous case one defines

$k_{\max}$2

Under a global shift of $k_{\max}$3, the numerical value of $k_{\max}$4 changes even though the physics does not. The heterogeneous analysis therefore shows that any per-cell generalization of shape index inherits gauge dependence unless it is built from gauge-invariant combinations (Godolphim et al., 25 Aug 2025). A common misconception, addressed directly by this result, is that raw numerical values of shape index, cell pressure, or isotropic stress can always be compared across parameterizations without first fixing the gauge pressure.

4. Gauge fixing, boundary conditions, and curvature effects

The degeneracy can be resolved by explicit gauge fixing. To impose a prescribed gauge pressure $k_{\max}$5, one chooses $k_{\max}$6, equivalently

$k_{\max}$7

A particularly useful choice is the zero-pressure gauge (ZPG), defined by $k_{\max}$8. Since $k_{\max}$9, this requires

$G=(V,E,\mathcal T,\mathcal R)$0

The same condition can be enforced dynamically through a time-dependent shift of $G=(V,E,\mathcal T,\mathcal R)$1 that leaves vertex dynamics unchanged because the shift lies along the null direction of the force (Godolphim et al., 25 Aug 2025).

Boundary conditions determine whether the degeneracy is exact. Under periodic or fixed borders, the symmetry remains exact in the bulk. Under free boundaries, however, a boundary vertex belongs to only two cells, so the transformed force does not cancel; the degeneracy is then partially lifted, and a pressure gradient is generated from the boundary (Godolphim et al., 25 Aug 2025). If prescribed line tension is added on boundary edges, exact compensation would require tuning external tensions to cancel induced boundary-vertex forces, but in general there are more boundary-vertex force constraints than tension degrees of freedom, so the degeneracy is again broken.

Curvature adds a further qualification. On a truly curved surface with geodesic perimeters and spherical-triangle areas, the degeneracy remains exact. By contrast, in the locally planar approximation often used for spherical epithelia, the residual force change at a bulk vertex is of order $G=(V,E,\mathcal T,\mathcal R)$2, where $G=(V,E,\mathcal T,\mathcal R)$3 is typical cell size and $G=(V,E,\mathcal T,\mathcal R)$4 is sphere radius; the degeneracy is therefore only partially lifted, with the effect vanishing as $G=(V,E,\mathcal T,\mathcal R)$5 (Godolphim et al., 25 Aug 2025).

These results also dictate practical parameter-fitting strategy. Parameter-search procedures should avoid motion along the null direction $G=(V,E,\mathcal T,\mathcal R)$6. The recommended procedure is to fix a gauge at the outset and, whenever any $G=(V,E,\mathcal T,\mathcal R)$7 or $G=(V,E,\mathcal T,\mathcal R)$8 is changed, re-center all $G=(V,E,\mathcal T,\mathcal R)$9 to remain in the chosen gauge (Godolphim et al., 25 Aug 2025). This removes zero modes from inference and makes comparisons between parameter sets physically meaningful.

5. Heterogeneous control model for scale-free network growth

Li and Wang use heterogeneous vertex model in a distinct network-theoretic sense: a scale-free network evolves while vertices are regularly removed and later put back, with both disappearance frequency and inactive duration determined by vertex degree through a tier structure (Li et al., 2013). The network’s active vertices are sorted by degree, and a vertex of degree $G=(V,E,\mathcal T_V,\mathcal T_E,X)$0 is assigned to tier $G=(V,E,\mathcal T_V,\mathcal T_E,X)$1 if

$G=(V,E,\mathcal T_V,\mathcal T_E,X)$2

where $G=(V,E,\mathcal T_V,\mathcal T_E,X)$3 is the total number of tiers and tier $G=(V,E,\mathcal T_V,\mathcal T_E,X)$4 contains the highest-degree nodes. Two global parameters set the maximum durations: $G=(V,E,\mathcal T_V,\mathcal T_E,X)$5 for active-period length and $G=(V,E,\mathcal T_V,\mathcal T_E,X)$6 for inactive-period length. A node in tier $G=(V,E,\mathcal T_V,\mathcal T_E,X)$7 remains active for

$G=(V,E,\mathcal T_V,\mathcal T_E,X)$8

and inactive for

$G=(V,E,\mathcal T_V,\mathcal T_E,X)$9

Equivalently, the removal and recovery frequencies are

$N_c$0

The growth algorithm begins with $N_c$1 disconnected vertices at $N_c$2, all active. At each discrete step, timers are decremented; vertices whose active timers expire are deactivated and lose all incident edges; vertices whose inactive timers expire are reactivated and recover exactly the same set of edges they had before deactivation. After any status change, the tier is recomputed using the present $N_c$3, and the next timer is reset. One new vertex with $N_c$4 new edges is then introduced, each edge attaching independently to an active existing vertex $N_c$5 with preferential-attachment probability

$N_c$6

The analytical scaling argument tracks the total number of edges $N_c$7, which grows on average linearly, $N_c$8, but with superimposed oscillations. Defining the normalized growth rate $N_c$9, one obtains in the continuum limit

$N_v$0

and therefore for a vertex added at time $N_v$1,

$N_v$2

This gives

$N_v$3

and a stationary degree distribution

$N_v$4

Simulation results reported for this model show oscillatory growth of $N_v$5 and of the average geodesic length $N_v$6, with periodicity increasing with the number of tiers $N_v$7. The normalized growth rate $N_v$8 increases monotonically with $N_v$9 and approaches unity as $N_e$0, corresponding to recovery of pure BA growth. For $N_e$1, with $N_e$2, $N_e$3, and $N_e$4 or $N_e$5, the measured degree distributions at times $N_e$6 to $N_e$7 show clear power-law tails with fitted $N_e$8–$N_e$9, weakly sensitive to $K_{Ac}$00 and independent of $K_{Ac}$01 (Li et al., 2013).

An important corrective to an intuitive but inaccurate expectation is that repeated, degree-dependent shutdowns do not destroy the scale-free property. The model preserves scale-free topology while slowing network growth when inactive periods are long (Li et al., 2013).

6. Relation to heterogeneous graph learning and vertex-centric execution

Heterogeneous graph learning provides a separate context in which vertices, relations, and semantics are heterogeneous, although the term heterogeneous vertex model is not used there in the same biophysical or network-growth sense. In one formalization, a heterogeneous graph is a 4-tuple $K_{Ac}$02, where $K_{Ac}$03 is the set of vertices, $K_{Ac}$04 is the set of directed edges, $K_{Ac}$05 is the set of vertex types, and $K_{Ac}$06 is the set of edge types; each vertex has a type $K_{Ac}$07, and each edge has a relation $K_{Ac}$08 (Han et al., 11 Aug 2025). Another formulation writes $K_{Ac}$09, explicitly including a feature matrix $K_{Ac}$10 (Lee et al., 2021).

Two examples clarify how “heterogeneity” and “vertex-centric” reasoning appear in this neighboring literature. REGATHER decomposes a heterogeneous graph into directed homogeneous relation-type subgraphs, augments them with reversed edges, constructs high-order relation-type representations by adjacency-matrix multiplication, and applies a two-level attention mechanism: first within each relation-type neighborhood and then across relation types (Lee et al., 2021). Its stated purpose is to learn on heterogeneous graphs without manually engineered meta-paths while preserving edge-type heterogeneity and directionality.

TLV-HGNN addresses inference rather than learning objective design. It identifies two memory inefficiencies in HGNN inference: per-semantic execution stores intermediate aggregation results for each semantic before fusion, and aggregation produces redundant memory accesses through repeated loading of target-vertex features and repeated accesses to shared neighbors (Han et al., 11 Aug 2025). The proposed semantics-complete execution paradigm instead processes all semantics for a single target vertex in one pass. With the notation of that work, conventional HGNN inference first computes

$K_{Ac}$11

for each relation $K_{Ac}$12, and then fuses across relations via

$K_{Ac}$13

TLV-HGNN replaces this with a single-pass vertex-centric aggregator over $K_{Ac}$14, thereby eliminating per-semantic buffers and reducing redundant target-feature loads. Its overlap-driven grouping further exploits cross-semantic neighborhood overlap, measured by

$K_{Ac}$15

to increase on-chip reuse of shared neighbor features (Han et al., 11 Aug 2025).

These heterogeneous-graph formulations are not heterogeneous vertex models in the same disciplinary sense as the tissue and network constructions above. They nonetheless show that current usage around “heterogeneous” and “vertex” has broadened: in one line of work, heterogeneity parameterizes cell mechanics; in another, it parameterizes degree-dependent availability; in a third, it parameterizes typed vertices, edge semantics, and execution order. This suggests that the phrase requires domain qualification whenever precision matters.

7. Conceptual significance and recurring technical themes

Across the literature represented here, heterogeneity is not incidental but structurally generative. In the tissue model, heterogeneity creates a gauge symmetry in parameter space, making $K_{Ac}$16 dynamically irrelevant unless fixed and altering the interpretation of pressures, stresses, and shape indices (Godolphim et al., 25 Aug 2025). In the scale-free network model, heterogeneity enters through degree-conditioned control schedules, producing oscillatory growth and modified effective growth rate while leaving the power-law form of the degree distribution intact (Li et al., 2013). In heterogeneous-graph computation, heterogeneity appears in typed vertices and relations, leading to relation-aware aggregation, fusion, and memory-traffic optimization (Han et al., 11 Aug 2025, Lee et al., 2021).

A shared methodological theme is that naive parameterization can obscure the real dynamical degrees of freedom. In tissues, the null direction in $K_{Ac}$17 must be removed by gauge fixing. In scale-free growth, the tiered control law changes growth rate and path statistics without eliminating preferential attachment. In HGNN inference, per-semantic execution obscures the opportunity for a semantics-complete vertex-centric pass that reduces buffer and DRAM overhead. The underlying lesson is that heterogeneous vertex-based systems often possess latent structure—symmetry, control hierarchy, or overlap—that only becomes explicit when the model is reformulated around the effective units of dynamics.

For readers working across fields, the most important point is therefore semantic as well as technical: heterogeneous vertex model does not designate a single universally accepted model class. In current arXiv usage, it names at least two substantively different constructions, one in epithelial mechanics and one in controlled scale-free network growth, while neighboring heterogeneous-graph literature develops vertex-centric formalisms that are related in vocabulary but distinct in ontology and mathematical purpose (Godolphim et al., 25 Aug 2025, Li et al., 2013, Han et al., 11 Aug 2025, Lee et al., 2021).