The connectivity-shell hypothesis for the metric/topological picture of space-time

Let STST be the supergraph whose grains are maximal complete subgraphs, or mss, of the underlying network, with neighborhood structure defined by intersection of cliques. For node sets or subgraphs AA and BB, define their connectivity by

cAB:=ABABm,0cAB1,c_{AB}:=\frac{|A\sim B|}{|A\sim B|_m},\qquad 0\leq c_{AB}\leq 1,

where AB|A\sim B| is the number of bonds joining AA to BB and ABm|A\sim B|_m is the maximal possible number. Let S0S_0 be a typical grain, and let {Sν0}\{S^0_\nu\}, {Sν1}\{S^1_{\nu'}\}, and so on denote successive shells around it in STST.

Connectivity-shell hypothesis. When the unfolding process is fully developed, the infinitesimal neighborhood of S0S_0 is densely connected to it, and connectivity decreases through successive shells:

cS0S0=1,cS0Sν01,c_{S_0S_0}=1,\qquad c_{S_0S^0_\nu}\lesssim 1, 1cS0Sν0cS0Sν1cS0Sν2.1\geq c_{S_0S^0_\nu}\geq c_{S_0S^1_{\nu'}}\geq c_{S_0S^2_{\nu”}}\geq\cdots.

Moreover, this shell structure should be consistent with the neighborhood structure of STST: node distance on STST should correspond, more or less, to decreasing connectivity.

The hypothesis is intended to provide a metric/topological interpretation of the emergent space-time supergraph. The paper motivates it by the observed regularity of random graphs and the peaked typical size of maximal complete subgraphs, but presents the consistency with the STST neighborhood structure as an expectation rather than a proved result.

Sources & referencesView supporting material

Primary source

Manfred Requardt, “Space-Time as an Orderparameter Manifold in Random Networks and the Emergence of Physical Points”, arXiv:gr-qc/9902031 (1999).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.