Related papers: Random permutations and unique fully supported erg…

A metric probability space $M$ admits thresholds if the random geometric graph on $M$ has a threshold for every monotone graph property. We connect the existence of thresholds to the uniform expansion of $M$ and prove that all standard…

For positive $q\neq1$, the $q$-exchangeability of an infinite random word is introduced as quasi-invariance under permutations of letters, with a special cocycle which accounts for inversions in the word. This framework allows us to extend…

Deviation of ergodic sums is studied for substitution dynamical systems with a matrix that admits eigenvalues of modulus 1. We consider the corresponding eigenfunctions, and in Theorem 1.1 we prove that the limit inferior of the ergodic…

We consider the logarithm of the characteristic polynomial of random permutation matrices, evaluated on a finite set of different points. The permutations are chosen with respect to the Ewens distribution on the symmetric group. We show…

We determine the probability thresholds for the existence of monotone paths, of finite and infinite length, in random oriented graphs with vertex set $\mathbb N^{[k]}$, the set of all increasing $k$-tuples in $\mathbb N$. These graphs…

Let $G$ be a real Lie group, $\Lambda\subseteq G$ a lattice, and $X=G/\Lambda$. We fix a probability measure $\mu$ on $G$ and consider the left random walk induced on $X$. It is assumed that $\mu$ is aperiodic, has a finite first moment,…

Generalized Bratteli diagrams with a countable set of vertices in every level are models for aperiodic Borel automorphisms. This paper is devoted to the description of all ergodic probability tail invariant measures on the path spaces of…

We apply a common measure of randomness, the entropy, in the context of iterated functions on a finite set with n elements. For a permutation, it turns out that this entropy is asymptotically (for a growing number of iterations) close to…

We consider the ensemble of adjacency matrices of Erd{\H o}s-R\'enyi random graphs, i.e.\ graphs on $N$ vertices where every edge is chosen independently and with probability $p \equiv p(N)$. We rescale the matrix so that its bulk…

Let $T$ be an ergodic measure-preserving transformation on a non-atomic probability space $(X,\Sigma,\mu)$. We prove uniform extensions of the Wiener-Wintner theorem in two settings: For averages involving weights coming from Hardy field…

We study random graphs with latent geometric structure, where the probability of each edge depends on the underlying random positions corresponding to the two endpoints. We focus on the setting where this conditional probability is a…

Ergodic systems, being indecomposable are important part of the study of dynamical systems but if a system is not ergodic, it is natural to ask the following question: Is it possible to split it into ergodic systems in such a way that the…

Ergodic Optimization is the process of finding invariant probability measures that maximize the integral of a given function. It has been conjectured that "most" functions are optimized by measures supported on a periodic orbit, and it has…

In the article, we address the problem of absolute continuity of translated Rosenblatt measures on the path space. In [\v{C}oupek, P., K\v{r}\'i\v{z}, P., Maslowski, B., Stoch. Proc. Appl. 179 (2025) art. no. 104499], it is shown that there…

Recall that an excedance of a permutation $\pi$ is any position $i$ such that $\pi_i > i$. Inspired by the work of Hopkins, McConville and Propp (Elec. J. Comb., 2017) on sorting using toppling, we say that a permutation is toppleable if it…

We establish a comprehensive probability theory for coherent transport of random waves through arbitrary linear media. The transmissivity distribution for random coherent waves is a fundamental B-spline with knots at the transmission…

The aim of this paper is to show how extracting dynamical behavior and ergodic properties from deterministic chaos with the assistance of exact invariant measures. On the one hand, we provide an approach to deal with the inverse problem of…

Given a random walk a method is presented to produce a matrix of transition probabilities that is consistent with that random walk. The method is a kind of reverse application of the usual ergodicity and is tested by using a transition…

A unified view is given to recent developments about a systematic method of constructing rational mappings as ergodic transformations with non-uniform invariant measures on the unit interval I=[0,1]. All of the rational ergodic mappings of…

We consider certain respondent-driven sampling procedures on dense graphs. We show that if the sequence of the vertex-sets is ergodic then the limiting graph can be expressed in terms of the original dense graph via a transformation related…