Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 12978
2 votes
Accepted

Lower-semicomputable supermartingales with bounded increments

(Note: It is very possible I misunderstood the questions.) By $X$ dominates $Y$ up to an additive constant, do you mean $X,Y$ are supermartingales with bounded increments, and $X(S)>Y(S)-C$ for some …
Jason Rute's user avatar
  • 6,287
7 votes
1 answer
389 views

Reference request: Martingale decompositions (positive/negative and u.i./singular)

This is for martingales index by natural numbers. Also, I call a martingale which converges to 0 "singular". I have also seen them called "potentials". … Then there are two nonnegative martingales $(P_k)$ and $(N_k)$ such that such that $M_{k}=P_k-N_k$ a.e. for all $k$, and $\left\Vert M\right\Vert =\left\Vert P\right\Vert +\left\Vert N\right\Vert = \ …
Jason Rute's user avatar
  • 6,287
9 votes
2 answers
745 views

Is this ergodic inequality true?

My motivation for thinking it might be true is that something similar is true for martingales, namely $\displaystyle P\{ \max_{n \leq k \leq m} |M_k - M_n| > \epsilon\} \leq \frac{||M_m - M_n||_1}{ … , and I know there are many similarities between backward martingales and ergodic averages. …
Jason Rute's user avatar
  • 6,287
11 votes
0 answers
223 views

Savings property: A transformation which turns nonnegative martingales into uniformly integr...

We have been using martingales as long as probability theory (going back to work of von Mises). … However, since algorithmic randomness is often about sequences of $0$s and $1$s, the martingales are usually dyadic martingales. Also they are usually nonnegative. …
Jason Rute's user avatar
  • 6,287
11 votes
2 answers
2k views

De Finetti's theorem, the pointwise ergodic theorem, and reverse martingales

Equations (A) and (B) and de Finetti's theorem can all be proved using reverse martingales. … Similarly, for which types of pointwise ergodic theorems and ergodic decompositions is there a proof using reverse martingales? Pointers to any relevant references would be helpful. …
Jason Rute's user avatar
  • 6,287
5 votes

De Finetti's theorem, the pointwise ergodic theorem, and reverse martingales

To answer the second question, it seems that such ergodic averages can be represented as reverse martingales when the $H_n$ are finite subgroups of $G$. … Then on can use the geometry of $G$ to turn a theorem about reverse martingales (for example a maximal theorem) into a theorem about ergodic averages. …
Jason Rute's user avatar
  • 6,287
1 vote
0 answers
1k views

What conditions on a filtration guarantee that a (sub)martingale has a continuous modification?

Assume $M_t$ is a submartingale adapted to $\mathcal{F}_t$ such that $t \mapsto \mathbb{E}M_t$ is right-continuous (which is always true of martingales on right-continuous filtrations). … I think I have a proof for martingales (it involves algorithmic randomness, so it is not at all standard), but since I cannot find this written anywhere, I am worried I might be mistaken. …
Jason Rute's user avatar
  • 6,287