Skip to content

Heavy-tailed waiting times and memory

Explain why long-tailed intervals can retain information about elapsed waiting time. Connect this statistical mechanism to non-Markovian behavior after temporal projection.

In this article
  1. A statistical realization of dual temporal roles
  2. Why age matters after a long wait
  3. An elementary comparison
  4. From hidden age to a memory equation
  5. The DTT connection and its limitation
  6. A finite cutoff changes long-time behaviour
  7. What must be measured separately
Key ideasSources & reading

01A statistical realization of dual temporal roles

The renewal-clock model distinguishes microscopic events, operational time u accumulated through those events, and the outer duration T used to describe observations. Standard diffusion or unitary motion is specified in u. An irregular relation between u and T then changes the observed evolution. This is compatible with the DTT idea that generative progression and completed time need not coincide, but it is a particular stochastic realization, with a chosen waiting-time distribution and independence assumptions. It does not derive those choices from the single-source ontology or from the six nested inner stages. Those stages would need a separate mechanism explaining the observed event statistics.

02Why age matters after a long wait

An exponential waiting time has the memoryless property: after surviving for an age a, the chance of waiting at least another s depends only on s. A Pareto waiting law behaves differently. Once the age exceeds the lower cutoff, its conditional survival probability is (a/(a+s))ᴰ. The longer the event has already been absent, the longer the expected remaining pause can be. The current event count alone therefore omits information relevant to the future; elapsed age is a hidden predictive variable.

Pr(τ>a+s | τ>a) = (a/(a+s))ᴰ
hazard(a)=D/a, a≥τ*
A staircase-like clock maps outer time to operational time. Three diffusion profiles on the right broaden as operational time increases.
Figure 1. A random operational clock changes observed diffusion. The illustration subordinates diffusion in operational time u to an intermittent clock u(T). Flat portions represent waiting periods. The resulting memory does not imply two independently readable laboratory clocks. View full size ↗

03An elementary comparison

For D=1/2, an interval that has already lasted age a has probability 1/√2 of lasting at least another a. At age 10a, the probability of waiting a further a becomes √(10/11), approximately 0.953. The same additional duration has a different conditional probability because the observed age differs. This calculation does not imply that the underlying sequence is nonlocal in its event index. The waiting times can be independent even though the process viewed only through its outer-time count retains memory.

04From hidden age to a memory equation

If position changes at events but the age variable is not observed, the reduced position distribution generally depends on previous times through a memory kernel. In a scaling limit the power-law clock produces a fractional time derivative. The kernel is a compact representation of unresolved waiting histories; it is not evidence that a physical force acts backward in time. Restoring sufficient variables, such as age and event state, can provide a time-local description in an enlarged state space.

Caputo derivative of order D: C D_Tᴰ f(T)=Γ(1−D)⁻¹∫₀ᵀ(T−s)^(−D)f′(s)ds

05The DTT connection and its limitation

DTT assigns different roles to hidden generation and outer records. The age example shows a precise way that projecting onto outer records can erase predictive information and induce memory. It does not show that every quantum memory effect has this origin. Exponential cutoffs, correlations between waits, detector dead time and ordinary trapping processes can generate related phenomena. Distinguishing them requires more than fitting one exponent. A complete source model should explain the waiting statistics and identify a signature that separates its completion mechanism from these conventional alternatives.

06A finite cutoff changes long-time behaviour

If the Pareto tail is truncated or exponentially tempered, the mean waiting time becomes finite. At sufficiently long observation times the renewal count then grows approximately linearly, even though an intermediate window can still look anomalous. This provides a controlled route back to an ordinary effective clock. It also means that a measured sublinear regime does not establish an exact scale-free law at all times. For DTT, the crossover scale could be tied to a finite memory budget or a relaxation mechanism, but that connection must be calculated. The distinction between an asymptotic law and a finite scaling window is central to evaluating any claimed temporal dimensional flow.

07What must be measured separately

The clock exponent D, the number of spatial coordinates, spectral dimension and a gravitational scaling dimension have different definitions. A random clock can change a diffusion diagnostic on a spatial manifold whose topology is unchanged. Similarly, an effective propagation delay is not automatically a change in a fundamental vacuum cone. A physical SMM/DTT application should identify a clock observable, state how its statistics are obtained, and compare the resulting predictions with a baseline using the same apparatus. Finite cutoffs, observation windows and normalization of probability kernels must be stated explicitly: their effects can be as important as the asymptotic power law.

Probability normalization is a practical consistency check throughout this programme. Integrating the clock density over operational time must give one at every observed time. Restoring a microscopic timescale inside a Laplace exponent can require a corresponding prefactor outside it; otherwise the averaged evolution will not preserve total probability. The same check should be made before calculating moments, return probabilities or quantum coherences. A fitted power law can look plausible even when a kernel is misnormalized, so explicit normalization is part of the derivation rather than a cosmetic convention.

KEEP THE CONNECTION

Key ideas

  • Heavy-tailed waits retain information about elapsed age.
  • Independent waits can still produce non-Markovian reduced observations.
  • A memory kernel records hidden history rather than retrocausal influence.

Scope of the argument. Exact conditional-probability example for the assumed law; microscopic temporal ontology is not established.

Sources & further reading

  1. smm_dtt_fractal_time_v3.pdf — working draftpp. 4–6, §§3–4; conditional-survival calculation derived here from the stated Pareto law
Source editions and catalogue entries
Working manuscript

Fractal time — stochastic renewal-clock model, working draft v3

Draft file: smm_dtt_fractal_time_v3.pdf

Working manuscript. Article-level references identify the consulted sections and the scope of the interpretation. No public URL was supplied for this exact manuscript version.

Source register →