Related papers: One-dimensional central measures on numberings of …
We provide examples of transitive partially hyperbolic dynamics (specific but paradigmatic examples of homoclinic classes) which blend different types of hyperbolicity in the one-dimensional center direction. These homoclinic classes have…
For a Bratteli diagram $B$, we study the simplex $\mathcal{M}_1(B)$ of probability measures on the path space of $B$ which are invariant with respect to the tail equivalence relation. Equivalently, $\mathcal{M}_1(B)$ is formed by…
We establish connections between several properties of topological dynamical systems, such as: - every point is generic for an ergodic measure, - the map sending points to the measures they generate is continuous, - the system splits into…
We study covering numbers and local covering numbers with respect to difference graphs and complete bipartite graphs. In particular we show that in every cover of a Young diagram with $\binom{2k}{k}$ steps with generalized rectangles there…
In this paper free harmonic analysis tools are used to study parabolic iteration in the complex upper half-plane. The main result here is a complete characterization for the norming constants in the monotonic central limit theorem. This…
We provide a framework for studying randomly coloured point sets in a locally compact, second-countable space on which a metrisable unimodular group acts continuously and properly. We first construct and describe an appropriate dynamical…
Graph centrality measures use the structure of a network to quantify central or "important" nodes, with applications in web search, social media analysis, and graphical data mining generally. Traditional centrality measures such as the well…
We construct the entropic measure $\mathbb{P}^\beta$ on compact manifolds of any dimension. It is defined as the push forward of the Dirichlet process (another random probability measure, well-known to exist on spaces of any dimension)…
In this paper we propose numerical measures for evaluating the aesthetic interest of simple patterns. The patterns consist of elements (symbols, pixels, etc.) in regular square arrays. The measures depend on two characteristics of the…
We prove that in every cover of a Young diagram with $\binom{2k}{k}$ steps with generalized rectangles there is a row or a column in the diagram that is used by at least $k+1$ rectangles. We show that this is best-possible by partitioning…
The dynamics of one dimensional iterative maps in the regime of fully developed chaos is studied in detail. Motivated by the observation of dynamical structures around the unstable fixed point we introduce the geometrical concept of a…
The uncertainty or the variability of the data may be treated by considering, rather than a single value for each data, the interval of values in which it may fall. This paper studies the derivation of basic description statistics for…
We introduce novel measures, L1 prestige and L1 centrality, for quantifying the prominence of each vertex in a strongly connected and directed graph by utilizing the concept of L1 data depth (Vardi and Zhang, Proc. Natl. Acad. Sci. U.S.A.\…
The discriminant power of centrality indices for the degree, eigenvector, closeness, betweenness and subgraph centrality is analyzed. It is defined by the number of graphs for which the standard deviation of the centrality of its nodes is…
The paper investigates the problem of performing correlation analysis when the number of observations is very large. In such a case, it is often necessary to combine the random observations to achieve dimensionality reduction of the…
A causal set is a countably infinite poset in which every element is above finitely many others; causal sets are exactly the posets that have a linear extension with the order-type of the natural numbers -- we call such a linear extension a…
We introduce and study dynamical systems and measures on stationary generalized Bratteli diagrams $B$ that are represented as the union of countably many classical Pascal-Bratteli diagrams. We describe all ergodic tail invariant measures on…
For fixed $k$, we consider the subgraph $YF_k=(V_k,E_k)$ of the famous Young--Fibonacci graph formed by the words with at most $k$ 2-s. The jump graph is a graded graph is defined as follows: each level is identified with $V_k$, and an edge…
We present a new method of analysis of measure-preserving dynamical systems, based on frequency analysis and ergodic theory, which extends our earlier work [1]. Our method employs the novel concept of harmonic time average [2], and is…
We consider three uniqueness theorems: one from the theory of meromorphic functions, another one from asymptotic combinatorics, and the third one about representations of the infinite symmetric group. The first theorem establishes the…