Related papers: Historic Behaviour for Random Expanding Maps on th…
Analyzing the mixing time of random walks is a well-studied problem with applications in random sampling and more recently in graph partitioning. In this work, we present new analysis of random walks and evolving sets using more…
We examine shifted symplectic and Poisson structures on spaces of framed maps. We prove some results about shifted Poisson structures analogous to those in existing ones about symplectic structures. Then, we consider the space Map(X,D,Y) of…
A notion of random walks for circle packings is introduced. The geometry behind this notion is discussed, together with some applications. In particular, we obtain a short proof of a result regarding the type problem for circle packings,…
Pattern forming systems allow for a wealth of states, where wavelengths and orientation of patterns varies and defects disrupt patches of monocrystalline regions. Growth of patterns has long been recognized as a strong selection mechanism.…
We present a one-parameter family of continuous, piecewise affine, area preserving maps of the square, which are inspired by a dynamical system in game theory. Interested in the coexistence of stochastic and (quasi-)periodic behaviour, we…
We derive two sufficient conditions for a function of a Markov random field (MRF) on a given graph to be a MRF on the same graph. The first condition is information-theoretic and parallels a recent information-theoretic characterization of…
We study a series of dynamical concepts for self-maps in the primal topology induced by them. Among the concepts studied are non-wandering points, limit points, recurrent points, minimal sets, transitive points and self-maps, topologically…
We consider the trajectories of points on $\mathbb{S}^{d - 1}$ under sequences of certain folding maps associated with reflections. The main result characterizes collections of folding maps that produce dense trajectories. The minimal…
Two-dimensional mappings obtained by coupling two piecewise increasing expanding maps are considered. Their dynamics is described when the coupling parameter increases in the expanding domain. By introducing a coding and by analysing an…
Recently we pointed out the so-called Local Time Scheme as a novel approach to quantum foundations that solves the preferred pointer-basis problem. In this paper we introduce and analyze in depth a rather non-standard dynamical map that is…
Using the method of symbolic dynamics, we show that a large class of classical chaotic maps exhibit exponential hypersensitivity to perturbation, i.e., a rapid increase with time of the information needed to describe the perturbed time…
It is shown that if a Markov map $T$ on a noncommutative probability space $\mathcal{M}$ has a spectral gap on $L_2(\mathcal{M})$, then it also has one on $L_p(\mathcal{M})$ for $1<p<\infty$. For fixed $p$, the converse also holds if $T$ is…
Networks grow and evolve by local events, such as the addition of new nodes and links, or rewiring of links from one node to another. We show that depending on the frequency of these processes two topologically different networks can…
We present a new kind of structural Markov property for probabilistic laws on decomposable graphs, which allows the explicit control of interactions between cliques, so is capable of encoding some interesting structure. We prove the…
We consider the electromagnetic field in a cavity with a periodically oscillating perfectly reflecting boundary and show that the mathematical theory of circle maps leads to several physical predictions. Notably, well-known results in the…
In many branches of engineering, Banach contraction mapping theorem is employed to establish the convergence of certain deterministic algorithms. Randomized versions of these algorithms have been developed that have proved useful in…
This paper concerns the long term behaviour of a growth model describing a random sequential allocation of particles on a finite cycle graph. The model can be regarded as a reinforced urn model with graph-based interactions. It is motivated…
The infinite discrete stable Boltzmann maps are "heavy-tailed" generalisations of the well-known Uniform Infinite Planar Quadrangulation. Very efficient tools to study these objects are Markovian step-by-step explorations of the lattice…
Stack-triangulations appear as natural objects when one wants to define some increasing families of triangulations by successive additions of faces. We investigate the asymptotic behavior of rooted stack-triangulations with $2n$ faces under…
There is a long history of establishing central limit theorems for Markov chains. Quantitative bounds for chains with a spectral gap were proved by Mann and refined later. Recently, rates of convergence for the total variation distance were…