Related papers: Unavoidable collections of balls for processes wit…

Let $Z$ be a subordinate Brownian motion in ${\mathbb R}^d$, $d\ge 2$, via a subordinator with Laplace exponent $\phi$. We kill the process $Z$ upon exiting a bounded open set $D\subset {\mathbb R}^d$ to obtain the killed process $Z^D$, and…

When given a class of functions and a finite collection of sets, one might be interested whether the class in question contains any function whose domain is a subset of the union of the sets of the given collection and whose restrictions to…

We show that any finite-entropy, countable-valued finitary factor of an i.i.d process can also be expressed as a finitary factor of a finite-valued i.i.d process whose entropy is arbitrarily close to the target process. As an application,…

We call a point process $Z$ on $\mathbb R$ \emph{exp-1-stable} if for every $\alpha,\beta\in\mathbb R$ with $e^\alpha+e^\beta=1$, $Z$ is equal in law to $T_\alpha Z+T_\beta Z'$, where $Z'$ is an independent copy of $Z$ and $T_x$ is the…

Upper bounds for the probabilities $\mathbb{P}(F\geq \mathbb{E} F + r)$ and $\mathbb{P}(F\leq \mathbb{E} F - r)$ are proved, where $F$ is a certain component count associated with a random geometric graph built over a Poisson point process…

A continuous-time particle system on the real line satisfying the branching property and an exponential integrability condition is called a branching L\'evy process, and its law is characterized by a triplet $(\sigma^2,a,\Lambda)$. We…

Let $a_n$ be the random increasing sequence of natural numbers which takes each value independently with decreasing probability of order $n^{-\alpha}$, $0 < \alpha < 1/2$. We prove that, almost surely, for every measure-preserving system…

We prove that for an arbitrary indexing group, every ergodic infinitely divisible stationary process that is separable in probability is weakly mixing. This shows that, as in the well-known case of Gaussian stationary processes, ergodicity…

This paper considers the speed of convergence (mixing) of a finite Markov kernel $P$ with respect to the Kullback-Leibler divergence (entropy). Given a Markov kernel one defines either a discrete-time Markov chain (with the $n$-step…

We observe that the technique of Markov contraction can be used to establish measure concentration for a broad class of non-contracting chains. In particular, geometric ergodicity provides a simple and versatile framework. This leads to a…

For a strictly stationary sequence of $\mathbb{R}_{+}^{d}$--valued random vectors we derive functional convergence of partial maxima stochastic processes under joint regular variation and weak dependence conditions. The limit process is an…

A function on a discrete group is weakly combable if its discrete derivative with respect to a combing can be calculated by a finite state automaton. A weakly combable function is bicombable if it is Lipschitz in both the left and right…

We introduce a particle model, that we call the $\textit{golf model}$. Initially, on a graph $G$, balls and holes are placed at random on some distinct vertices. The balls then move one by one, doing a random walk on $G$, starting from…

Let $d(G)$ be the smallest cardinality of a generating set of a finite group $G.$ We give a complete classification of the finite groups with the property that, whenever $ \langle x_1, \dots, x_{d(G)} \rangle = \langle y_1, \dots, y_{d(G)}…

Let $G$ be a finite group acting transitively on a set $\Omega$. We study what it means for this action to be {\it quasirandom}, thereby generalizing Gowers' study of quasirandomness in groups. We connect this notion of quasirandomness to…

The description of irreducible representations of a group G can be seen as a question in harmonic analysis; namely, decomposing a suitable space of functions on G into irreducibles for the action of G x G by left and right multiplication.…

We study qualitative properties of the set of recurrent points of finitely generated free semigroups of measurable maps. In the case of a single generator the classical Poincare recurrence theorem shows that these properties are closely…

The cluster complex on one hand, parking functions on the other hand, are two combinatorial (po)sets that can be associated to a finite real reflection group. Cluster parking functions are obtained by taking an appropriate fiber product…

The aim of this note is to show, by providing an elementary way to construct counter-examples, that the strong Feller and the joint (space-time) continuity for a semigroup of Markov kernels on a Polish space are not enough to ensure the…

Work of Clifford, Munn and Ponizovski{\u\i} parameterized the irreducible representations of a finite semigroup in terms of the irreducible representations of its maximal subgroups. Explicit constructions of the irreducible representations…