Related papers: Method of Asymptotics beyond All Orders and Restri…
The Harper map is one of the simplest chaotic systems exhibiting reconnection of invariant manifolds. The method of asymptotics beyond all orders (ABAO) is used to construct stable/unstable manifolds of the Harper map. When the parameter…
The Harper map is one of the simplest chaotic systems exhibiting reconnection of invariant manifolds. The method of asymptotics beyond all orders (ABAO) is used to construct unstable/stable manifolds of the Harper map. By enlarging the…
We analytically compute asymptotic expansions of a 1-dimensional sub-manifold of stable and unstable manifolds in a 4-dimensional symplectic mapping by using the method called asymptotic expansions beyond all orders. This method enables us…
A general method is presented for deriving the limiting behavior of estimators that are defined as the values of parameters optimizing an empirical criterion function. The asymptotic behavior of such estimators is typically deduced from…
Integrated task and motion planning problems describe a multi-modal state space, which is often abstracted as a set of smooth manifolds that are connected via sets of transitions states. One approach to solving such problems is to sample…
We present a novel method to determine eccentricity constraints of extrasolar planets in systems with multiple transiting planets through photometry alone. Our method is highly model independent, making no assumptions about the stellar…
We introduce asymptotic-M\"obius (AM) maps, a large-scale analogue of quasi-M\"obius maps tailored to geometric group theory. AM-maps capture coarse cross-ratio behavior for configurations of points that lie far apart, providing a notion of…
We revisit the problem of introducing an a priori control for devices that can be modeled via a symplectic map in a neighborhood of an elliptic equilibrium. Using a technique based on Lie transform methods we produce a normal form algorithm…
The survey covers several topics related to the asymptotic structure of various combinatorial and analytic objects such as the path spaces in graded graphs (Bratteli diagrams), invariant measures with respect to countable groups, etc. The…
Within a Bayesian decision theoretic framework we investigate some asymptotic optimality properties of a large class of multiple testing rules. A parametric setup is considered, in which observations come from a normal scale mixture model…
A new method of algebraic nature is proposed for the study of the asymptotic properties of special polynomials. The technique we foresee is based on the use of umbral operators, allowing a unified treatment of a large body of polynomial…
Mappings of a finite set into itself with restriction on the cycle lengths are considered (the so-called A-mappings). Asymptotics is given for the number of these mappings with a power-law reduction of the remainder.
We consider escape from chaotic maps through a subset of phase space, the hole. Escape rates are known to be locally constant functions of the hole position and size. In spite of this, for the doubling map we can extend the current best…
We prove some asymptotic results for the radius and the profile of large random bipartite planar maps. Using a bijection due to Bouttier, Di Francesco and Guitter between rooted bipartite planar maps and certain two-type trees with positive…
In this paper, we introduce a graph matching method that can account for constraints of arbitrary order, with arbitrary potential functions. Unlike previous decomposition approaches that rely on the graph structures, we introduce a…
We study the asymptotic behaviour of 1-parameter subgroups with respect to Hofer's metric when the underlying symplectic manifold is an open surface of infinite area. We prove that, depending on the topology of the level sets of the…
Approximate Bayesian Computation (ABC) methods rely on asymptotic arguments, implying that parameter inference can be systematically biased even when sufficient statistics are available. We propose to construct the ABC accept/reject step…
Symplectic maps can provide a straightforward and accurate way to visualize and quantify the dynamics of conservative systems with two degrees of freedom. These maps can be easily iterated from the simplest computers to obtain trajectories…
The purpose of this paper is to study the limiting distribution of special {\it additive functionals} on random planar maps, namely the number of occurrences of a given {\it pattern}. The main result is a central limit theorem for these…
Motion planning is a fundamental problem in autonomous robotics that requires finding a path to a specified goal that avoids obstacles and takes into account a robot's limitations and constraints. It is often desirable for this path to also…