Scale-rich network metamaterials grow by local rules on a recursive cell division

Scale-rich (SR) metamaterials are planar ligament networks grown by nucleating a segment at a random point and angle and extending it until it meets the existing structure. In the dual graph, where ligaments are nodes and junctions are links, the degree distribution has a $k^{-3}$ tail. We show that the SR construction is Cowan's iterated cell division with area-weighted selection, so the cell genealogy is a random binary search tree, and that the dual grows by a face-local rule: a new node joins two nodes on the boundary of one face. Preferential attachment on face incidences would give the Barabási--Albert law, but the geometry works differently. A ligament is hit in proportion to its length, fixed at birth, and its degree is close to a Poisson variable with mean $4\ell_i(\sqrt T-\sqrt i)/c_L$, without reinforcement. Length is a fitness assigned by the cell hierarchy, $\ell_i\propto i^{-1/2}$, and the $k^{-3}$ tail follows. Integral geometry gives the probability that a new ligament cuts off a corner of its cell, which sets the triangle closure and the clustering spectrum $C(k)\simeq2p/k$. Square-closing splits raise the shortest-path multiplicity above its value at fixed degree sequence. Thickness, jamming, angle sets and density gradients leave $γ=3$; coherent orientation fields give $γ\simeq2.4$--$2.5$. For plates in three dimensions the fitness is the birth area and $γ=5/2$, whereas preferential attachment would give $2.44$; fluctuation tests select the fitness mechanism. The reported per-ligament energy law cannot distinguish degree from length or age.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-12
DOI
https://doi.org/10.48550/arxiv.2611.16513
Primary Topic
Complex Network Analysis Techniques
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Scale-rich network metamaterials grow by local rules on a recursive cell division

Alexei Vazquez
arXiv (Cornell University)
Complex Network Analysis Techniques
preprint

Scale-rich network metamaterials grow by local rules on a recursive cell division

Alexei Vazquez
preprint en

Abstract

Scale-rich (SR) metamaterials are planar ligament networks grown by nucleating a segment at a random point and angle and extending it until it meets the existing structure. In the dual graph, where ligaments are nodes and junctions are links, the degree distribution has a $k^{-3}$ tail. We show that the SR construction is Cowan's iterated cell division with area-weighted selection, so the cell genealogy is a random binary search tree, and that the dual grows by a face-local rule: a new node joins two nodes on the boundary of one face. Preferential attachment on face incidences would give the Barabási--Albert law, but the geometry works differently. A ligament is hit in proportion to its length, fixed at birth, and its degree is close to a Poisson variable with mean $4\ell_i(\sqrt T-\sqrt i)/c_L$, without reinforcement. Length is a fitness assigned by the cell hierarchy, $\ell_i\propto i^{-1/2}$, and the $k^{-3}$ tail follows. Integral geometry gives the probability that a new ligament cuts off a corner of its cell, which sets the triangle closure and the clustering spectrum $C(k)\simeq2p/k$. Square-closing splits raise the shortest-path multiplicity above its value at fixed degree sequence. Thickness, jamming, angle sets and density gradients leave $γ=3$; coherent orientation fields give $γ\simeq2.4$--$2.5$. For plates in three dimensions the fitness is the birth area and $γ=5/2$, whereas preferential attachment would give $2.44$; fluctuation tests select the fitness mechanism. The reported per-ligament energy law cannot distinguish degree from length or age.

arXiv (Cornell University)
Complex Network Analysis Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon