The Setting
Rank labels record the position of a point relative to convex chains in successive sweep windows. Retaining a compactified position beside each label gives spatial measures to which separation and mass bounds apply. The analytic norm on the plane is , and its closed balls are squares.
An -point configuration is a map . An -point configuration is in general position when it is injective and the orientation determinant is nonzero for distinct indices.✦ A generic configuration is an -point configuration in general position with distinct first coordinates and distinct slopes for distinct unordered pairs , such that an intersection of the open segments of two distinct pairs lies on no closed segment of a third distinct pair.✦
A system of uniform exchange batches of rank and distance consists of strictly increasing sample slopes and -element marked sets of point indices. At each sample the sweep projection of every marked point is smaller than that of every unmarked point.✦ Exactly indices leave the marked set at each batch. The leaving and entering sets, exchange edges and participating vertices are those in (1). (1) A generic batch configuration is a generic configuration with such a system and positive .✦
A straight-line graph drawing has a finite vertex set and a finite set of ordered edges, each directed to the right, with both endpoints in its vertex set.✦ The exchange graph drawing uses and from (1).✦ Two edges cross when their open segments intersect; crossing edge pairs count each unordered pair once. A chosen crossing point of two crossing edges is a point in their common interior.✦ Relative to a finite set of edges, exterior crossing points are crossing points outside the closed segments of that set.✦
A dyadic time window has depth and .✦ The carrier of a dyadic time window is the uniform partition cell between and , closed on the left and open on the right except for the final cell, which is closed.✦ Batch has midpoint time .✦ The starting and stopping batch indices of a dyadic time window are the numbers of batch midpoint times strictly below the window’s left and right boundaries, respectively. The window batch count of a dyadic time window is the difference between its stopping and starting batch indices. The time window batch system of a dyadic window is the batch system consisting of the consecutive batches determined by its starting and stopping indices; more generally a consecutive batch window starting at with length , where , is the batch system retaining the original slopes and marked sets at indices .
Rank Labels and Measures
Enumerations of the leaving and entering sets by the cyclic indices modulo define cyclic perfect matchings: matching number sends index to . Matching-induced transport between consecutive marked sets is the bijection that fixes their shared points and matches the leaving points to the entering points. Cumulative token transport from the initial marked set to a later marked set is the bijection obtained by composing the matching-induced transports between consecutive marked sets. An edge token trace of an exchange edge is a choice of a batch, a matching number and an initial token occupying the edge’s source before that batch and its target afterwards, with the source leaving and the target entering.✦ A chosen trace assigns the edge its batch time and its convex chain owner, the pair consisting of matching number and initial token index.
Convex chain graph extensions are continuous convex functions on , with common lower and upper secant slopes strictly between the first and last sample slopes. Each exchange segment lies on its assigned graph. For a prescribed finite set of planar points, every point of lying on a graph must belong to an exchange segment assigned to that graph.
A convex graph family of size is a collection of continuous convex functions on and a scale .✦ The flat family is a convex graph family with all graphs zero and scale one.✦ The vertical graph rank and smoothed rank coordinate of the convex graph family are functions of a planar point , defined by (2), where sigmoid is the logistic function and the smoothed rank coordinate is zero when . (2) Each dyadic window of a generic batch configuration has a window rank graph family of graphs. The unit interval rank coordinate of a window rank graph family is the smoothed coordinate in (2).✦ The window label space is , where is the set of dyadic time windows.✦ For a generic batch configuration , the configuration rank label has at coordinate the unit interval rank coordinate of for that window’s graph family.✦
A weighted atomic measure on a measurable space is a measure for a finite index set , points of that space and .✦ For a generic batch configuration , the full point measure assigns weight to each ; the participating-vertex measure assigns the same weight to the labels of vertices in the time window system. The weighted edge endpoint measure with normalization assigns weight to each initial-endpoint label, and is zero for .✦ The edge label and time measure assigns weight to for each exchange edge , where is its initial endpoint index and is its batch time.✦
The time-restricted edge measure is the restriction of to .✦ Window crossing edge pairs have one exchange edge in each of two windows .✦ The window crossing point measure assigns weight to each chosen crossing point; its pushforward by is the crossing label measure .
Limiting rank data consist of finite measures on the corresponding label spaces.✦ Joint convergence of a sequence to these data means weak convergence of every family just defined.✦ The edge label marginal is , and its window version is .
The spatial compactification , where , and the map are defined in (3). (3) The enhanced label space is .✦ A spatially enhanced rank label of under a map is , using (3).✦ The enhanced point and vertex measures are measures assigning weight to the spatially enhanced rank labels of all points and participating vertices, respectively; the enhanced edge measure for a dyadic window is the measure assigning weight to the spatially enhanced rank labels of initial endpoints in that window. Write for this enhanced measure family, with countable index set . The original label measure family associated with the enhanced measure family is , and .✦
Spatial Charts
The reflected rank chart is . For an open partial homeomorphism of the plane write for its inverse map. The normalized spatial chart of an open partial homeomorphism at with nonzero scale is the map .✦ An affine homeomorphism more generally has the form , where and is an invertible linear map, with inverse .✦ For a sequence of charts with inverse maps and positive scales , write for the normalized inverse map.
The radial comparison for a planar map is the condition in (4) for every pair on the indicated squares. (4)✦ For a vector , the scalar product is , and its squared Euclidean norm is . Let be the closed unit square, and let and be subsets of the plane.
The Claim
Theorem 1 (Spatial selection and enhanced limits). Let be finite measures on a measurable space , let be measurable with , and let be measurable. Suppose is absolutely continuous with respect to planar Lebesgue measure . Let be open partial homeomorphisms with source and target . Assume that for -almost every , and there is such that, for every real and all sufficiently small positive , the comparison holds for all sufficiently large . There are a measurable set , an integer , a point , positive scales , a strictly increasing subsequence map , a map and with the properties in (5). (5)✦
For any jointly convergent generic batch sequence and any planar maps , there are a strictly increasing map and finite enhanced measures satisfying (6) for every . (6)✦
Let be a metric space with its Borel sets, let be finite measures on , and suppose along a strictly increasing . Let be continuous and planar maps such that for -almost every , for each . For a set and a map , suppose jointly as and , for each . Then the support satisfies (7). (7)✦
Consider a measure on , where is a metric space with its Borel sets, is Borel and is measurable. Suppose its support has the graph property (7), that for some integer , and that takes values in and has the separation bound of (5) with . Let be a subset of , and let be a measure on . The assertions in (8) hold for some . (8)✦
Let be a planar measure satisfying for every and , where and . For every with , every and , the strip estimate is (9). (9)✦ If , the same square mass hypothesis gives (10) for every such and . (10)✦
In the paper, the result reads: in the common Euclidean normalization, let be inverse rank homeomorphisms and let be Borel with for a selected window , with absolutely continuous and ; suppose that at every selected there is a finite independent of such that, for each integer and every sufficiently small fixed , eventually in the radial maximum and minimum satisfy and ; then there are a Borel set with , a subsequence, and translations and uniform rescalings of the normalized planes for which the limiting graph over every has a unique position in the closed Euclidean unit disk, with , and, after position is attached as a compactified label and a weak vertex limit is taken, its restriction to old labels in has position marginal satisfying for every and , every strip of width has mass at most , and every line has zero mass.
What Is Checked
The spatial selection is stated over finite measures on a measurable space and charts with full planar source and reflected target; the enhancement and support statements concern the batch measures and Borel measures on metric spaces. Every exchange edge admits an edge token trace.✦ The unit interval rank coordinate of a positive convex graph family lies strictly between zero and one.