Dissolution, capacity and visibility in networks that grow into their voids

In many networks a new link appears where the existing structure leaves a place for it: two nodes with enough common neighbours tend to become linked. Steretic logic makes such places, voids, its basic objects and adds the activity of nodes, forbidden pairs, rival forms competing for a place, and observers with incomplete maps. We give exact form to four informal notions of that theory. (i) Dissolution: a node is dissolved when its closed neighbourhood coincides with that of a partner; dissolution is reversible, and at threshold one every node of a saturated network is dissolved (monoculture). In a toy dynamics with turnover we find three regimes: frozen monoculture, reversible dissolution and no dissolution; identifying dissolution with death drives the network to extinction. (ii) Capacity: without capacity constraints every complete history of filling ends in the same network, even with activity constraints and forbidden pairs; as soon as some place has fewer slots than rivals able to occupy it, the outcome depends on the order of events. Capacity is thus the only source of lock-in in this class of models. For two rivals and one slot we give the probability that an earlier but less adequate form wins. (iii) Visibility: an observer who knows each link with probability q sees a void with c common neighbours with probability P[Bin(c, q^2) >= k]; merging the maps of n observers replaces q by 1 - (1 - q)^n. (iv) Timeliness: waiting times of voids are measured on the clocks of the nodes, which turns the rule against undated forecasts of dormant voids into a theorem. A reading of the step law in which the mediators of a link must also be active changes growth near the threshold by a factor of seven and is open to a direct test.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-18
DOI
https://doi.org/10.5281/zenodo.24334870
Primary Topic
Complex Network Analysis Techniques
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Dissolution, capacity and visibility in networks that grow into their voids

Oleksandr Krol
Zenodo (CERN European Organization for Nuclear Research)
Complex Network Analysis Techniques
preprint

Dissolution, capacity and visibility in networks that grow into their voids

Oleksandr Krol
preprint en

Abstract

In many networks a new link appears where the existing structure leaves a place for it: two nodes with enough common neighbours tend to become linked. Steretic logic makes such places, voids, its basic objects and adds the activity of nodes, forbidden pairs, rival forms competing for a place, and observers with incomplete maps. We give exact form to four informal notions of that theory. (i) Dissolution: a node is dissolved when its closed neighbourhood coincides with that of a partner; dissolution is reversible, and at threshold one every node of a saturated network is dissolved (monoculture). In a toy dynamics with turnover we find three regimes: frozen monoculture, reversible dissolution and no dissolution; identifying dissolution with death drives the network to extinction. (ii) Capacity: without capacity constraints every complete history of filling ends in the same network, even with activity constraints and forbidden pairs; as soon as some place has fewer slots than rivals able to occupy it, the outcome depends on the order of events. Capacity is thus the only source of lock-in in this class of models. For two rivals and one slot we give the probability that an earlier but less adequate form wins. (iii) Visibility: an observer who knows each link with probability q sees a void with c common neighbours with probability P[Bin(c, q^2) >= k]; merging the maps of n observers replaces q by 1 - (1 - q)^n. (iv) Timeliness: waiting times of voids are measured on the clocks of the nodes, which turns the rule against undated forecasts of dormant voids into a theorem. A reading of the step law in which the mediators of a link must also be active changes growth near the threshold by a factor of seven and is open to a direct test.

Zenodo (CERN European Organization for Nuclear Research)
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