Related papers: On random topological Markov chains with big image…
Takens constructed a residual subset of the state space consisting of initial points with historic behaviour for expanding maps on the circle. We prove that this statistical property of expanding maps on the circle is preserved under small…
We establish central and local limit theorems for the number of vertices in the largest component of a random $d$-uniform hypergraph $\hnp$ with edge probability $p=c/\binnd$, where $(d-1)^{-1}+\eps<c<\infty$. The proof relies on a new,…
The random graph model has recently been extended to a random preferential attachment graph model, in order to enable the study of general asymptotic properties in network types that are better represented by the preferential attachment…
The purpose of this paper is to make a comprehensive connection between the basic results and properties derived from the two kinds of topologies (namely the $(\epsilon,\lambda)-$topology introduced by the author and the stronger locally…
We devise an abstract, modular scheme to prove continuity of the Lyapunov exponents for a general class of linear cocycles. The main assumption is the availability of appropriate large deviation type (LDT) estimates which are uniform in the…
Relative entropy is a fundamental class of distances between probability distributions, with widespread applications in probability theory, statistics, and machine learning. In this work, we study relative entropy from a categorical…
We prove a complex Ruelle-Perron-Frobenius theorem for Markov shifts over an infinite alphabet, whence extending results by M. Pollicott from the finite to the infinite alphabet setting. As an application we obtain an extension of renewal…
We establish the large deviation principle for a topological Markov shift over infinite alphabet which satisfies strong combinatorial assumptions called ``finite irreducibility'' or ``finite primitiveness''. More precisely, we assume the…
We use the $f-divergence$ also called relative entropy as a measure of diversity between probability densities and review its basic properties. In the sequence we define a few objects which capture relevant information from the sample of a…
Two high-level "pictures" of probability theory have emerged: one that takes as central the notion of random variable, and one that focuses on distributions and probability channels (Markov kernels). While the channel-based picture has been…
In this paper we use the strength of the constraint method in combination with a generalized Borsuk-Ulam type theorem and a cohomological intersection lemma to show how one can obtain many new topological transversal theorems of Tverberg…
The topology of the large-scale structure of the universe contains valuable information on the underlying cosmological parameters. While persistent homology can extract this topological information, the optimal method for parameter…
We give a fresh introduction to the Khovanov Homology theory for knots and links, with special emphasis on its extension to tangles, cobordisms and 2-knots. By staying within a world of topological pictures a little longer than in other…
A model of correlated random networks is examined, i.e. networks with correlations between the degrees of neighboring nodes. These nodes do not necessarily have to be direct neighbors, the maximum range of the correlations can be…
A short proof of a conjecture of Kropholler is given. This gives a relative version of Stallings' Theorem on the structure of groups with more than one end. A generalisation of the Almost Stability Theorem is also obtained, that gives…
We study a dynamical random network model in which at every construction step a new vertex is introduced and attached to every existing vertex independently with a probability proportional to a concave function f of its current degree. We…
We analyze the Lyapunov spectrum of the relative Ruelle operator associated with a skew product whose base is an ergodic automorphism and whose fibers are full shifts. We prove that these operators can be approximated in the $C^0$-topology…
The work of Vershik and Kerov [1977], Logan and Shepp [1977] established that the shape of the scaled random young diagram in Russian notation, as determined by the Plancherel measure, converges to a deterministic shape. In this article, we…
In a general setting we solve the following inverse problem: Given a positive operators $R$, acting on measurable functions on a fixed measure space $(X,\mathcal B_X)$, we construct an associated Markov chain. Specifically, starting with a…
The classical Metropolis-Hastings (MH) algorithm can be extended to generate non-reversible Markov chains. This is achieved by means of a modification of the acceptance probability, using the notion of vorticity matrix. The resulting Markov…