The return-probability slope depends on both propagation and timing. Finite examples separate a genuine scaling window from waiting-time effects and eventual saturation.
A thematic guide to the listed preprint
Fractal Time and Dimensional Flow: A Temporal Ontology for Emergent Spacetime in Quantum Gravity is listed in the author’s public paper catalogue. A complete source text was not retrieved for this expansion. This guide therefore develops its stated topic using the existing article A205 and the explicit clock and return-probability constructions elsewhere on this site.
The central reading distinction is between a dimension of a coordinate space and a dimension measured by a specified probe. A temporal mechanism can change the latter without supplying a new coordinate or generating all the metric relations of a space.
Operational progress versus measured time
Let Y(u) be a diffusion indexed by operational progress u. An observation clock E(t) samples it as X(t)=Y(E(t)). If E(t) is random and independent of the spatial motion, the observed transition law averages the operational kernel over the clock distribution.
A deterministic substitution u=tβ is one special case. For a random clock, generally the average of a nonlinear function of E is not that function of the average. Replacing the integral by K(x,E[E(t)]) can therefore give the wrong return law.
An exact two-state return experiment
Take two sites with continuous-time jumps between them at rate κ. Starting at site zero, the return probability after operational time u is K00(u)=(1+e−2κu)/2. It is bounded between one half and one, so averaging it over any probability distribution of a finite nonnegative clock is well-defined.
For a deterministic clock u=tβ with the required unit conversion understood, the return law is (1+e−2κtβ)/2. The underlying graph remains two sites. At large times the probability approaches one half, so its logarithmic slope approaches zero. A finite system cannot sustain an unbounded power-law return regime forever.
Calculate the diagnostic, then name its regime
When a return observable P₀ is positive and differentiable, define ds(t)=−2d logP₀/d logt. If P₀=Ct−q on a scale interval, ds=2q there. The definition tells us exactly what is measured: a local slope.
Coincident continuum kernels can diverge after some random-clock averages, especially when their small-u singularity is too strong. A finite graph, smeared detector, or explicit cutoff removes ambiguity only if its own dependence is then studied. A fitted slope should be compared across resolutions and system sizes, with early-time and saturation effects identified.
What the DTT interpretation adds
The inner-generative role can supply operational progress, while completed observations supply the visible timing convention. This is a possible realization of the DTT distinction. To make it explanatory, the source should determine the waiting-time distribution and the record protocol together.
A selected clock law then constrains more than one observable: returns, spreading, relaxation, and fluctuations of recorded intervals. Agreement across these quantities would be stronger than choosing one exponent to reproduce a desired dimension. Six nested roles might structure the waiting mechanism, but their existence alone does not fix its probability law.
Reading route and a reproducible next study
Start with A135–A137 for random clocks, then read A138–A139 for return diagnostics. Compare A158 on finite regulators with the separate spatial-emergence questions in A211. Keep operational time, physical duration, and scale parameters visibly distinct in every equation.
A manageable next calculation is a sequence of cycle graphs of increasing size, all driven by one fixed renewal law. Plot return slopes over the same dimensionless observation range, and compare with a direct diffusion baseline. Which interval survives enlargement of the graph? Which feature disappears when the clock becomes regular? These comparisons isolate what the temporal mechanism actually explains.
Continue with the articles
- Fractal time and dimensional flow: a paper guide
Temporal statistics can alter a return-probability diagnostic without changing the number of spatial coordinates. Random-clock examples expose the finiteness and regulator conditions needed to interpret a claimed dimensional flow.
- A random clock behind dimensional flow
A renewal clock with heavy-tailed waits accumulates inner events sublinearly in observed duration. The explicit event-count model illustrates temporal intermittency while leaving the waiting law's physical origin open.
- Heavy-tailed waiting times and memory
For a heavy-tailed clock, the age of an unfinished wait changes the probability of further delay. Hiding that age can produce reduced memory even when successive waiting intervals are independently sampled.
- Subordination: diffusion on another clock
Subordination averages ordinary evolution over a normalized random operational time. It preserves probability while allowing phase decay and memory in the observed-time description.
- Spectral dimension from return probabilities
A return-probability slope defines a spectral diagnostic only when the return observable is finite. The inverse-stable point-return integral diverges in two or more dimensions, so the broad scaling claim needs a specified finite probe.
- A running temporal exponent
A scale-dependent temporal exponent can describe a crossover without deriving its underlying clock process. A normalized kernel, integrated local slope, and regulator-dependent return calculation are needed to assess the model.
- A finite regulator for spectral experiments
Finite eigenvalue and heat-trace sums provide a reproducible test of spectral scaling. Comparing them with a separate graph-distance calculation exposes cutoff effects and prevents a numerical plateau from standing in for complete geometry.
Sources and reading
Read the original source for its exact formulation and edition. The examples on this page are explanatory reconstructions.