Related papers: Dynamical properties of simplicial systems and con…
The dimension of random simplicial complexes (defined as the maximal dimension among all faces) is a natural extreme value associated with the complex, and is closely related to other functionals defined by a maximum, such as the clique…
Random walks on regular bounded degree expander graphs have numerous applications. A key property of these walks is that they converge rapidly to the uniform distribution on the vertices. The recent study of expansion of high dimensional…
We consider a non-uniquely ergodic dynamical system given by a $\mathbb{Z}^{l}$-action (or $(\N\cup\{0\})^l$-action) $\tau$ on a non-empty compact metrisable space $\Omega$, for some $l\in\N$. Let (D) denote the following property: The…
Let $G$ be a countable group and $\mu$ a probability measure on $G$. We build a new framework to compute asymptotic quantities associated with the $\mu$-random walk on $G$, using methods from harmonic analysis on groups and Banach space…
Given a dynamical system with a uniformly hyperbolic (`chaotic') attractor, the physically relevant Sinai-Ruelle-Bowen (SRB) measure can be obtained as the limit of the dynamical evolution of the leaf volume along local unstable manifolds.…
We study the notion of approximate entropy within the framework of network theory. Approximate entropy is an uncertainty measure originally proposed in the context of dynamical systems and time series. We firstly define a purely structural…
It is known that hyperbolic dynamical systems admit a unique invariant probability measure with maximal entropy. We prove an effective version of this statement and use it to estimate an upper bound for Hausdorff dimension of exceptional…
Kaprekar's routine, i.e., sorting the digits of an integer in ascending and descending order and subtracting the two, defines a finite deterministic map on the state space of fixed-length digit strings. While its attractors (such as 495 for…
This paper presents an {\it ab initio} derivation of the expression given by irreversible thermodynamics for the rate of entropy production for different classes of diffusive processes. The first class are Lorentz gases, where…
This paper investigates the (semi)group action of $\mathrm{SL}_3(\mathbb{R})$ on $\mathbb{P}(\mathbb{R}^3)$, a primary example of non-conformal, non-linear, and non-strictly contracting action. We study the Hausdorff dimension of a…
We propose that chaotic Glass networks (a class of piecewise-linear Ordinary Differential Equations) are good candidates for the design of true random number generators. A Glass network design has the advantage of involving only standard…
In estimating the complexity of objects, in particular of graphs, it is common practice to rely on graph- and information-theoretic measures. Here, using integer sequences with properties such as Borel normality, we explain how these…
We investigate the dynamic formation of regular random graphs. In our model, we pick a pair of nodes at random and connect them with a link if both of their degrees are smaller than d. Starting with a set of isolated nodes, we repeat this…
In the study of small and large networks it is customary to perform a simple random walk, where the random walker jumps from one node to one of its neighbours with uniform probability. The properties of this random walk are intimately…
Computer simulations are used to test whether a recently introduced generalization of Rosenfeld's excess-entropy scaling method for estimating transport coefficients in systems obeying molecular dynamics can be extended to predict long-time…
A finite ergodic Markov chain exhibits cutoff if its distance to equilibrium remains close to its initial value over a certain number of iterations and then abruptly drops to near 0 on a much shorter time scale. Originally discovered in the…
We develop a stochastic model for Lagrangian velocity as it is observed in experimental and numerical fully developed turbulent flows. We define it as the unique statistically stationary solution of a causal dynamics, given by a stochastic…
Arguments inspired by algorithmic information theory predict an inverse relation between the probability and complexity of output patterns in a wide range of input-output maps. This phenomenon is known as \emph{simplicity bias}. By viewing…
We analyze generalized space-time fractional motions on undirected networks and lattices. The continuous-time random walk (CTRW) approach of Montroll and Weiss is employed to subordinate a space fractional walk to a generalization of the…
We prove precise almost sure lower path regularity results for a wide class of stochastic processes in all space dimensions $d\geq 1$. Examples include Gaussian processes, in particular, fractional Brownian motions with Hurst index $H\in…