Related papers: Asymptotic Counting in Conformal Dynamical Systems
In this paper, we study the complexity of the approximation of nonadmissible curves for nonlinear control-affine systems satisfying the strong H{\"o}rmander condition. Focusing on tubular approximation complexities, we provide asymptotic…
We prove various estimates for the asymptotics of counting functions associated to point sets of coherent frames and Riesz sequences. The obtained results recover the necessary density conditions for coherent frames and Riesz sequences for…
We analyze the properties of degree-preserving Markov chains based on elementary edge switchings in undirected and directed graphs. We give exact yet simple formulas for the mobility of a graph (the number of possible moves) in terms of its…
In the paper we discuss two questions about smooth expanding dynamical systems on the circle. (i) We characterize the sequences of asymptotic length ratios which occur for systems with H\"older continuous derivative. The sequences of…
The decimal expansion real numbers, familiar to us all, has a dramatic generalization to representation of dynamical system orbits by symbolic sequences. The natural way to associate a symbolic sequence with an orbit is to track its history…
The asymptotic structure of AdS spacetimes in the context of General Relativity coupled to the Maxwell field in three spacetime dimensions is analyzed. Although the fall-off of the fields is relaxed with respect to that of Brown and…
In causal inference on directed acyclic graphs, the orientation of edges is in general only recovered up to Markov equivalence classes. We study Markov equivalence classes of uniformly random directed acyclic graphs. Using a tower…
We construct an asymptotic approximation to the solution of a transmission problem for a body containing a region occupied by many small inclusions. The cluster of inclusions is characterised by two small parameters that determine the…
An asymptotic theory is developed for computing volumes of regions in the parameter space of a directed Gaussian graphical model that are obtained by bounding partial correlations. We study these volumes using the method of real log…
We consider the count of subgraphs with an arbitrary configuration of endpoints in the random-connection model based on a Poisson point process on ${\Bbb R}^d$. We present combinatorial expressions for the computation of the cumulants and…
We consider infinite graph-directed iterated function systems (GIFSs) whose contraction mappings are nonconformal. As our main result, we formulate asymptotic perturbations from conformal GIFSs to nonconformal GIFSs, and give the asymptotic…
We introduce and discuss two nonlinear perturbed extensions of the Cucker-Smale model with asymmetric coupling weights. The first model assumes a finite collection of autonomous agents aiming to perform a consensus process in the presence…
We introduce and study a family of non-conformal and non-uniformly contracting iterated function systems. We refer to the attractors of such systems as parabolic carpets. Roughly speaking they may be thought of as nonlinear analogues of…
We investigate the asymptotic properties of permutations drawn from the Luce model, a natural probabilistic framework in which permutations are generated sequentially by sampling without replacement, with selection probabilities…
We study enumeration functions for unimodal sequences of positive integers, where the size of a sequence is the sum of its terms. We survey known results for a number of natural variants of unimodal sequences, including Auluck's generalized…
We demonstrate that in constructing asymptotically flat vacuum initial data sets in General Relativity via the conformal method, certain asymptotic structures may be prescribed a priori through the specified seed data, including the ADM…
Conformally symplectic systems include mechanical systems with a friction proportional to the velocity. Geometrically, these systems transform a symplectic form into a multiple of itself making the systems dissipative or expanding. In the…
We apply round-off to planar rotations, obtaining a one-parameter family of invertible maps of a two-dimensional lattice. As the angle of rotation approaches pi/2, the fourth iterate of the map produces piecewise-rectilinear motion, which…
Using methods of Marklof and Str\"ombergsson we establish several limit laws for metric parameters of random Cayley graphs of finite abelian groups with respect to a randomly chosen set of generators of a fixed size. Doing so we settle a…
Many enumeration problems in combinatorics, including such fundamental questions as the number of regular graphs, can be expressed as high-dimensional complex integrals. Motivated by the need for a systematic study of the asymptotic…