The Setting
In a planar exchange process, an edge contributes the label of its leaving endpoint, whereas a participating vertex is counted once regardless of its degree. The question is how these two concentrations compare in a time window after weak convergence.
A configuration of planar points is a map from to . A configuration of planar points is in general position when it is injective and the orientation determinant is nonzero for distinct indices.✦ A generic configuration of planar points is a configuration in general position that has pairwise distinct first coordinates and pairwise distinct slopes for unordered pairs , and satisfies one further condition: for three distinct unordered pairs, the intersection of the first two open segments contains no point of the third closed segment.✦
A uniform exchange batch system on , with batches, rank and exchange distance , consists of strictly increasing slopes and marked sets of size . The sweep projection of at slope is .✦ Separation at stage requires every marked point to have smaller projection at than every unmarked point, and exactly indices leave the marked set at each batch. The leaving sets , entering sets , exchange edges and participating vertices are defined by (1). (1) A generic batch configuration consists of a generic planar configuration and a uniform exchange batch system on with .✦ The two normalizations used below are and .
A dyadic time window is a pair with and . Its time window interval is the cell of , with its right endpoint included when . For a positive integer , the uniform partition of the unit interval has boundaries for ; its last cell is closed on the right and its other cells are open on the right. Batch has midpoint time .✦ For a finite list of times in an ordered set, the cut at is the number of times strictly below .✦ Thus the window starts at the cut at , stops at the cut at , and has batch count equal to the difference of these cuts. The time window system is the consecutive batch system obtained by retaining those stages from the starting index through the stopping index, with the original slopes and marked sets.✦
Tokens and Rank Labels
Choose enumerations and . For a shift in the cyclic group , the cyclic perfect matching is the bijection . A matching between the differences of two finite sets induces a transport between the sets by fixing their common points and using the matching elsewhere; the inverse fixes the common points and uses the inverse matching.✦ For each shift , the batch token transport is the bijection that fixes the common points and uses the cyclic perfect matching between the leaving and entering sets.✦ Cumulative token transport starts with the identity and composes these transports through the first batches.✦
An edge token trace of consists of a batch , a matching number and an initial token with and , where and .✦ Choose one trace for each exchange edge.✦ Its batch determines the edge time , and its matching number and initial token index determine the convex chain owner .
A convex graph family of size consists of continuous convex functions , , and a scale .✦ For a finite family of real graph functions , the vertical rank counts the graphs strictly below .✦ For such functions and a real scale , the smoothed rank coordinate is the real-valued function in (2), where is the sigmoid function; it is zero when . (2) For , the unit interval rank coordinate is , regarded as a point of .✦ The flat family is the convex graph family in which every graph equals zero and the scale is one.✦
A full convex chain graph extension of , relative to a finite planar set , consists of continuous convex graphs, one for each owner, and numbers with . Their secant slopes lie in , and every exchange segment lies on its owner’s graph. At a point of , a graph can meet that point only along an exchange segment owned by the graph. The window rank family is a chosen convex graph family of size for each .✦ Write its unit interval coordinate as . The rank label space and the configuration rank label are defined in (3), with denoting the set of dyadic windows. (3)
Measures and Limits
A weighted atomic measure with weight on a finite labelled family is .✦ For labels in a measurable space , the normalized participating vertex measure and the weighted edge endpoint measure , with nonnegative normalization , are given in (4). The weighted edge endpoint measure is zero when . (4)
For a generic batch configuration, put . The empirical point measure , window vertex measure , edge label and time measure , and its time restriction are defined by (5). (5)
A straight-line drawing has a finite vertex set and a finite set of ordered edges, each directed from smaller to larger first coordinate and with both endpoints in its vertex set.✦ Two edges cross when their open segments intersect; crossing edge pairs count each unordered pair once. The exchange drawing uses and .✦ For windows , the window crossing edge pairs are the crossing pairs with one exchange edge in each window. Choose a point in the two open segments of each such pair.✦ The crossing label measure is .✦ For a straight-line drawing and a finite set of ordered point-index pairs, the exterior edge crossing points form the finite set of points where edges of cross outside the closed segments represented by .✦
Limiting rank data consist of finite measures on , finite measures on , and finite crossing measures on .✦ Joint convergence of a sequence of configurations means weak convergence of every corresponding measure in (6), for every choice of windows. (6)✦ The label marginals are and , where is projection onto . Write for the participating vertex mass.
Spatial Enhancement
The spatial cube is .✦ The sigmoid compactification of the plane is the map from to .✦ Given any map , the spatially enhanced rank label is the map with .✦ The enhanced point measure and the enhanced window vertex and edge measures are defined by (7). (7) The enhanced measure family consists of the point measure and the vertex and edge measures indexed by windows.✦ Convergence of the enhanced measure family means weak convergence of its point measure and every window vertex and edge measure, with limits denoted by .
The enhanced label space is the Cartesian product of the window label space and the spatial cube.✦
The Claim
For a sequence of generic batch configurations, write . The numerical hypotheses with constant are (8). (8)
Theorem 1. Let a sequence of generic batch configurations satisfy (8) and converge jointly as in (6). For every dyadic window and Borel set , the local cubic bound is (9). (9)✦ For each such window, the absolute continuity assertion is (10). (10)✦
For any sequence of generic batch configurations satisfying (8), choose maps and assume convergence of the entire enhanced measure family. For every dyadic window and Borel set , the enhanced local bound is (11). (11)✦
Let be a uniform exchange batch system on a generic -point configuration, with . Let be a measurable space with measurable singletons, assign labels , and fix . For every measurable set , the finite atomic bound is (12). (12)✦
In the paper, the result reads: in the preceding limiting setup, every window and Borel set satisfy , where depends only on the fixed extremal comparison constants, in particular , and the estimate remains valid after labels in any compact metrizable space are attached to vertices and their edge endpoints and a further weak limit is taken.
What Is Checked
The claims are stated over generic planar batch systems with positive point count and exchange distance, joint weak limits satisfying (8), and convergent spatially enhanced measure families.