Related papers: Ergodicity in the linked twist map with oppositely…
The aim of this article is to introduce a new methodology for constructing morphings between shapes that have identical topology. The morphings are obtained by deforming a reference shape, through the resolution of a sequence of linear…
A two dimensional amorphous material is modeled as an assembly of mesoscopic elemental pieces coupled together to form an elastically coherent structure. Plasticity is introduced as the existence of different minima in the energy landscape…
In this paper, based on the idea of self-adjusting steepness based schemes[5], a two-dimensional calculation method of steepness parameter is proposed, and thus a two-dimensional self-adjusting steepness based limiter is constructed. With…
The paper focuses on two problems: (i) how to orient the edges of an undirected graph in order to maximize the number of ordered vertex pairs (x,y) such that there is a directed path from x to y, and (ii) how to orient the edges so as to…
We introduce a new property of Markov chains, called variance bounding. We prove that, for reversible chains at least, variance bounding is weaker than, but closely related to, geometric ergodicity. Furthermore, variance bounding is…
In this note, given a family of relative dimension one over a smooth curve, we determine the parity of the restriction of a relative theta characteristic to an arbitrary multiple of a fiber in terms of the parity of the restriction to a…
Sparse structures are frequently sought when pursuing tractability in optimization problems. They are exploited from both theoretical and computational perspectives to handle complex problems that become manageable when sparsity is present.…
It is well known that stationary geometrically ergodic Markov chains are $\beta$-mixing (absolutely regular) with geometrically decaying mixing coefficients. Furthermore, for initial distributions other than the stationary one, geometric…
The well-known ergodic hierarchy of sheerly ergodic, mixing, Kolmogorov and Bernoulli systems, with each next level supposedly encompassing the previous one, is shown to be too simplistic in its usual formulation. A K-system can be sheerly…
The metric dimension (MD) of a graph is a combinatorial notion capturing the minimum number of landmark nodes needed to distinguish every pair of nodes in the graph based on graph distance. We study how much the MD can increase if we add a…
Motivated by the exact weight perfect matching problem and recent parameterized algorithms for finding an $\ell$-th smallest perfect matching, we study structural properties of edge-weight symmetries in graphs. Recent work by El Maalouly et…
This paper develops a theory of Lipschitz comparisons of hyperbolic surfaces analogous to the theory of quasi-conformal comparisons. Extremal Lipschitz maps (minimal stretch maps) and geodesics for the `Lipschitz metric' are constructed.…
When a block made of an elastomer is subjected to large shear, its surface remains flat. When a block of biological soft tissue is subjected to large shear, it is likely that its surface in the plane of shear will buckle (apparition of…
We propose an extension of ergodic theory which focuses on the identification of ergodicity in terms of the uniqueness of the invariant measure. We first explain the concept for the doubling maps, which can be analyzed using Fourier…
The skewness of a graph G is the minimum number of edges in G whose removal results in a planar graph. By appropriately introducing a weight to each edge of a graph, we determine, among other thing, the skewness of the generalized Petersen…
The use of higher-order stochastic processes such as nonlinear Markov chains or vertex-reinforced random walks is significantly growing in recent years as they are much better at modeling high dimensional data and nonlinear dynamics in…
Thurston introduced shear deformations (cataclysms) on geodesic laminations - deformations including left and right displacements along geodesics. For hyperbolic surfaces with cusps, we consider shear deformations on disjoint unions of…
Given an irreducible subshift of finite type X, a subshift Y, a factor map \pi : X \to Y, and an ergodic invariant measure \nu on Y, there can exist more than one ergodic measure on X which projects to \nu and has maximal entropy among all…
In many modern applications, difficulty in evaluating the posterior density makes performing even a single MCMC step slow. This difficulty can be caused by intractable likelihood functions, but also appears for routine problems with large…
Tree-cut width is a parameter that has been introduced as an attempt to obtain an analogue of treewidth for edge cuts. Unfortunately, in spite of its desirable structural properties, it turned out that tree-cut width falls short as an…