Displaying 81 – 100 of 721

Showing per page

The behavior of a Markov network with respect to an absorbing class: the target algorithm

Giacomo Aletti (2009)

RAIRO - Operations Research

In this paper, we face a generalization of the problem of finding the distribution of how long it takes to reach a “target” set T of states in Markov chain. The graph problems of finding the number of paths that go from a state to a target set and of finding the n-length path connections are shown to belong to this generalization. This paper explores how the state space of the Markov chain can be reduced by collapsing together those states that behave in the same way for the purposes of calculating...

The Beta(p,1) extensions of the random (uniform) Cantor sets

Dinis D. Pestana, Sandra M. Aleixo, J. Leonel Rocha (2009)

Discussiones Mathematicae Probability and Statistics

Starting from the random extension of the Cantor middle set in [0,1], by iteratively removing the central uniform spacing from the intervals remaining in the previous step, we define random Beta(p,1)-Cantor sets, and compute their Hausdorff dimension. Next we define a deterministic counterpart, by iteratively removing the expected value of the spacing defined by the appropriate Beta(p,1) order statistics. We investigate the reasons why the Hausdorff dimension of this deterministic fractal is greater...

The boundary Harnack principle for the fractional Laplacian

Krzysztof Bogdan (1997)

Studia Mathematica

We study nonnegative functions which are harmonic on a Lipschitz domain with respect to symmetric stable processes. We prove that if two such functions vanish continuously outside the domain near a part of its boundary, then their ratio is bounded near this part of the boundary.

Currently displaying 81 – 100 of 721