A causal-set d’Alembertian is a sum over the causal past of a point, with a weight that depends on the number of points in the causal interval between the two. Its expectation on a Poisson sprinkling of density is the d’Alembertian of a smooth field [Benincasa–Dowker] [Aslanbeigi–Saravani–Sorkin]. Does one realisation compute when the weights act at the scale of the discreteness and varies on a scale ? For the Benincasa–Dowker weights and for a five-layer variant, on the Gaussian packets examined, it does not, in root-mean-square error. For a timelike packet of width between and (eight widths tabulated), the standard deviation of the Benincasa–Dowker operator at a point is at least about : the inequality (6) behind this is proved and its value is computed. Sampled standard deviations are to times at , depending on the kernel and the carrier.
A lattice has no Poisson randomness within a realisation. We take with the anisotropic form , embedded in Minkowski space and randomly boosted and translated (the orbit lattice of section 3), which is Poincaré invariant in law. Its weights can be retuned to the interval statistics of the lattice so that the mean reproduces on the packets examined (section 4, numerical). A single realisation nevertheless carries an operator with no symbol, and for a kernel with non-zero nearest-neighbour weight the operator maps every non-zero finitely supported field outside the square-summable functions (Proposition 4, proved). The relative errors computed on four Gaussian packets lie between and ; Proposition 4 does not bound them. Superposing independent copies of the lattice brings the variance-to-mean ratio of the counts in a diamond to 1, the Poisson value (Proposition 5); the operator on superposed lattices is not computed.
Sorkin argued that Lorentz-invariant discreteness requires a non-locality scale [Sorkin], and the generalised d’Alembertians of Aslanbeigi, Saravani and Sorkin [Aslanbeigi–Saravani–Sorkin] are families with such a scale. Saravani and Aslanbeigi studied number fluctuations of Poisson sprinklings and of two-dimensional Lorentzian lattices [Saravani–Aslanbeigi]. The lower bound below starts from the first term of the chaos expansion of a Poisson functional [Last–Penrose]; the evaluation of that term for four-dimensional layer kernels is new here. The conditions on the weights that make the mean work are derived in mixed-Poisson and signed substrates, the invariant random lattices are described in Lorentz-invariant point sets, and the argument that a Zariski-dense stabiliser forbids a symbol is given in lattices with an arithmetic Lorentz group.
1. Layer operators at the kernel scale
Let be a locally finite set in with signature , so that (with signature the sign of and that of change), and let . For in the causal past, let be the number of points of in the open interval between and . A layer operator with weights , local coefficient and normalisation acts on a function by
For a Poisson process of unit density the interval between and has volume , with the proper time, and is Poisson distributed with mean . Hence with
The Mellin transform of is . The conditions of Aslanbeigi, Saravani and Sorkin for the mean to tend to are and , with fixed by the value of [Aslanbeigi–Saravani–Sorkin]. They are derived in mixed-Poisson and signed substrates, and we use them as given. We use two weight sets, both with and ( for the Benincasa–Dowker set and for the five-layer set below).
The Benincasa–Dowker weights are , as in the Remark on the causal-set d’Alembertian in horizon counts and the area law, where the signature is and the normalisation is . For them , so that (hence ) and . In causal-set counts and dimensionless constants and boundary and corner terms the sign of is absorbed into the weights, so that the normalisation is and the Benincasa–Dowker weights are with the symbol . The five-layer set has and also , so . Its extra zero at removes the term of order , proportional to the volume of the timelike boundary, that the Benincasa–Dowker action has on the regions of boundary and corner terms. We use it to test how the fluctuation depends on the weights.
The test field is a Gaussian packet,
where , with the carrier along the time axis (timelike, ) or along (spacelike, ). Lengths are in units of . Then (timelike) or (spacelike).
The mean of (1) at a point of a Poisson sprinkling, computed by quadrature in hyperbolic coordinates and divided by is, for :
| kernel and carrier | |||||
|---|---|---|---|---|---|
| Benincasa–Dowker, timelike | 0.82 | 1.15 | 1.12 | 1.05 | 1.02 |
| Benincasa–Dowker, spacelike | 0.48 | 0.67 | 0.86 | 0.95 | 0.98 |
| five-layer, timelike | 0.98 | 1.24 | 1.12 | 1.04 | |
| five-layer, spacelike | 0.08 | 0.33 | 0.66 | 0.86 | 0.95 |
The mean ratio tends to 1 as grows, with corrections that fall like a power of ; for the five-layer kernel at it has the opposite sign. The mean does not fix the error of one realisation; the fluctuation around it is bounded in section 2.
2. The variance on a Poisson sprinkling
We evaluate at a point of the sprinkling placed at the origin. By the Mecke formula the other points then form a Poisson process of unit density (the Palm configuration), and with . For a Poisson process with -finite intensity measure and a square-integrable functional , put , the cost of adding the point . The Wiener–Itô chaos expansion gives [Last–Penrose], so that
In words, the variance is at least the mean square response of to the addition of one point. The terms with are discarded in (4); the first term is the only one we compute. The functional is square integrable for the packet (3), since its first and second absolute moments are bounded by integrals of and against , which converge by the Gaussian decay of .
Proposition 1 (the expected add-one cost). For the operator (1) at the origin,
where and are the volumes of the intervals ending at .
A new point in the past of adds a term of its own and raises by one the interior count of every earlier point for which lies in the interval between and ; the first term of (5) is the former and the integral is the latter.
Proof. If , the point enters no term and lies in no interval ending at , so . If , the new point contributes , where is Poisson with mean , and the expectation of this term is . For each with (equivalently ), the count increases by one and the term changes from to . By the Mecke formula, given a point at the rest of is Poisson, so the interior count excluding is Poisson with mean , and for (differentiate (2)). Campbell’s formula gives the integral over .
Corollary 2 (variance lower bound). With ,
Inequality (6) holds for every and every weight set; it is (4) with the Lebesgue measure of the past cone and (5) inserted.
Size of the bound for a timelike packet
For the timelike packet, write and with unit future vectors, that is, points of the hyperbolic space . Then holds exactly when and the hyperbolic distance of and is smaller than . The packet depends on only through its rapidity, and the integral over the angle at is that of a Gaussian times a cosine, which is a difference of complex error functions. What remains is a four-dimensional quadrature, accurate to about . The table gives , which by (6) is a lower bound for the standard deviation of in units of the signal, and the same divided by .
| Benincasa–Dowker | divided by | five-layer | divided by | |
|---|---|---|---|---|
| 2 | 2.69 | 0.34 | 16.3 | 2.0 |
| 3 | 8.95 | 0.33 | 62.5 | 2.3 |
| 4 | 21.8 | 0.34 | 153 | 2.4 |
| 5 | 43.7 | 0.35 | 303 | 2.4 |
| 7 | 125 | 0.37 | 859 | 2.5 |
| 12 | 667 | 0.39 | 4550 | 2.6 |
| 20 | 3180 | 0.40 | 21700 | 2.7 |
| 32 | 13200 | 0.40 |
The ratio to lies between and for the Benincasa–Dowker weights over and between and for the five-layer weights over , and it increases slowly with ; the table is not extrapolated. The first-chaos term was not evaluated for the spacelike carrier.
A heuristic for the cube: for fixed the Gaussian confines to a region of hyperbolic volume proportional to . If the bracket in stays of order one there, which the zeros of at , and would arrange by cancelling the growth of the -integral, then , and with the ratio grows like .
Standard deviation by sampling
We sampled Palm configurations of a unit-density Poisson process in the past cone of , keeping the points with interval volume to at most 16 and Euclidean norm at most (the omitted points have total probability of order or less), computed the interior counts exactly and evaluated for (3). The table gives and the number of samples. The relative uncertainty of each entry is about 5%: resampling the samples (a bootstrap) gives 1% to 4%, and the laws are heavy tailed (rare very large values dominate the variance), so repeated runs scatter somewhat more.
| samples | Benincasa–Dowker, timelike | Benincasa–Dowker, spacelike | five-layer, timelike | five-layer, spacelike | |
|---|---|---|---|---|---|
| 2 | 4000 | 19 | 10 | 324 | 190 |
| 3 | 3000 | 87 | 50 | 1730 | 964 |
| 4 | 2000 | 209 | 136 | 4240 | 2680 |
| 5 | 1500 | 407 | 294 | 8340 | 6030 |
| 7 | 600 | 1110 | 906 | 22700 | 18200 |
For the timelike packet the standard deviation exceeds the first-chaos bound of the table above by a factor of 9 to 10 for the Benincasa–Dowker weights and 26 to 28 for the five-layer weights at . The first chaos therefore carries about 1% of the variance of the Benincasa–Dowker operator and 0.1% of the five-layer operator, and the remainder is in the higher chaoses that (6) discards. The growth from to corresponds to exponents in the four columns, each uncertain by about . The timelike columns follow the cube of the bound, and the spacelike ones grow slightly faster over this range.
A large standard deviation does not by itself exclude a heavy-tailed law with a small typical error, so we also examine the distribution of the error. For the Benincasa–Dowker weights and the timelike packet, the fraction of samples with is about at and below at . The median relative error is about 12, 58, 140 and 270 at , uncertain by about 10%, which is 0.6 to 0.7 times the standard deviation.
On the Gaussian packets examined, with widths from to and both carriers, the single-realisation operator at the kernel scale is therefore dominated by fluctuations. The bounds and samples above are for . A kernel with a non-locality scale , or an average over many points of one realisation as in Sorkin’s smeared operators [Sorkin] [Aslanbeigi–Saravani–Sorkin], may reduce the fluctuations; neither is evaluated here.
3. The cocompact orbit lattice
Let on with polar form , and let , so that has covolume 1 and squared proper time . Let , acting on . A realisation is with and ; the orbit lattice is the random lattice with Haar distributed on and uniform on . A vector with and is said to lie on shell .
Four classical results are used. The theorem of Borel and Harish-Chandra: for a semisimple -group the group of integral points is a lattice. Godement’s compactness criterion (see Borel’s Introduction aux groupes arithmétiques): this lattice is cocompact if the -group is anisotropic, that is, if the form has no non-trivial rational zero. Borel density: a lattice in a simple group without compact factors is Zariski dense. Mahler’s compactness criterion: the set of unimodular lattices in whose non-zero vectors all have Euclidean norm at least is compact.
Theorem 3 (the orbit lattice). (i) has no non-trivial zero in , so has no null vectors, and for . (ii) is a cocompact lattice in , hence Zariski dense. (iii) The random lattice is Poincaré invariant in law and ergodic under the Poincaré group, though not under translations alone. (iv) There is such that every lattice has covering radius at most . Consequently, for every realisation and every pair of lattice points with proper time , the interval contains a lattice point, and the interior count satisfies with and a constant independent of the realisation. (v) for . (vi) There is such that for every realisation and every causal interval of volume ,
where is the number of lattice points in . (vii) For on shell the interior count is ; on shell 4 it is if and otherwise.
An anisotropic form keeps the lattice away from the light cone in every frame, so the whole boost orbit is a compact family of lattices; this is behind (i) to (iv). Item (v) is a point reflection, (vi) says that a bounded covering radius forces the lattice count to follow the volume up to a boundary term, and (vii) comes from the reverse triangle inequality for lattice vectors.
Proof. (i) Suppose with integers not all zero, divided by their greatest common divisor so that they are coprime. If is odd, the left side is , but squares mod 8 are and no sum of three of them is . If is even, the right side is , which forces even, contradicting coprimality.
(ii) By (i) the -group is anisotropic; apply the Borel–Harish-Chandra theorem, Godement’s criterion and Borel density.
(iii) The group of affine Lorentz maps acts transitively on the space of realisations, which carries a finite invariant measure by (ii); a transitive action preserves the invariant measure and is ergodic. Translations alone fix the orientation of the lattice and are not ergodic.
(iv) In coordinates where the metric is Euclidean, , so by (i) every non-zero vector of every lattice has Euclidean norm at least . By Mahler’s criterion the orbit lies in a compact set of lattices, on which the covering radius is bounded by some . In the rest frame of an interval of proper time , which is a point of the same orbit, the interval contains the Euclidean ball of radius about its centre (a point at distance from the centre with time offset has iff , whose minimum over is ). This ball contains a lattice point once . More precisely, the Voronoi cells of the lattice points have volume 1 and radius at most , and they cover the concentric ball of radius ; the points belonging to these cells lie in the ball of radius , so the ball contains at least lattice points. For we have , and with , which gives . For the volume is bounded, and the bound holds with .
(v) The map is an involution of the lattice points in the open interval between and , with the only possible fixed point , which is a lattice point iff .
(vi) Work in the rest frame of , where is a convex body of diameter with and boundary area . The Voronoi cells of the lattice points have volume 1 and radius at most . The cells of points in lie in the parallel body , and the cells covering the inner parallel body belong to points of . Hence . The collar of width inside a convex body has volume at most , and by Steiner’s formula . Both are for .
(vii) For future timelike , the reverse Cauchy–Schwarz inequality gives , with equality iff are proportional. Hence . If lies in the interval between and , then is also future timelike, and by (i). Also with an integer, so . For the sum is at least , so no such exists. For the parity forces to be odd, and the smallest such pair has . For the only pair with is , with equality, so , which lies in the lattice iff .
For a Poisson sprinkling, almost every realisation contains empty intervals of arbitrarily large volume, since disjoint intervals are independent and each of volume is empty with probability ; so no bound like (7) holds. Bound (7) gives , which is weaker than the Poisson value .
Number variance of the orbit lattice
For a causal diamond of volume with a uniformly random centre in a cell of and a random rest-frame velocity , the lattice count has the law of the count of the orbit lattice in a fixed diamond. We drew with the hyperbolic density uniform on the ball of radius (an approximation to the invariant probability measure on that improves as grows) and counted the points of in the diamond, with samples per entry. The mean of was in each case, and was:
| 4 | 0.521 | 0.478 | 0.485 | 0.481 |
| 16 | 0.358 | 0.325 | 0.331 | 0.328 |
| 64 | 0.218 | 0.203 | 0.205 | 0.203 |
The ratio is below the Poisson value 1 and falls roughly like between and (variance growing like ). The dependence on is the bias of the ball average, of about 8% between and , 1% to 2% between and , and below 1% between and . Saravani and Aslanbeigi conjecture that no process has with for all large intervals [Saravani–Aslanbeigi]. The conjecture is asymptotic, the orbit lattice is an admissible test of it, and data up to do not decide it. The same data bear on the question left open in quantum sprinklings, whether a point process invariant in law under translations and boosts can have a number variance that grows more slowly than the volume. The orbit lattice is invariant in law, so the question applies to it; its variance-to-mean ratio is at , the data do not show whether it tends to , Corollary 8 there (pair correlations with integrable ) does not apply to it, and the proved bound (7) gives only .
4. Interval statistics and weights on the orbit lattice
Take a realisation through , . Its future vectors are with on a shell , of proper time with and interval volume . The interior count depends on alone, since maps the lattice and the interval together. Let be the density, per unit hyperbolic measure (the volume element of the unit hyperboloid , in which a ball of radius has volume ), of vectors on shell ; by invariance it does not depend on . Let be the fraction of those vectors with interior count . Since , unit density of the point set requires .
Shell densities and interior-count laws
We enumerated the lattice vectors on the shells with and computed the interior count of each by exact enumeration of the lattice points of the interval. For the densities , counted in hyperbolic balls up to , are times the integers
to within for and for (the counts converge slowly, because the error in hyperbolic lattice-point counts decays only like a power of the radius). The sum of the first sixteen is , against from the unit-density requirement.
A -orbit of vectors with stabiliser has hyperbolic density , with a fundamental domain of in , so every density is a sum of such terms. We have not computed and the stabilisers. The sixteen densities and the measured class densities in the table are the evidence that is an integer for every class , and we use this as an identification rule; the factor 16 is the smallest integer multiplier that makes the sixteen measured densities integral, and it is not derived.
The table gives the classes on shells 1 to 10. For shells 1, 2, 3 and 5 and for the split of shell 4 the laws are proved by Theorem 3(vii). For shells 6, 8, 9 and 10 the laws are the rational values for which every is an integer and which agree with the enumeration; shell 7 is treated below. The last column is the measured at the cutoff , from at least vectors per shell.
| and | measured | |||
|---|---|---|---|---|
| 1, 2, 3, 5 | 4, 12, 6, 12 | : all | 1 | proved, Theorem 3(vii) |
| 4 | 12 | : 8; : 4 | 2/3, 1/3 | 8.01, 4.02 |
| 6 | 18 | : 6; : 12 | 1/3, 2/3 | 6.03, 12.06 |
| 7 | 25 | : 1; : 24 | 1/25, 24/25 | 1.00, 24.07 |
| 8 | 12 | : 12 | 1 | 12.11 |
| 9 | 28 | : 4; : 24 | 1/7, 6/7 | 3.96, 23.92 |
| 10 | 36 | : 24; : 12 | 2/3, 1/3 | 24.22, 12.03 |
On shell 4 the counts are proved by Theorem 3(vii), and , since the vectors with are the doubles of the vectors on shell 1.
The laws on shell 7 follow from the structure of the interval and two computed inputs. An interior lattice point of a vector on shell 7 has and , with , in : both are at most by the reverse triangle inequality of the proof of Theorem 3(vii), and their sum is odd. So , where is the number of vectors on shell 1 with . Two distinct such vectors would give (since is an integer, at least 1 by the reverse Cauchy–Schwarz inequality, with equality only for proportional vectors), with orthogonal to ; but the components of and orthogonal to have each, which gives by the triangle inequality for the negative-definite form on the orthogonal complement of . Hence and on shell 7.
Each vector on shell 1 has exactly six vectors on shell 2 with . Write . Then and , and is future timelike because and . So the partners of are the vectors of norm 2 for in . Since , , so is a positive definite ternary lattice of determinant 7. A reduced Gram matrix of such a lattice has , which leaves finitely many candidates, and three classes remain, with Gram matrices , and . Over the 7-adic integers is , and the determinant of the part prime to 7 (an invariant of the form, modulo squares) is , which is not a square mod 7. That part is plus the rank-2 part of prime to 7, and the sign of the form does not change a determinant of rank 2, so the latter has non-square determinant for . For the three lattices it is , and , with determinants , and mod 7, and the squares mod 7 are . Hence is the third lattice, which has six vectors of norm 2. The point then lies on shell 7 with , so . Counting the -orbits of these pairs by and by gives , that is .
The ratio decides between (ratio ) and (ratio ). At single cutoffs it lies between and , which is the size of the gap, so we average over cutoffs; the average is . This is numerical support without an error bound. The Siegel product of the local densities of at , and the primes dividing gives , and all sixteen integers above for ; we have not proved that it applies to these hyperbolic densities. A count of the vectors alone does not separate the two values.
On shells 11 to 60 every vector examined with has . Theorem 3(iv) gives for all large , uniformly in the realisation, but with no explicit threshold, so shells above 60 are not examined. Since for , only shells 1 to 10 enter the sums below, on this numerical basis.
Weights that reproduce the mean
The mean of (1) at is . It has the form of the Poisson mean with the measure replaced by , where . Because for and the interior counts on shells above 10 are at least 6 in the range examined, the Mellin transform is a finite Dirichlet polynomial,
which is entire. On the Haar-random lattice in two dimensions, by contrast, the empty-interval density decays like and the zeroth moment diverges logarithmically (Lorentz-invariant point sets). The derivation of the infrared conditions uses only the Mellin transform of the radial density, and we assume that it carries over. The conditions become
with . The condition at , the extra zero of the five-layer set, is added so that there are five linear conditions for the five weights ; the system has condition number in the 1-norm. With the laws of the table above, its solution is
The mean ratio , computed by the quadrature of section 1, is for :
| packet | ||||
|---|---|---|---|---|
| timelike | 0.971 | 1.256 | 1.127 | 1.047 |
| spacelike | 0.300 | 0.645 | 0.855 | 0.948 |
The ratio tends to 1 and is close to the values of the five-layer Poisson kernel in section 1. This follows from the construction when the laws are those of the lattice, so the table does not test the laws. The weights depend on the laws sensitively. Weights solved for and applied with change the timelike ratio at from to , because a shift of in one probability breaks the cancellation of the constant mode and the error is amplified by . Weights solved for and applied with , a shift of , give , and if the shell density is kept and only the split into the classes and changes; if instead the class is kept at , as the pair count requires, they give , and . Rounding the weights does the same: at nine significant digits the ratio at is , and twelve digits reproduce . Reproducing the mean on the orbit lattice therefore needs the exact laws and weights to twelve digits, and the identification of the laws in the table is the input.
5. A single realisation of the orbit lattice
Take a realisation through and apply a Lorentz transformation so that . For a future vector let , where is the number of points of in the interval , and let for other . Then , and the kernel is bounded and supported on finitely many shells (Theorem 3(iv); numerically on shells 1 to 10 for the weights of section 4).
Proposition 4 (a layer operator on the orbit lattice has no symbol). The stabiliser of in is Zariski dense, and the kernel is bounded, -invariant, supported on finitely many shells, and non-zero at the vectors of shell 1 if . Therefore, by Proposition 1 of lattices with an arithmetic Lorentz group, the Fourier series of the kernel coincides with an integrable function on no open set of the Brillouin torus; and for every finitely supported on , the function is not square summable. Moreover every bounded operator on that commutes with the translations of and with is a multiple of the identity, so it cannot have the symbol of on any open set of momenta.
Proof. is conjugate to , which is Zariski dense by Theorem 3(ii). It preserves , the form and the time orientation, hence the interval counts: . So is -invariant; it is bounded because only the finitely many values occur, and it vanishes outside finitely many shells by Theorem 3(iv). The vectors of shell 1 have by Theorem 3(vii), and shell 1 is non-empty (it contains ), so there if . Proposition 1 of that page applies and gives the first statement. Suppose is finitely supported and were in , where is a non-zero trigonometric polynomial. On the open set , which is non-empty, would be locally square integrable, contradicting Proposition 1. The last statement is Theorem 1(a) of the same page, applied to and .
So the response to a localised field is not a localised field: a retarded layer sum with weights tuned to give the correct mean maps any compactly supported test field to a function of infinite norm. A Gaussian packet is not finitely supported and the sums converge, so Proposition 4 does not give the size of the error for it; that depends on cancellations among the shell sums, which we evaluate.
Errors on four packets
We took the unboosted realisation (, ) with the weights, and of section 4, computed the interior count of every vector with in the packet’s window by exact enumeration, and evaluated for the packet (3) at rest and boosted to speed along . The relative error is:
| packet | ||||
|---|---|---|---|---|
| timelike, | ||||
| spacelike, | ||||
| timelike, | not computed | |||
| spacelike, | not computed |
The windows and give the same values to the digits shown. One realisation, one lattice frame and four packets (two carriers, two velocities) give no estimate of the typical error or of its growth exponent, and the values range over four orders of magnitude. The error is not small at any tried, and at rest it is larger at than at by factors of and . At the errors lie in the range of the Poisson standard deviations of section 2 ( to ). At they lie between and , against the first-chaos bounds and of the two Poisson kernels.
6. Superposed lattices
Independent randomness can be added to the lattice by superposition, and Proposition 5 gives its effect on the number statistics only. Let be the union of independent copies of the random orbit lattice, each of density (a copy is the density-one random lattice scaled by ), so that the density is 1.
Proposition 5 (number variance of a superposition). For every causal diamond of volume , , where is the ratio for a single density-one copy and a diamond of volume . Moreover as , so for fixed the ratio tends to 1 as .
Proof. The counts of the independent copies are independent. Scaling by maps a copy to a density-one copy and to a diamond of volume , and the law of the random lattice is invariant under Lorentz transformations, so has the law of with . Then , and . For the limit: a diamond of proper time has Euclidean diameter at most in its rest frame, where every lattice of the orbit has no non-zero vector shorter than (proof of Theorem 3(iv)). For the diamond contains at most one lattice point, so and .
As at fixed the variance-to-mean ratio of the counts approaches the Poisson value 1. The operator error is large already for the Poisson sprinkling (section 2), so the counts do not determine it, and the operator on for is not computed.
7. Frames and open quantities
A smearing on the orbit lattice that uses a frame, for instance a time direction, breaks the invariance of the operator under , and Proposition 4 does not apply to it. It brings back the questions of frame leakage.
The number variance of the orbit lattice grows like between and , and the proved bound is ; larger diamonds, or a proof, would fix the asymptotic law. For the Poisson operator, (6) accounts for about 1% of the variance for the Benincasa–Dowker weights and the timelike carrier, so an analytic form of the standard deviation needs the higher chaoses; the first chaos is not evaluated for the spacelike carrier, and the growth with beyond the sampled range is not known. For a single realisation of the orbit lattice, four packets in one frame give errors from to and fix no growth exponent; packets of more widths and in more frames would show whether the exponent differs from the value 3.0 to 3.5 found for the Poisson sprinkling.
References
- Benincasa, Dowker, “The scalar curvature of a causal set,” Phys. Rev. Lett. 104 (2010) 181301, arXiv:1001.2725. Used for: the layer weights .
- Aslanbeigi, Saravani, Sorkin, “Generalized causal set d’Alembertians,” JHEP 06 (2014) 024, arXiv:1403.1622. Used for: the conditions on the weights in section 1 and the smeared operators with a non-locality scale.
- Sorkin, “Does Locality Fail at Intermediate Length-Scales,” arXiv:gr-qc/0703099. Used for: the non-locality scale and smeared operators.
- Saravani, Aslanbeigi, “On the causal set-continuum correspondence,” arXiv:1403.6429. Used for: the number-variance conjecture of section 3.
- Last, Penrose, “Poisson process Fock space representation, chaos expansion and covariance inequalities,” arXiv:0909.3205. Used for: the chaos expansion of the variance, inequality (4).