Displaying 261 – 280 of 10046

Showing per page

A linear programming approach to error bounds for random walks in the quarter-plane

Jasper Goseling, Richard J. Boucherie, Jan-Kees van Ommeren (2016)

Kybernetika

We consider the steady-state behavior of random walks in the quarter-plane, in particular, the expected value of performance measures that are component-wise linear over the state space. Since the stationary distribution of a random walk is in general not readily available we establish upper and lower bounds on performance in terms of another random walk with perturbed transition probabilities, for which the stationary distribution is a geometric product-form. The Markov reward approach as developed...

A Littlewood-Paley-Stein estimate on graphs and groups

Nick Dungey (2008)

Studia Mathematica

We establish the boundedness in L q spaces, 1 < q ≤ 2, of a “vertical” Littlewood-Paley-Stein operator associated with a reversible random walk on a graph. This result extends to certain non-reversible random walks, including centered random walks on any finitely generated discrete group.

A local convergence theorem for partial sums of stochastic adapted sequences

Wei Guo Yang, Zhong Xing Ye, Liu, Wen (2006)

Czechoslovak Mathematical Journal

In this paper we establish a new local convergence theorem for partial sums of arbitrary stochastic adapted sequences. As corollaries, we generalize some recently obtained results and prove a limit theorem for the entropy density of an arbitrary information source, which is an extension of case of nonhomogeneous Markov chains.

A local limit theorem with speed of convergence for euclidean algorithms and diophantine costs

Viviane Baladi, Aïcha Hachemi (2008)

Annales de l'I.H.P. Probabilités et statistiques

For large N, we consider the ordinary continued fraction of x=p/q with 1≤p≤q≤N, or, equivalently, Euclid’s gcd algorithm for two integers 1≤p≤q≤N, putting the uniform distribution on the set of p and qs. We study the distribution of the total cost of execution of the algorithm for an additive cost function c on the set ℤ+* of possible digits, asymptotically for N→∞. If c is nonlattice and satisfies mild growth conditions, the local limit theorem was proved previously by the second named author....

A logarithmic Sobolev form of the Li-Yau parabolic inequality.

Dominique Bakry, Michel Ledoux (2006)

Revista Matemática Iberoamericana

We present a finite dimensional version of the logarithmic Sobolev inequality for heat kernel measures of non-negatively curved diffusion operators that contains and improves upon the Li-Yau parabolic inequality. This new inequality is of interest already in Euclidean space for the standard Gaussian measure. The result may also be seen as an extended version of the semigroup commutation properties under curvature conditions. It may be applied to reach optimal Euclidean logarithmic Sobolev inequalities...

A log-Sobolev type inequality for free entropy of two projections

Fumio Hiai, Yoshimichi Ueda (2009)

Annales de l'I.H.P. Probabilités et statistiques

We prove a kind of logarithmic Sobolev inequality claiming that the mutual free Fisher information dominates the microstate free entropy adapted to projections in the case of two projections.

Currently displaying 261 – 280 of 10046