The Setting
Let be a finite simple graph and let . Random rescaling replaces a vertex weight by , where is a random multiplier. The question concerns the expected edge mass under bounds on the multipliers and prescribed coordinate means.
For a real vertex weight , the vertex mass of a set is the sum in (1). (1)✦ The cross edge mass of vertex sets is the sum over ordered adjacent pairs in (2); the sets may overlap. (2)✦ The unordered edge mass is the sum of endpoint weight products over unordered edges, as in (3). (3)✦
Finite Random Multipliers
A finite real lottery on a set is a finite sequence of outcomes with real weights .✦ The expectation of a real function on and the total weight of the lottery are defined by (4). (4) A lottery is nonnegative if every listed weight is nonnegative✦; it is a probability lottery if it is nonnegative and .✦
A lottery of multiplier functions is bounded by and supported on if every listed multiplier satisfies (5). (5)✦ For a multiplier lottery , the expected edge mass of the rescaled weights is defined by (6), where . (6)✦ For a nonnegative integer and a real parameter , the multiplier bound is the number in (7). (7)✦
The Claim
Theorem 1. Let be a nonnegative integer, let be a finite simple graph with strictly positive vertex weights , and let induce a -free graph. For , there is a probability lottery of multiplier functions, bounded by and supported on , satisfying (8). (8)✦
In the paper, the result reads: for an integer , a finite -free graph with positive vertex weights and , and , there are jointly distributed multipliers with finite joint support such that , for every , and .
What Is Checked
The claim is stated over finite simple graphs with positive real vertex weights, vertex subsets whose induced graphs are -free, and finite probability lotteries of real multiplier functions.