Related papers: Ergodicity in the linked twist map with oppositely…
We prove the Bernoulli property for a class of counter-twisting linked twist maps. These compose orthogonal linear shears on the torus, orientated in the opposite sense to their co-twisting counterparts (where the shears reinforce one…
We study a class of homeomorphisms of surfaces collectively known as linked-twist maps. We introduce an abstract definition which enables us to give a precise characterisation of a property observed by other authors, namely that such maps…
In this work we obtain a new criterion to establish ergodicity and non-uniform hyperbolicity of smooth measures of diffeomorphisms. This method allows us to give a more accurate description of certain ergodic components. The use of this…
We introduce the graph theoretical parameter of edge treewidth. This parameter occurs in a natural way as the tree-like analogue of cutwidth or, alternatively, as an edge-analogue of treewidth. We study the combinatorial properties of…
A rigidity theory is developed for frameworks in a metric space with two types of distance constraints. Mixed sparsity graph characterisations are obtained for the infinitesimal and continuous rigidity of completely regular bar-joint…
In this work we exhibit a new criteria for ergodicity of diffeomorphisms involving conditions on Lyapunov exponents and general position of some invariant manifolds. On one hand we derive uniqueness of SRB-measures for transitive surface…
Consider a drawing of a graph $G$ in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of $G$, is the classical graph parameter "thickness". By restricting the edges to be…
In this paper we obtain two criteria of stable ergodicity outside the partially hyperbolic scenario. In both criteria, we use a weak form of hyperbolicity called chain-hyperbolicity. It is obtained one criterion for diffeomorphisms with…
A Markov chain is geometrically ergodic if it converges to its in- variant distribution at a geometric rate in total variation norm. We study geo- metric ergodicity of deterministic and random scan versions of the two-variable Gibbs…
We extend Mirzakhani's conjugacy between the earthquake and horocycle flows to a bijection, demonstrating conjugacies between these flows on all strata and exhibiting an abundance of new ergodic measures for the earthquake flow. The…
The family of symmetric one sided subshifts in two symbols given by a sequence $a$ is studied. We analyse some of their topological properties such as transitivity, the specification property and intrinsic ergodicity. It is shown that…
Use of continuous shrinkage priors -- with a "spike" near zero and heavy-tails towards infinity -- is an increasingly popular approach to induce sparsity in parameter estimates. When the parameters are only weakly identified by the…
For affine processes on finite-dimensional cones, we give criteria for geometric ergodicity - that is exponentially fast convergence to a unique stationary distribution. Ergodic results include both the existence of exponential moments of…
We consider Gibbs samplers for a normal linear regression model with a global-local shrinkage prior and show that they produce geometrically ergodic Markov chains. First, under the horseshoe local prior and a three-parameter beta global…
Network geometry, characterized by nodes with associated latent variables, is a fundamental feature of real-world networks. Still, when only the network edges are given, it may be difficult to assess whether the network contains an…
We consider skew-products with concave interval fiber maps over a certain subshift obtained as the projection of orbits staying in a given region. It generates a new type of (essentially) coded shift. The fiber maps have expanding and…
The optimal exponentials of the thickness in the geometry rigidity inequality of shells represent the geometry rigidity of the shells. We obtain that the lower bounds of the optimal exponentials are $4/3,$ $3/2,$ and $1,$ for the hyperbolic…
The performance of distributed averaging depends heavily on the underlying topology. In various fields, including compressed sensing, multi-party computation, and abstract graph theory, graphs may be expected to be free of short cycles,…
In a geometric graph, $G$, the \emph{stretch factor} between two vertices, $u$ and $w$, is the ratio between the Euclidean length of the shortest path from $u$ to $w$ in $G$ and the Euclidean distance between $u$ and $w$. The \emph{average…
Flexible network design deals with building a network that guarantees some connectivity requirements between its vertices, even when some of its elements (like vertices or edges) fail. In particular, the set of edges (resp. vertices) of a…