Related papers: Discrete-time trawl processes with long memory
We derive general results on the small deviation behavior for some classes of iterated processes. This allows us, in particular, to calculate the rate of the small deviations for $n$-iterated Brownian motions and, more generally, for the…
The Levy Walk is the process with continuous sample paths which arises from consecutive linear motions of i.i.d. lengths with i.i.d. directions. Assuming speed 1 and motions in the domain of beta-stable attraction, we prove functional limit…
A continuous time random walk (CTRW) is a random walk in which both spatial changes represented by jumps and waiting times between the jumps are random. The CTRW is coupled if a jump and its preceding or following waiting time are dependent…
There have been many recent studies on sequential pattern mining. The sequential pattern mining on progressive databases is relatively very new, in which we progressively discover the sequential patterns in period of interest. Period of…
In the last years, many authors studied a class of continuous time semi-Markov processes obtained by time-changing Markov processes by hitting times of independent subordinators. Such processes are governed by integro-differential…
We extend slow manifolds near a transcritical singularity in a fast-slow system given by the explicit Euler discretization of the corresponding continuous-time normal form. The analysis uses the blow-up method and direct trajectory-based…
Using probabilistic approach, the transient dynamics of sparsely connected Hopfield neural networks is studied for arbitrary degree distributions. A recursive scheme is developed to determine the time evolution of overlap parameters. As…
Classification of long sequential data is an important Machine Learning task and appears in many application scenarios. Recurrent Neural Networks, Transformers, and Convolutional Neural Networks are three major techniques for learning from…
In this paper we give explicit examples of power-law correlated stationary Markovian processes y(t) where the stationary pdf shows tails which are gaussian or exponential. These processes are obtained by simply performing a coordinate…
We extend the use of random evolving sets to time-varying conductance models and utilize it to provide tight heat kernel upper bounds. It yields the transience of any uniformly lazy random walk, on Z^d, d>=3, equipped with uniformly bounded…
We present extensive experiments training and testing hidden units in deep networks that emit only a predefined, static, number of discretized values. These units provide benefits in real-world deployment in systems in which memory and/or…
How can neural networks be trained on large-volume temporal data efficiently? To compute the gradients required to update parameters, backpropagation blocks computations until the forward and backward passes are completed. For temporal…
Continual learning, the ability of a model to adapt to an ongoing sequence of tasks without forgetting earlier ones, is a central goal of artificial intelligence. To better understand its underlying mechanisms, we study the limitations of…
We consider the parametric estimation of the driving L\'evy process of a multivariate continuous-time autoregressive moving average (MCARMA) process, which is observed on the discrete time grid $(0,h,2h,...)$. Beginning with a new state…
Motivated by recent studies of record statistics in relation to strongly correlated time series, we consider explicitly the drawdown time of a Levy process, which is defined as the time since it last achieved its running maximum when…
We review recent advances on the record statistics of strongly correlated time series, whose entries denote the positions of a random walk or a L\'evy flight on a line. After a brief survey of the theory of records for independent and…
This paper considers a continuous time analogue of the classical autoregressive moving average processes, L\'evy-driven CARMA processes. First we describe limiting properties of the periodogram by means of the so-called truncated Fourier…
It is known that backward iterations of independent copies of a contractive random Lipschitz function converge almost surely under mild assumptions. By a sieving (or thinning) procedure based on adding to the functions time and space…
In natural foraging, many organisms seem to perform two different types of motile search: directed search (taxis) and random search. The former is observed when the environment provides cues to guide motion towards a target. The latter…
We examine diffusion-limited aggregation for a one-dimensional random walk with long jumps. We achieve upper and lower bounds on the growth rate of the aggregate as a function of the number of moments a single step of the walk has. In this…