Related papers: On the asymptotic behavior of some Algorithms

Networks of degrade-and-fire oscillators are elementary models of populations of synthetic gene circuits with negative feedback, which show elaborate phenomenology while being amenable to mathematical analysis. In addition to thorough…

A new approach to the problem of finding the asymptotical behaviour of large orders of semiclassical expansion is suggested. Asymptotics of high orders not only for eigenvalues, but also for eigenfunctions, are constructed. Thus, one can…

Our aim in this paper is to investigate the asymptotic behavior of solutions of the perturbed linear fractional differential system. We show that if the original linear autonomous system is asymptotically stable then under the action of…

The focus of this paper is the analysis of real-time systems with recursion, through the development of good theoretical techniques which are implementable. Time is modeled using clock variables, and recursion using stacks. Our technique…

We obtain an asymptotic H\"older estimate for functions satisfying a dynamic programming principle arising from a so-called ellipsoid process. By the ellipsoid process we mean a generalization of the random walk where the next step in the…

This paper proposes parametric and non-parametric hypothesis testing algorithms for detecting anisotropy -- rotational variance of the covariance function in random fields. Both algorithms are based on resampling mechanisms, which enable…

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…

Oscillators are ubiquitous in nature, and usually associated with the existence of an asymptotic phase that governs the long-term dynamics of the oscillator. % We show that asymptotic phase can be estimated using a carefully chosen series…

We provide information about the asymptotic regimes for a homogeneous fragmentation of a finite set. We establish a phase transition for the asymptotic behaviours of the shattering times, defined as the first instants when all the blocks of…

This paper reports on a new algorithm to compute the asymptotic solutions of a linear differential system. A feature of the algorithm is the ability to accommodate periodic coefficients.

The main contribution of this paper is the development of a new decision tree algorithm. The proposed approach allows users to guide the algorithm through the data partitioning process. We believe this feature has many applications but in…

A new class of stochastic processes called independent and periodically identically distributed (i.p.i.d.) processes is defined to capture periodically varying statistical behavior. Algorithms are proposed to detect changes in such i.p.i.d.…

The output of a machine learning algorithm can usually be represented by one or more multivariate functions of its input variables. Knowing the global properties of such functions can help in understanding the system that produced the data…

We derive asymptotic formulae for the coefficients of bivariate generating functions with algebraic and logarithmic factors. Logarithms appear when encoding cycles of combinatorial objects, and also implicitly when objects can be broken…

The purpose of this note is to share some observations and speculations concerning the asymptotic behavior of Gromov-Witten invariants. They may be indicative of some deep phenomena in symplectic topology that in full generality are outside…

We consider growing random recursive trees in random environment, in which at each step a new vertex is attached (by an edge of a random length) to an existing tree vertex according to a probability distribution that assigns the tree…

We consider a finite collection of reinforced stochastic processes with a general network-based interaction among them. We provide sufficient and necessary conditions in order to have some form of almost sure asymptotic synchronization,…

Quantum walks on graphs can model physical processes and serve as efficient tools in quantum information theory. Once we admit random variations in the connectivity of the underlying graph, we arrive at the problem of percolation, where the…

We study a general class of nonlinear iterative algorithms which includes power iteration, belief propagation and approximate message passing, and many forms of gradient descent. When the input is a random matrix with i.i.d. entries, we use…

The asymptotic Samuel function generalizes to arbitrary rings the usual order function of a regular local ring. Here we explore some natural properties in the context of excellent, equidimensional rings containing a field. In addition, we…