Related papers: Expanding Maps on Flowers, Interval Exchange Trans…
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…
Real-world optimization problems are generally not just black-box problems, but also involve mixed types of inputs in which discrete and continuous variables coexist. Such mixed-space optimization possesses the primary challenge of modeling…
We consider the problem of embedding the nodes of a hypergraph into Euclidean space under the assumption that the interactions arose through closeness to unknown hyperedge centres. In this way, we tackle the inverse problem associated with…
Recent results in control systems and numerical integration literature utilize invariant set theory to lift dynamical systems evolving on nonlinear manifolds to those evolving on vector spaces. We leverage this technique to propose an…
Given a graph, we associate each edge with the transposition which exchanges the endvertices. Fixing a linear order on the edge set, we obtain a permutation of the vertices. D\'enes proved that the permutation is a full cyclic permutation…
We classify the locally finite ergodic invariant measures of certain infinite interval exchange transformations (IETs). These transformations naturally arise from return maps of the straight-line flow on certain translation surfaces, and…
For a class of piecewise hyperbolic maps in two dimensions, we propose a combinatorial definition of topological entropy by counting the maximal, open, connected components of the phase space on which iterates of the map are smooth. We…
A natural generalization of interval exchange maps are linear involutions, first introduced by Danthony and Nogueira. Recurrent train tracks with a single switch provide a subclass of linear involutions. We call such linear involutions…
Flower pollination is an intriguing process in the natural world. Its evolutionary characteristics can be used to design new optimization algorithms. In this paper, we propose a new algorithm, namely, flower pollination algorithm, inspired…
In this paper, a new information theoretic framework for graph matching is introduced. Using this framework, the graph isomorphism and seeded graph matching problems are studied. The maximum degree algorithm for graph isomorphism is…
De Berg et al. in [SICOMP 2020] gave an algorithmic framework for subexponential algorithms on geometric graphs with tight (up to ETH) running times. This framework is based on dynamic programming on graphs of weighted treewidth resulting…
Ergodic optimization aims to single out dynamically invariant Borel probability measures which maximize the integral of a given "performance" function. For a continuous self-map of a compact metric space and a dense set of continuous…
We study dynamical properties of automorphisms of compact nilmanifolds and prove that every ergodic automorphism is exponentially mixing and exponentially mixing of higher orders. This allows to establish probabilistic limit theorems and…
We present an extension of the ergodic, mixing, and Bernoulli levels of the ergodic hierarchy for statistical models on curved manifolds, making use of elements of the information geometry. This extension focuses on the notion of…
A graph is called (generically) rigid in $\mathbb{R}^d$ if, for any choice of sufficiently generic edge lengths, it can be embedded in $\mathbb{R}^d$ in a finite number of distinct ways, modulo rigid transformations. Here we deal with the…
We establish a higher dimensional counterpart of Bourgain's pointwise ergodic theorem along an arbitrary integer-valued polynomial mapping. We achieve this by proving variational estimates $V_r$ on $L^p$ spaces for all $1<p<\infty$ and…
We propose a new model of ergodic optimization for expansive dynamical systems: the holonomic setting. In fact, we introduce an extension of the standard model used in this theory. The formulation we consider here is quite natural if one…
In this article, we continue the structural study of factor maps betweeen symbolic dynamical systems and the relative thermodynamic formalism. Here, one is studying a factor map from a shift of finite type $X$ (equipped with a potential…
We present a computational study of a visualization method for invariant sets based on ergodic partition theory, first proposed in [1,2]. The algorithms for computation of the time averages of observables on phase space are developed and…
This paper settles the computational complexity of model checking of several extensions of the monadic second order (MSO) logic on two classes of graphs: graphs of bounded treewidth and graphs of bounded neighborhood diversity. A classical…