The Setting
Take a graph and its distance , with values in and when and lie in different components. For a distance and a natural number , the indicator is when and otherwise, being larger than every natural number. Read at as a function of , it is the indicator of the ball of radius about .
A profile turns distances into weights between and . The question is how the cutoff profile of radius , for a positive integer , is assembled from the indicators of the balls of radii , and how much the assembly grows when each ball of radius is replaced by the ball of radius .
The Profile and Its Weights
For a positive integer , the cutoff profile of radius is the real function on with and, at a finite distance , (1)✦
For a positive integer and a natural number , the logarithmic increment is the real number (2)✦
The Claim
Theorem 1. Let be a positive integer. Then (3)✦ (4)✦ and for every , (5)✦ (6)✦ (7)✦ (8)✦
In the paper, the result reads: for every positive integer , the weights , , the page’s , are positive and sum to one, and for every one has and .
What Is Checked
The claim is stated over the logarithmic increments of (2) and the cutoff profile of (1), for a positive integer and every distance in .