相关论文: The dimension of the St. Petersburg game

The topic of the present paper is a generalized St.\ Petersburg game in which the distribution of the payoff $X$ is given by $P(X=sr^{k-1})=pq^{k-1}$, $k=1,2,\ldots$, where $p+q=1$, and $s,\,r>0$. As for main results, we first extend…

Let $\{X_n= e^{2\pi i \theta_n}\}$ be a sequence of Steinhaus random variables, where $\theta_n$ are independent and uniformly distributed on $[0,1]$. We compute the almost sure Hausdorff dimension of the images and graphs of the random…

We consider the evolution of a connected set in Euclidean space carried by a periodic incompressible stochastic flow. While for almost every realization of the random flow at time t most of the particles are at a distance of order sqrt{t}…

The aim of this paper is to obtain an estimation of Hausdorff as well as fractal dimensions of random attractors for a class of stochastic partial differential equations with delay. The stochastic equation is first transformed into a…

The Hausdorff $\delta$-dimension game was introduced by Das, Fishman, Simmons and {Urba{\'n}ski} and shown to characterize sets in $\mathbb{R}^d$ having Hausdorff dimension $\leq \delta$. We introduce a variation of this game which also…

Schmidt's game is generally used to deduce qualitative information about the Hausdorff dimensions of fractal sets and their intersections. However, one can also ask about quantitative versions of the properties of winning sets. In this…

Let $((0,1], T)$ be the doubling map in the unit interval and $\varphi$ be the Saint-Petersburg potential, defined by $\varphi(x)=2^n$ if $x\in (2^{-n-1}, 2^{-n}]$ for all $n\geq 0$. We consider the asymptotic properties of the Birkhoff sum…

The set of badly approximable numbers, Bad, is known to be winning for Schmidt's game and hence has full Hausdorff dimension. It is also known that the set of inhomogeneously badly approximable numbers has full dimension. We prove that the…

Integer sequences where each element is determined by a previous randomly chosen element are investigated analytically. In particular, the random geometric series x_n=2x_p with 0<=p<=n-1 is studied. At large n, the moments grow…

We prove bounds for the almost sure value of the Hausdorff dimension of the limsup set of a sequence of balls in $\mathbf{R}^d$ whose centres are independent, identically distributed random variables. The formulas obtained involve the rate…

A stochastic algorithm is proposed, finding some elements from the set of intrinsic $p$-mean(s) associated to a probability measure $\nu$ on a compact Riemannian manifold and to $p\in[1,\infty)$. It is fed sequentially with independent…

Merging asymptotic expansions of arbitrary length are established for the distribution functions and for the probabilities of suitably centered and normalized cumulative winnings in a full sequence of generalized St. Petersburg games,…

We provide a criterion for determining the winner in two-player win-lose alternating-move games on trees, in terms of the Hausdorff dimension of the target set. We focus our study on special cases, including the Gale-Stewart game on the…

A constructive version of Hausdorff dimension is developed using constructive supergales, which are betting strategies that generalize the constructive supermartingales used in the theory of individual random sequences. This constructive…

We study a model of random weighted uniform spanning trees on the complete graph with $n$ vertices, where each edge is assigned a weight of $n^{1+\gamma}$ with probability $1/n$ and $1$ otherwise. Whenever $\gamma$ is large enough, we prove…

We determine the Hausdorff dimension for the range of a class of pure jump Markov processes in $\mathbb{R}^d$, which turns out to be random and depends on the trajectories of these processes. The key argument is carried out through the SDE…

We study recurrence and transience for a particle that moves at constant velocity in the interior of an unbounded planar domain, with random reflections at the boundary governed by a Markov kernel producing outgoing angles from incoming…

We investigate the limiting behavior of random tree growth in preferential attachment models. The tree stems from a root, and we add vertices to the system one-by-one at random, according to a rule which depends on the degree distribution…

We analyse an algorithm solving stochastic mean-payoff games, combining the ideas of relative value iteration and of Krasnoselskii-Mann damping. We derive parameterized complexity bounds for several classes of games satisfying…

Given $b > 1$ and $y \in \mathbb{R}/\mathbb{Z}$, we consider the set of $x\in \mathbb{R}$ such that $y$ is not a limit point of the sequence $\{b^n x \bmod 1: n\in\mathbb{N}\}$. Such sets are known to have full Hausdorff dimension, and in…