Reconstructing cryptocurrency processes via Markov chains
The growing attention on cryptocurrencies has led to increasing research on digital stock markets. Approaches and tools usually applied to characterize standard stocks have been applied to the digital ones. Among these tools is the identification of processes of market fluctuations. Being interesting stochastic processes, the usual statistical methods are appropriate tools for their reconstruction. There, besides chance, the description of a behavioural component shall be present whenever a deterministic pattern is ever found. Markov approaches are at the leading edge of this endeavour. In this paper, Markov chains of orders one to eight are considered as a way to forecast the dynamics of three major cryptocurrencies. It is accomplished using an empirical basis of intra-day returns. Besides forecasting, we investigate the existence of eventual long-memory components in each of those stochastic processes. Results show that predictions obtained from using the empirical probabilities are better than random choices.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
On Mixtures of Markov Chains
We study the problem of reconstructing a mixture of Markov chains from the trajectories generated by random walks through the state space. Under mild non-degeneracy conditions, we show that we can uniquely reconstruct t…
Linear Laws of Markov Chains with an Application for Anomaly Detection in Bitcoin Prices
The goals of this paper are twofold: (1) to present a new method that is able to find linear laws governing the time evolution of Markov chains and (2) to apply this method for anomaly detection in Bitcoin prices. To acc…
Anomaly DetectionAdditive Multi-Step Markov Chains and the Curse of Dimensionality in Large Language Models
Large-scale language models (LLMs) operate in extremely high-dimensional state spaces, where both token embeddings and their hidden representations create complex dependencies that are not easily reduced to classical Mar…
Learning Mixtures of Markov Chains and MDPs
We present an algorithm for learning mixtures of Markov chains and Markov decision processes (MDPs) from short unlabeled trajectories. Specifically, our method handles mixtures of Markov chains with optional control inpu…
Evolving Markov Chains: Unsupervised Mode Discovery and Recognition from Data Streams
Markov chains are simple yet powerful mathematical structures to model temporally dependent processes. They generally assume stationary data, i.e., fixed transition probabilities between observations/states. However, liv…
Activity RecognitionEEGHuman Activity Recognition