Uniform sign-change conjecture for lattice random-walk averages
Uniform sign-change conjecture for lattice random-walk averages
Let be fixed. For a finitely supported function , let denote the associated lattice random-walk quantity at and time . Uniform sign-change conjecture. For every such and every , the function has at most sign changes as a function of , where depends on and but not on . The conjecture would control the alternating sums in the proof and reduce the need to bound the error terms; it is motivated by the expectation that oscillations in the random-walk kernel occur only modulo .
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Joshua N. Cooper and Joel Spencer, “Simulating a Random Walk with Constant Error”, arXiv:math/0402323 (2004).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.