Related papers: On the asymptotic behavior of some Algorithms
The problem of verifying whether a multi-component system has anomalies or not is addressed. Each component can be probed over time in a data-driven manner to obtain noisy observations that indicate whether the selected component is…
In the present paper we consider the varying coefficient model which represents a useful tool for exploring dynamic patterns in many applications. Existing methods typically provide asymptotic evaluation of precision of estimation…
We give practical, efficient algorithms that automatically determine the asymptotic distributed round complexity of a given locally checkable graph problem in the $[\Theta(\log n), \Theta(n)]$ region, in two settings. We present one…
While the algorithmic drawing of static trees is well-understood and well-supported by software tools, creating animations depicting how a tree changes over time is currently difficult: software support, if available at all, is not…
For natural and artificial systems with some symmetry structure, computational understanding and manipulation can be achieved without learning by exploiting the algebraic structure. Here we describe this algebraic coordinatization method…
In this paper, we present asymptotic analysis of self-adjusting contraction trees for incremental sliding window analytics.
Latent tree analysis seeks to model the correlations among a set of random variables using a tree of latent variables. It was proposed as an improvement to latent class analysis --- a method widely used in social sciences and medicine to…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
A new type of asymptotic behavior in a game dynamics system is discovered. The system exhibits behavior which combines chaotic motion and attraction to heteroclinic cycles; the trajectory visits several unstable stationary states repeatedly…
We return to the subject of stability of infinite time asymptotics of kinetic equations. We found a model which is simpler than those studied previously and which shows unstable behavior corresponding to our arguments to appear elsewhere,…
Asymptotic properties of a vector of length power functionals of random geometric graphs are investigated. More precisely, its asymptotic covariance matrix is studied as the intensity of the underlying homogeneous Poisson point process…
We show that extremely simple systems of a not too large number of particles can be simultane- ously thermally stable and complex. To such an end, we extend the statistical complexity's notion to simple configurations of non-interacting…
The study of neural computation aims to understand the function of a neural system as an information processing machine. Neural systems are undoubtedly complex, necessitating principled and automated tools to abstract away details to…
Considering the constrained stochastic optimization problem over a time-varying random network, where the agents are to collectively minimize a sum of objective functions subject to a common constraint set, we investigate asymptotic…
Some properties of integral averages of functions on intervals and their asymptotic behavior are investigated. The results are aimed at applications to entire and subharmonic functions.
Many manipulation tasks pose a challenge since they depend on non-visual environmental information that can only be determined after sustained physical interaction has already begun. This is particularly relevant for effort-sensitive,…
Definition of the phase of oscillations is straightforward for deterministic periodic processes but nontrivial for stochastic ones. Recently, Thomas and Lindner in [Phys. Rev. Lett., v. 113, 254101 (2014)] suggested to use the argument of…
We study the asymptotic behaviour of the solutions of a functional- differential equation with rescaling, the so-called pantograph equation. From this we derive asymptotic information about the zeros of these solutions.
Our aim in this report is to investigate the asymptotic behavior of Mittag-Leffler functions. We give some estimates involving the Mittag-Leffler functions and their derivatives.
The estimation of the covariance structure from a discretely observed multivariate Gaussian process under asynchronicity and noise is analysed under high-frequency asymptotics. Asymptotic lower and upper bounds are established for a general…