Brownian loop measure Created 2026-09-24 Updated 2026-11-05
Brownian loop measure is a sigma-finite measure on unrooted planar Brownian motion loops. A loop has a duration ; changing its starting time cyclically represents the same unrooted loop. Let be the probability law of a planar Brownian bridge from to of duration . For a nonnegative measurable function of an unrooted loop,
Here is planar Lebesgue measure. The weight combines the planar Brownian transition density with a further factor for unrooting. Restricting to loops contained in a domain gives its loop measure. A conformal map, with the conformal Brownian clock on each loop, transports this restricted measure to that of the image domain.[ref]
A Poisson point process with intensity is a Brownian loop soup. This construction connects Brownian motion to conformal restriction measure on simple loops through loop boundaries. The measure is infinite, so drawing one loop requires a finite restriction and normalization.
Brownian loop soup 2026-11-05
A Brownian loop soup of intensity in a planar domain is a Poisson point process of unrooted Brownian motion loops with intensity measure , where is Brownian loop measure restricted to loops contained in . Unrooted means that a cyclic change of starting time does not produce a different loop.
For every measurable family of loops with , the number of soup loops in has Poisson distribution with mean . Counts in disjoint families are independent. Thus the probability that no loop belongs to is . Finite restrictions give concrete simulation windows even though the whole intensity is infinite.
The conformal invariance of Brownian loop measure, with the appropriate change of time along each loop, gives conformal invariance of Brownian loop soup. Restricting a soup to loops contained in a smaller domain gives the soup there with the same intensity. This couples random loop geometry to conformal restriction measure on simple loops.[ref]
Campbell's theorem Created 2026-10-14 Updated 2026-11-05
Let be a Poisson point process with intensity measure , and let be a real-valued measurable function. For the ordinary Poisson sum , the condition gives
If also , then
Expand the square: equal-index terms contribute , while the Poisson factorial moment measure makes distinct-index terms contribute . Subtracting the squared expected value proves the variance formula. The Campbell first-moment formula also holds for general point processes; this variance identity uses the Poisson assumption.[ref]
Square integrability alone is insufficient for the ordinary sum on an infinite-intensity space. Take intensity on and . Then , but the sum is infinite almost surely: the ordered points satisfy by the strong law for Poisson arrival times, so comparison with the harmonic series proves divergence.
For this same , the compensated Poisson integral exists as a mean-zero limit under convergence in Lp with and has variance . Its definition is the L2 construction of compensated Poisson integrals, rather than subtraction of two infinite ordinary integrals. When the total intensity is finite, Cauchy-Schwarz inequality makes L2 imply L1, explaining why the shorter variance statement works in that special case.[ref]
Let be a conformal map that is a bijection between planar domains. Mapping every loop of a Brownian loop soup in by gives a Brownian loop soup of the same intensity in , after changing the clock along each loop. For a Brownian parametrization , the new clock is
The statement concerns unrooted loops: choosing a different starting time on the same loop does not create another object. It follows from conformal invariance of Brownian loop measure and the image property of a Poisson point process.[ref]
For the dilation , spatial lengths multiply by and loop durations by , while the soup intensity parameter stays fixed. Thus the random geometry has no preferred length scale. Keeping the clock change explicit prevents confusing conformal invariance of the loop ensemble with preservation of each loop's original duration.
The same intensity measure can belong to very different point processes. A Poisson point process with a locally finite intensity measure adds two requirements: each finite-intensity window count has the Poisson distribution of mean , and counts in pairwise disjoint observation windows are mutually independent. These requirements determine its probability law; they do not follow from the formula for .[ref]
A randomly shifted lattice point process, a unit-rate Poisson point process, and the shared random rate gives dependent point counts construction all satisfy on the real line. Nevertheless, their counts in have respectively variance zero, one, and two. Counts in the disjoint observation windows and have respectively covariance , zero, and . These exact calculations show why measuring mean density cannot identify a spacing or statistical dependence model.
Figure 1.
Equal intensity permits regular spacing, Poisson counts, and shared-rate dependence
. All three laws have intensity measure . Left: illustrative realizations of a randomly shifted lattice point process, a unit-rate Poisson point process, and the shared random rate gives dependent point counts construction conditional on rate two; the latter also has a completely empty outcome with probability . Right: exact probability mass functions of the count in , with the axis displayed through seven. Equal expected values of one coexist with variances zero, one, and two. Realizations illustrate spacing; the bars describe laws, not frequencies estimated from those realizations. Details.
Galaxy power spectrum shot noise Created 2026-10-14 Updated 2026-11-05
Sampling with a homogeneous Poisson point process of mean comoving number density adds a constant to the dimensional galaxy power spectrum. Subtracting its expectation leaves sampling uncertainty. Correlated tracer populations and survey weights modify this simple formula; survey depth alone does not specify .
Gregory F. Lawler 2026-11-05
Lawler and Wendelin Werner developed the Brownian loop soup, using a conformally invariant measure on planar Brownian loops to build a Poisson point process of loops.[ref] His Notes on the Bessel Process by Gregory F. Lawler provide another route from paths to geometry: a Bessel process describes radial diffusion, with its dimension parameter controlling whether the origin is reached. The boundary behavior matters when extending the process beyond its first zero.[ref]
Figure 1.
Gregory F. Lawler
. Portrait linked from the author's University of Chicago homepage. Source.
Independent marking theorem for Poisson point processes Created 2026-09-24 Updated 2026-11-05
Independently assigning a mark to each point of a Poisson point process, with mark probabilities allowed to depend measurably on the point, produces independent Poisson point processes for the different marks. If the original intensity is and mark has probability , its intensity is .
For an isotropic Poisson line process of intensity , its pair intersections form a locally finite point process. Coincident intersections and parallel pairs have probability zero. Its intensity measure is times area. Indeed the Poisson factorial moment measure and the change of variables from signed distances to intersection location give
The factor counts unordered line pairs. Shared lines create dependence between intersections; this process is not a Poisson point process.
Joint red and green Poisson count formula Created 2026-10-14 Updated 2026-11-05
For a finite-intensity set of mean , independent red marking with probability gives counts with
Disjoint source sets give independent pairs of these counts. Refining overlapping test sets into disjoint cells then proves independence of the two whole Poisson point processes, not only their counts on one set.
Mapping theorem (point process) Created 2026-10-14 Updated 2026-11-05
Let be a Poisson point process with intensity measure and let be measurable. If the pushforward
is locally finite, then the image counting measure is Poisson with intensity . If one requires a simple point process, the pushforward must also be diffuse, so distinct source points do not produce coincident image points with positive probability.
Attach conditionally independent nonnegative marks to a Poisson point process, with a measurable mark law depending only on location. If a mark at has mean and variance , and the displayed integrals are finite, their total is finite almost surely and has the displayed moments. The Campbell first-moment formula gives the first moment and finiteness. The Poisson factorial moment measure formula gives the square of that first moment for distinct pairs; the diagonal contributes . Their difference is the variance. Signed marks require absolute first-moment integrability.
Non-homogeneous Poisson point process Created 2026-09-24 Updated 2026-11-05
Let be a nonnegative measurable intensity function on a space with reference measure . A Non-homogeneous Poisson point process has independent counts on disjoint measurable sets and
whenever the integral is finite.
Overdispersion of nondegenerate mixed Poisson counts Created 2026-10-14 Updated 2026-11-05
Let be a finite random variable with finite second moment, and let have a Poisson distribution of mean . Then conditional expectation and the law of total variance give
A nondegenerate mixing law has positive variance, so the count is overdispersed relative to a Poisson distribution with the same expected value. For example, equal mixing between means and gives count expected value and variance . The finite-moment assumptions justify these ordinary variance identities; a proper mixing law can instead yield infinite count moments.
A spatial example uses Poisson point process parent locations of intensity , independent Poisson distribution offspring counts of expected value , and an offspring displacement probability distribution . Given the parents, the count in a bounded measurable region is Poisson with random mean . Its excess variance is
This follows from Campbell theorem. If has positive finite volume, the integral is finite and positive: and its integral is the volume of . Thus shared random parent locations produce extra count variation even though the offspring counts are conditionally Poisson.
Write and . Treat the nonnegative plant weights as independent marks conditional on the locations, with a measurable mark law depending only on . Its first and second moments are
This is the independent-marking interpretation appropriate for location-dependent weights.
The general results needed are the following. The Independent marking theorem for Poisson point processes says that such marks turn a Poisson point process of intensity into a Poisson point process on location-mark space with intensity . The Campbell first-moment formula says that for any nonnegative measurable , , allowing infinite values. The second Poisson factorial moment measure identity says that for nonnegative measurable ,
These statements apply to sigma-finite intensities and therefore do not require finitely many plants in the entire field. We use these general results without proving them.
Define the total as the nonnegative sum , or equivalently as the increasing limit of its finite-intensity truncations. the Campbell theorem gives
Since , the nonnegative random variable cannot be infinite on an event of positive probability. Thus is finite almost surely, even if the number of plants is infinite.
Separate the square into its diagonal and ordered distinct-pair terms. Nonnegativity allows the use of Tonelli's theorem and increasing limits, giving
The assumed second integral is finite, so is square-integrable. Subtracting yields
The term accounts for random weights at fixed locations; the term accounts for the Poisson fluctuations in the locations and count. Nonnegativity is natural for weights. For signed marks, absolute first-moment integrability, rather than just a conditionally convergent integral of the signed mean, would be needed for the ordinary sum.
The intensity function of a point process is positive and continuous inside the interval, so its measure is finite on every compact subinterval. Consequently the Poisson point process is locally finite there. Its nonatomic intensity makes it simple and gives no point at almost surely. At the endpoints,
Both half-intervals therefore have infinite intensity. More explicitly, exhaust either half by increasing compact intervals with means . For any fixed integer ,
Taking the countable union over proves infinitely many points on each side almost surely.
Local finiteness excludes accumulation in the interior, including at . Hence there is a largest negative point and a smallest positive point. For example, given any negative point, the compact interval between it and contains finitely many points and therefore a largest one. Call it ; call the smallest positive point , and enumerate consecutively in both directions. Infinite counts give every integer index, and the lack of interior accumulation implies as and as . Thus the specified two-sided labeling exists almost surely.
Use the cumulative-intensity transformation
It has , positive derivative, and limits at the two endpoints, so it is an increasing bijection onto . One explicit expression is
For any bounded interval in the target, its preimage has intensity
Disjoint target sets have disjoint preimages, so their counts are independent. This proves directly, or by the Poisson mapping theorem, that the transformed points form a unit-rate Poisson process on the real line.
Put . On the positive half-line, the successive spacings are independent exponential random variables of mean , so . The strong law of large numbers gives almost surely. On the negative half-line, independently, the reflected points satisfy , because is the first point to the left of zero. Thus , or also as . The shift by one has no effect on these limits.
From the explicit formula, or by integrating the endpoint intensity asymptotics,
Substitute and use the strong law for Poisson arrival times. At the right endpoint,
so
At the left endpoint the corresponding result is
Equivalently . The different powers of reflect the different endpoint singularity orders, an instance of power-law boundary accumulation of a Poisson point process.
Identify a line with its unique parameter pair in , using
A Poisson line process means a Poisson point process on the Borel parameter space : for each measurable of finite mean measure, the number of its parameter points is Poisson with mean , and counts in finitely many disjoint sets are independent. Infinite-measure sets are handled by a countable finite-measure exhaustion. Here is sigma-finite and nonatomic, so there are countably many distinct lines almost surely. It is not an assertion that line counts are Poisson with respect to planar area.
Fix and let . Exactly the lines with hit this disk, apart from the zero-probability tangent case. Thus the count of disk-hitting lines is
Every intersection in uses two of these lines. Writing , we have
This also proves local finiteness of the intersection point process. Initially it gives a non-strict bound .
To establish strictness, choose the two parameter boxes
Each has positive measure, and both lie among the disk-hitting lines. If one line from each box intersected at , then
But their distance parameters differ by more than , a contradiction. The event of exactly one line in each box and no other disk-hitting lines has probability
On this event but . Therefore
The following original diagram illustrates why two disk-hitting lines need not produce an intersection inside the disk.
Figure 1.
Two lines meeting a disk can have their intersection outside it
. Details.
To decide whether is Poisson, compute its intensity measure and compare its void probability. Use the equivalent signed line coordinates with and . If this is the original pair ; if it is . The measure is , with no extra factor of two. Translation by sends to , preserving this measure. Thus both the line and intersection processes are stationary.
Almost surely no two lines are parallel and no three are concurrent. In each finite-intensity parameter region, conditional line parameters have continuous joint densities. Parallel pairs and concurrent triples satisfy lower-dimensional equations and have probability zero; a countable exhaustion proves the assertion for all lines. Hence different unordered pairs have distinct intersections almost surely. For a bounded Borel set , the second Poisson factorial moment measure identity gives
For nonparallel normals, their intersection satisfies , . The absolute Jacobian determinant of this transformation is . Consequently
since the inner integral is for every . In particular .
If were a Poisson point process, the count would therefore be Poisson with that mean, giving . But the earlier necessary-two-lines argument gives
At this lower bound is , whereas the supposed Poisson void probability is . This contradiction proves is not a Poisson point process. Its points share parent lines, and the explicit void/mean comparison demonstrates the resulting dependence rather than merely asserting it.
For , let be the probability law of a seed displacement from its tree. For the literal circular support, it is normalized arclength on . The conditional mean measure of a point process is
We prove the conditional Poisson assertion directly by joint probability generating functions.
Fix disjoint bounded measurable sets . For a tree at , put and . Conditional on its seed count, the allocation among these sets and their complement is multinomial distribution. Averaging over the Poisson seed count gives
Thus this tree contributes independent Poisson counts of means to the disjoint sets. Different trees contribute independently. Only trees within distance of the bounded union of the can contribute, and there are almost surely finitely many of them. Multiplying their probability generating functions gives
This is precisely the joint probability generating function of independent Poisson counts with the displayed means. Also is locally finite, because each bounded set can receive seeds from only finitely many trees. This proves the conditional Poisson point process assertion and the Poisson offspring clusters directed by their parent process construction.
In arclength notation the directing measure is , where is arclength on the circle centered at . If “circle” is used to mean the filled disc instead, take ; then
The generating-function proof and the following unconditional conclusion hold for either reading. The circular version has a singular conditional directing measure, giving the random directing measure of a Cox process formulation.
Unconditionally this is a Cox process, specifically a Poisson-offspring Neyman-Scott process. Its mean measure of a point process is nevertheless spatially uniform. With , the Campbell first-moment formula and translation invariance give
since . Uniform mean alone does not establish a Poisson law.
For a bounded set of positive area, the conditional count has mean and variance . The law of total variance gives
A Poisson integral of a deterministic function has variance : for a simple function on disjoint sets this follows from independent Poisson counts, and square-integrable approximation gives the general formula. Here and it has bounded support, so
The strict inequality holds when , because implies . A Poisson random variable has equal mean and variance. Hence the unconditional process is not a Poisson process in the nontrivial model. If or , there are no seeds and the process is the degenerate empty Poisson process. The overdispersion of nondegenerate mixed Poisson counts quantifies the additional clustering induced by the random parents.
Equip with a sigma-algebra . A Poisson random measure with intensity measure of a point process is a random counting measure such that, for every measurable with ,
and the counts on every finite collection of pairwise disjoint measurable sets are independent. Thus . For a sigma-finite measure , sets of infinite intensity contain infinitely many points almost surely: exhaust such a set by increasing finite-intensity sets and use the Poisson count tails as their means tend to infinity. The count is a measurable random variable for every measurable , which is part of saying that is a random measure.
Under the usual point representation write , counting multiplicities. If is a non-atomic measure, this is a simple Poisson point process; if has atoms, several point occurrences can have the same location, and each occurrence is counted separately. In a topological setting, local finiteness requires that the intensity be finite on compact sets.
Sufficient existence conditions are that is a standard Borel space and is a sigma-finite measure. This gives existence of a Poisson random measure on a standard Borel space. If a simple locally finite configuration is desired, additionally take a non-atomic, locally finite intensity on a locally compact second-countable Hausdorff space. These conditions are sufficient, not claimed necessary. In particular sigma-finiteness suffices for a countable family of occurrences that can each be independently coloured.
Let and be the red and green counting measures. The marking assumption means that, conditional on , the colours of all point occurrences are independent, with the same red probability . For a measurable set of finite intensity , condition on its total count. To obtain red and green points the total must be , so direct multiplication gives the joint red and green Poisson count formula
Thus the two counts are independent Poisson variables with respective means and . This computation includes zero intensity with the usual convention for the probability of zero counts.
For disjoint finite-intensity sets , the original counts are independent. Conditional marking in different sets uses disjoint collections of independent colours. Repeating the preceding calculation therefore gives
This proves the disjoint-count definition for each coloured Poisson point process and independence of their two count vectors.
To obtain independence of the whole processes, take any finite list of red test sets and any finite list of green test sets, initially all of finite intensity. Refine their union into the disjoint cells given by their membership patterns. Every test-set count is the sum of the counts of its cells. The entire red cell vector is independent of the entire green cell vector by the product formula, hence so are the corresponding test-set count vectors. For arbitrary measurable test sets, intersect first with a finite-intensity exhaustion of and pass to the increasing count limits. The count cylinder events generate the two evaluation sigma-algebras, and independence extended from generating pi-systems gives independence of those sigma-algebras. Consequently
This is a direct count proof of the Poisson thinning theorem; no general marking or thinning result has been used to deduce it.
The mapping theorem for Poisson point processes applies provided is a measurable function and its pushforward measure
is locally finite, meaning
for every bounded Borel set . If “Poisson process” means a simple point process, one also requires to be atomless, equivalently
Under these conditions, is a Poisson point process with mean measure