Related papers: Ergodicity in the linked twist map with oppositely…

The problem of whether and how one can compute the twin-width of a graph -- along with an accompanying contraction sequence -- lies at the forefront of the area of algorithmic model theory. While significant effort has been aimed at…

We establish an abstract local ergodic theorem, under suitable space-time scaling, for the (boundary-driven) symmetric exclusion process on an increasing sequence of balls covering an infinite weighted graph. The proofs are based on 1-block…

Models for generating simple graphs are important in the study of real-world complex networks. A well established example of such a model is the erased configuration model, where each node receives a number of half-edges that are connected…

The total effective resistance, also called the Kirchhoff index, provides a robustness measure for a graph $G$. We consider two optimization problems of adding $k$ new edges to $G$ such that the resulting graph has minimal total effective…

One of the major theoretical riddles in shear banding instabilities is the angle that the shear band chooses spontaneously with respect to the principal stress axis. Here we employ our recent atomistic theory to compute analytically the…

The experimental observations of many interaction-driven electronic phases in moir\'e superlattices have stimulated intense theoretical and experimental efforts to understand and engineer these correlated physics. Strain is a powerful tool…

Bayesian shrinkage methods have generated a lot of recent interest as tools for high-dimensional regression and model selection. These methods naturally facilitate tractable uncertainty quantification and incorporation of prior information.…

In most noninteracting quantum systems, the scaling theory of localization predicts one-parameter scaling flow in both ergodic and localized regimes. On the other hand, it is expected that the one-parameter scaling hypothesis breaks down…

A bisection in a graph is a cut in which the number of vertices in the two parts differ by at most 1. In this paper, we give lower bounds for the maximum weight of bisections of edge-weighted graphs with bounded maximum degree. Our results…

Since seminal work of Bowen, it has been known that the specification property implies various useful properties about a topological dynamical system, among them uniqueness of the measure of maximal entropy (often referred to as intrinsic…

Let $d \geq 2$. The Cheeger constant of a graph is the minimum surface-to-volume ratio of all subsets of the vertex set with relative volume at most 1/2. There are several ways to define surface and volume here: the simplest method is to…

We study different geometric properties on infinite graphs, related to the weak-type boundedness of the Hardy-Littlewood maximal averaging operator. In particular, we analyze the connections between the doubling condition, having finite…

The plastic deformation of amorphous solids is mediated by localized shear transformations involving small groups of particles rearranging irreversibly in an elastic background. We introduce and compare three different computational methods…

Polygonal slap maps are piecewise affine expanding maps of the interval obtained by projecting the sides of a polygon along their normals onto the perimeter of the polygon. These maps arise in the study of polygonal billiards with…

The minimal infinitesimal rigidity of bar-joint frameworks in the non-Euclidean spaces (R^2, ||.||_q) are characterised in terms of (2,2)-tight graphs. Specifically, a generically placed bar-joint framework (G,p) in the plane is minimally…

We establish a moderate deviation principle for the maximum likelihood estimator of the four parameters of a geometrically ergodic Heston process. We also obtain moderate deviations for the maximum likelihood estimator of the couple of…

We derive a sufficient condition for topological horseshoe and uniform hyperbolicity of a 4-dimensional symplectic map, which is introduced by coupling the two 2-dimensional H\'enon maps via linear terms. The coupled H\'enon map thus…

In this paper, by invoking the coupling approach, we establish exponential ergodicity under the $L^1 $-Wasserstein distance for two-factor affine processes. The method employed herein is universal in a certain sense so that it is applicable…

A random-walk Metropolis sampler is geometrically ergodic if its equilibrium density is super-exponentially light and satisfies a curvature condition [Stochastic Process. Appl. 85 (2000) 341-361]. Many applications, including Bayesian…

We study the classical problem of computing geometric thickness, i.e., finding a straight-line drawing of an input graph and a partition of its edges into as few parts as possible so that each part is crossing-free. Since the problem is…