• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 251
Next 10 →

Martingale proofs of many-server heavy-traffic limits for Markovian queues

by Guodong Pang, Rishi Talreja, Ward Whitt - PROBABILITY SURVEYS , 2007
"... ..."
Abstract - Cited by 70 (38 self) - Add to MetaCart
Abstract not found

A Martingale Proof of Dobrushin’s Theorem for Non-Homogeneous Markov Chains

by S. Sethuraman, S. R. S. Varadhan , 2008
"... In 1956, Dobrushin proved a definitive central limit theorem for non-homogeneous Markov chains. In this note, a shorter and different proof elucidating more the assumptions is given through martingale approximation. Partially supported by NSF/DMS-0071504 and NSF/DMS-0104343. ..."
Abstract - Cited by 9 (0 self) - Add to MetaCart
In 1956, Dobrushin proved a definitive central limit theorem for non-homogeneous Markov chains. In this note, a shorter and different proof elucidating more the assumptions is given through martingale approximation. Partially supported by NSF/DMS-0071504 and NSF/DMS-0104343.

Contents Proofs of the martingale FCLT

by Ward Whitt
"... ..."
Abstract - Cited by 10 (0 self) - Add to MetaCart
Abstract not found

Spine proofs for Lp-convergence of branching-diffusion martingales

by Robert Hardy, Simon C. Harris , 2006
"... Using the foundations laid down in Hardy and Harris [8], we present new spine proofs of the Lp-convergence of some key additive martingales for three distinct models of branching diffusions, including branching Brownian motion. The spine techniques we develop give clear and simple arguments in the s ..."
Abstract - Cited by 7 (7 self) - Add to MetaCart
Using the foundations laid down in Hardy and Harris [8], we present new spine proofs of the Lp-convergence of some key additive martingales for three distinct models of branching diffusions, including branching Brownian motion. The spine techniques we develop give clear and simple arguments

The critical random graph, with martingales

by Asaf Nachmias, Yuval Peres , 2006
"... We give a short proof that the largest component of the random graph G(n, 1/n) is of size approximately n 2/3. The proof gives explicit bounds for the probability that the ratio is very large or very small. ..."
Abstract - Cited by 19 (5 self) - Add to MetaCart
We give a short proof that the largest component of the random graph G(n, 1/n) is of size approximately n 2/3. The proof gives explicit bounds for the probability that the ratio is very large or very small.

Martingale Representation And A Simple Proof Of Logarithmic Sobolev Inequalities On Path Spaces

by Mireille Capitaine, Elton P. Hsu, Michel Ledoux , 1997
"... We show how the Clark-Ocone-Haussmann formula for Brownian motion on a compact Riemannian manifold put forward by S. Fang in his proof of the spectral gap inequality for the Ornstein-Uhlenbeck operator on the path space can yield in a very simple way the logarithmic Sobolev inequality on the same sp ..."
Abstract - Cited by 43 (1 self) - Add to MetaCart
We show how the Clark-Ocone-Haussmann formula for Brownian motion on a compact Riemannian manifold put forward by S. Fang in his proof of the spectral gap inequality for the Ornstein-Uhlenbeck operator on the path space can yield in a very simple way the logarithmic Sobolev inequality on the same

A simple path to Biggins' martingale convergence for branching random walks

by Russell Lyons , 1995
"... We give a simple non-analytic proof of Biggins’ theorem on martingale convergence for branching random walks. ..."
Abstract - Cited by 93 (1 self) - Add to MetaCart
We give a simple non-analytic proof of Biggins’ theorem on martingale convergence for branching random walks.

Exponential inequalities, with constants, for U-statistics of order two

by C. Houdré, P. Reynaud-Bouret - IN STOCHASTIC INEQUALITIES AND APPLICATIONS, VOLUME 56 OF PROGR. PROBAB , 2003
"... A martingale proof of a sharp exponential inequality (with constants) is given for U-statistics of order two as well as for double integrals of Poisson processes. ..."
Abstract - Cited by 21 (1 self) - Add to MetaCart
A martingale proof of a sharp exponential inequality (with constants) is given for U-statistics of order two as well as for double integrals of Poisson processes.

Martingales and character ratios

by Jason Fulman - Trans. Amer. Math. Soc , 2006
"... Abstract. Some general connections between martingales and character ratios of finite groups are developed. As an application we sharpen the convergence rate in a central limit theorem for the character ratio of a random representation of the symmetric group on transpositions. A generalization of th ..."
Abstract - Cited by 5 (3 self) - Add to MetaCart
Abstract. Some general connections between martingales and character ratios of finite groups are developed. As an application we sharpen the convergence rate in a central limit theorem for the character ratio of a random representation of the symmetric group on transpositions. A generalization

Probabilistic Martingales and BPTIME Classes

by Kenneth W. Regan, D. Sivakumar - In Proc. 13th Annual IEEE Conference on Computational Complexity , 1998
"... We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness properties. Probabilistic martingales can simulate the "betting games" of [BMR + 98], and can cover the same class t ..."
Abstract - Cited by 5 (1 self) - Add to MetaCart
We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness properties. Probabilistic martingales can simulate the "betting games" of [BMR + 98], and can cover the same class
Next 10 →
Results 1 - 10 of 251
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University