Related papers: Ergodicity in the linked twist map with oppositely…
In a completely systematic and geometric way, we derive maximal and half-maximal supersymmetric gauged double field theories in lower than ten dimensions. To this end, we apply a simple twisting ansatz to the $D=10$ ungauged maximal and…
We discuss the problem of embedding graphs in the plane with restrictions on the vertex mapping. In particular, we introduce a technique for drawing planar graphs with a fixed vertex mapping that bounds the number of times edges bend. An…
In this paper we extend the recent theory of shear-localization in 2-dimensional amorphous solids to 3-D. In 2-D the fundamental instability of shear-localization is related to the appearance of a line of displacement quadrupoles, that…
This paper consists of four parts. In the first part, we explain what eigenvalues we are interested in and show the difficulties of the study on the first (non-trivial) eigenvalue through examples. In the second part, we present some (dual)…
Topology optimization (TO) has experienced a dramatic development over the last decades aided by the arising of metamaterials and additive manufacturing (AM) techniques, and it is intended to achieve the current and future challenges. In…
We give a generalized definition of stretch that simplifies the efficient construction of low-stretch embeddings suitable for graph algorithms. The generalization, based on discounting highly stretched edges by taking their $p$-th power for…
We show that all hyperbolic surfaces admit an ideal triangulation with bounded shear parameters. This upper bound depends logarithmically on the topology of the surface.
I study the average deformation rate of an amorphous material submitted to an external uniform shear strain rate, in the geometry known as the split-bottom configuration. The material is described using a stochastic model of plasticity at a…
Twisted $\operatorname{SL}_2 \mathbb{C}$ local systems on surfaces of finite type appear often in geometry and physics. Most of them arise geometrically as local systems of charts for pleated hyperbolic structures. Bonahon and Thurston's…
Edge expansion is a parameter indicating how well-connected a graph is. It is useful for designing robust networks, analysing random walks or information flow through a network and is an important notion in theoretical computer science.…
For both continuous-time and discrete-time Markov Chains, we provide criteria for inverse problems of classical types of ergodicity: (ordinary) erogodicity, algebraic ergodicity, exponential ergodicity and strong ergodicity. Our criteria…
In this work, we study the problem of computing a maximum common contraction of two vertex-labeled graphs, i.e. how to make them identical by contracting as little edges as possible in the two graphs. We study the problem from a…
Explicit calculations in dimension one show for Schur stable autoregressive processes with standard Gaussian noise that the ergodic convergence in the Wasserstein-$2$ distance is essentially given by the sum of the mean, which decays…
We prove ergodicity in a class of skew-product extensions of interval exchange transformations given by cocycles with logarithmic singularities. This, in particular, gives explicit examples of ergodic $\mathbb{R}$-extensions of minimal…
Given an undirected graph G, the edge orientation problem asks for assigning a direction to each edge to convert G into a directed graph. The aim is to minimize the maximum out degree of a vertex in the resulting directed graph. This…
The analysis of networks characterized by links with heterogeneous intensity or weight suffers from two long-standing problems of arbitrariness. On one hand, the definitions of topological properties introduced for binary graphs can be…
Bowen showed that a continuous expansive map with specification has a unique measure of maximal entropy. We show that the conclusion remains true under weaker non-uniform versions of these hypotheses. To this end, we introduce the notions…
In this paper we discuss how the notion of subgeometric ergodicity in Markov chain theory can be exploited to study stationarity and ergodicity of nonlinear time series models. Subgeometric ergodicity means that the transition probability…
We prove that a Lebesgue measure-preserving linked-twist map defined in the plane is metrically isomorphic to a Bernoulli shift (and thus strongly mixing). This is the first such result for an explicitly defined linked-twist map on a…
We consider the Erd\H{o}s-R\'enyi evolution of random graphs, where a new uniformly distributed edge is added to the graph in every step. For every fixed $d\ge 1$, we show that with high probability, the graph becomes rigid in $\mathbb R^d$…