Displaying similar documents to “Large deviations for directed percolation on a thin rectangle”

Wiener integral for the coordinate process under the -finite measure unifying Brownian penalisations

Kouji Yano (2011)

ESAIM: Probability and Statistics

Similarity:

Wiener integral for the coordinate process is defined under the -finite measure unifying Brownian penalisations, which has been introduced by [Najnudel , (2007) 459–466] and [Najnudel , . Mathematical Society of Japan, Tokyo (2009)]. Its decomposition before and after last exit time from 0 is studied. This study prepares for the author's recent study [K. Yano, (2010) 3492–3516] of Cameron-Martin formula for the -finite measure. ...

Undecidability of infinite post correspondence problem for instances of size 8

Jing Dong, Qinghui Liu (2012)

RAIRO - Theoretical Informatics and Applications

Similarity:

The infinite Post Correspondence Problem (PCP) was shown to be undecidable by Ruohonen (1985) in general. Blondel and Canterini [ (2003) 231–245] showed that PCP is undecidable for domain alphabets of size 105, Halava and Harju [ (2006) 551–557] showed that PCP is undecidable for domain alphabets of size 9. By designing a special coding, we delete a letter from Halava and Harju’s construction. So we prove that PCP is undecidable for domain alphabets of size...

Exponential deficiency of convolutions of densities

Iosif Pinelis (2012)

ESAIM: Probability and Statistics

Similarity:

If a probability density () ( ∈ ℝ) is bounded and := ∫e ()d < ∞ for some linear functional and all  ∈ (01), then, for each  ∈ (01) and all large enough , the -fold convolution of the -tilted density p ˜ t := e ()/ is bounded. This is a corollary of a general, “non-i.i.d.” result, which is also shown to enjoy a certain optimality property. Such results and their corollaries stated in terms of the absolute integrability of the corresponding characteristic...

Thread algebra for noninterference

Thuy Duong Vu (2008)

RAIRO - Theoretical Informatics and Applications

Similarity:

Thread algebra is a semantics for recent object-oriented programming languages [J.A. Bergstra and M.E. Loots, (2002) 125–156; J.A. Bergstra and C.A. Middelburg, (2007)] such as C# and Java. This paper shows that thread algebra provides a process-algebraic framework for reasoning about and classifying various standard notions of noninterference, an important property in secure information flow. We will take the noninterference property given by Volpano  [D. Volpano,...