Attila Lovas
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Attila Lovas has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Miklós Rásonyi
Rényi Institute Budapest Hungary
5 shared publications - Attila Andai
Department for Mathematical Analysis Budapest University of Technology and Economics Stoczek u. 2 H-1521 Budapest Hungary
3 shared publications Attila Andai
Department of Mathematical Analysis Budapest University of Technology and Economics Egry József u. 1 1111 Budapest Hungary
2 shared publications- Brigitta Szilágyi
Budapest University of Technology and Economics, Budapest, Hungary, Budapest, Hungary
2 shared publications Péter Sótonyi
Semmelweis Univ, Dept Vasc Surg, Budapest, Hungary
2 shared publicationsRóbert Nagy
Budapest Univ Technol & Econ, Dept Struct Mech, Budapest, Hungary
2 shared publications
Latest Publications
- Open Access
Sharp Mixing Rates for Markov Chains on General Spaces with Unbounded Random Environments
We consider Markov chains on general state spaces in stationary random environment which are defined by a random mapping that is contractive up to a bounded perturbation. We prove their convergence to a limiting law, providing convergence rates. We also show that these processes are strongly mixing and estimate their mixing coefficients. Our results significantly extend those available in the literature. In particular, for some additive autoregressive processes with exogenous covariates we achieve mixing rates that are optimal up to logarithmic factors.
Open AccessSharp Mixing Rates for Markov Chains on General Spaces with Unbounded Random Environments
We consider Markov chains on general state spaces in stationary random environment which are defined by a random mapping that is contractive up to a bounded perturbation. We prove their convergence to a limiting law, providing convergence rates. We also show that these processes are strongly mixing and estimate their mixing coefficients. Our results significantly extend those available in the literature. In particular, for some additive autoregressive processes with exogenous covariates we achieve mixing rates that are optimal up to logarithmic factors.
- Open Access
- 5 November 2024
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 62 (1) , 284-297
On the strong stability of ergodic iterations
We revisit processes generated by iterated random functions driven by a stationary and ergodic sequence. Such a process is called strongly stable if a random initialization exists for which the process is stationary and ergodic, and for any other initialization the difference of the two processes converges to zero almost surely. Under some mild conditions on the corresponding recursive map, without any condition on the driving sequence we show the strong stability of iterations. Several applications are surveyed such as generalized autoregression and queuing. Furthermore, new results are deduced for Langevin-type iterations with dependent noise and for multitype branching processes.
- 5 November 2024
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 62 (1) , 284-297
Open AccessOn the strong stability of ergodic iterations
We revisit processes generated by iterated random functions driven by a stationary and ergodic sequence. Such a process is called strongly stable if a random initialization exists for which the process is stationary and ergodic, and for any other initialization the difference of the two processes converges to zero almost surely. Under some mild conditions on the corresponding recursive map, without any condition on the driving sequence we show the strong stability of iterations. Several applications are surveyed such as generalized autoregression and queuing. Furthermore, new results are deduced for Langevin-type iterations with dependent noise and for multitype branching processes.
- Open Access
- 28 August 2023
- Published by Springer Nature in Applied Mathematics & Optimization
- Vol. 88 (3) , 1-22
Functional Central Limit Theorem and Strong Law of Large Numbers for Stochastic Gradient Langevin Dynamics
We study the mixing properties of an important optimization algorithm of machine learning: the stochastic gradient Langevin dynamics (SGLD) with a fixed step size. The data stream is not assumed to be independent hence the SGLD is not a Markov chain, merely a Markov chain in a random environment, which complicates the mathematical treatment considerably. We derive a strong law of large numbers and a functional central limit theorem for SGLD.
- 28 August 2023
- Published by Springer Nature in Applied Mathematics & Optimization
- Vol. 88 (3) , 1-22
Open AccessFunctional Central Limit Theorem and Strong Law of Large Numbers for Stochastic Gradient Langevin Dynamics
We study the mixing properties of an important optimization algorithm of machine learning: the stochastic gradient Langevin dynamics (SGLD) with a fixed step size. The data stream is not assumed to be independent hence the SGLD is not a Markov chain, merely a Markov chain in a random environment, which complicates the mathematical treatment considerably. We derive a strong law of large numbers and a functional central limit theorem for SGLD.
- Open Access
- 22 February 2023
- Published by Springer Nature in Annals of Operations Research
- Vol. 336 (1-2) , 691-709
Ergodic aspects of trading with threshold strategies
To profit from price oscillations, investors frequently use threshold-type strategies where changes in the portfolio position are triggered by some indicators reaching prescribed levels. In this paper we investigate threshold-type strategies in the context of ergodic control. We make the first steps towards their optimization by proving ergodic properties of related functionals. Assuming Markovian price increments satisfying a minorization condition and (one-sided) boundedness we show, in particular, that for given thresholds, the distribution of the gains converges in the long run. We also extend recent results on the stability of overshoots of random walks from the i.i.d. increment case to Markovian increments, under suitable conditions.
- 22 February 2023
- Published by Springer Nature in Annals of Operations Research
- Vol. 336 (1-2) , 691-709
Open AccessErgodic aspects of trading with threshold strategies
To profit from price oscillations, investors frequently use threshold-type strategies where changes in the portfolio position are triggered by some indicators reaching prescribed levels. In this paper we investigate threshold-type strategies in the context of ergodic control. We make the first steps towards their optimization by proving ergodic properties of related functionals. Assuming Markovian price increments satisfying a minorization condition and (one-sided) boundedness we show, in particular, that for given thresholds, the distribution of the gains converges in the long run. We also extend recent results on the stability of overshoots of random walks from the i.i.d. increment case to Markovian increments, under suitable conditions.
- Open Access
Ergodic aspects of trading with threshold strategies
To profit from price oscillations, investors frequently use threshold-type strategies where changes in the portfolio position are triggered by some indicators reaching prescribed levels. In this paper, we investigate threshold-type strategies in the context of ergodic control. We make the first steps towards their optimization by proving the ergodic properties of related functionals. Assuming Markovian price increments satisfying a minorization condition and (one-sided) boundedness we show, in particular, that for given thresholds, the distribution of the gains converges in the long run. We also extend recent results on the stability of overshoots of random walks from the i.i.d.\ increment case to Markovian increments, under suitable conditions.
Open AccessErgodic aspects of trading with threshold strategies
To profit from price oscillations, investors frequently use threshold-type strategies where changes in the portfolio position are triggered by some indicators reaching prescribed levels. In this paper, we investigate threshold-type strategies in the context of ergodic control. We make the first steps towards their optimization by proving the ergodic properties of related functionals. Assuming Markovian price increments satisfying a minorization condition and (one-sided) boundedness we show, in particular, that for given thresholds, the distribution of the gains converges in the long run. We also extend recent results on the stability of overshoots of random walks from the i.i.d.\ increment case to Markovian increments, under suitable conditions.
- 12 April 2022
- Published by Springer Nature
- p. 278-283
Ergodic Behavior of Returns in a Buy Low and Sell High Type Trading Strategy
- 12 April 2022
- Published by Springer Nature
- p. 278-283
Ergodic Behavior of Returns in a Buy Low and Sell High Type Trading Strategy
- Open Access
- 1 September 2021
- Published by Elsevier in Operations Research Letters
- Vol. 49 (5) , 682-687
Ergodic theorems for queuing systems with dependent inter-arrival times
- 1 September 2021
- Published by Elsevier in Operations Research Letters
- Vol. 49 (5) , 682-687
Open AccessErgodic theorems for queuing systems with dependent inter-arrival times
- Open Access
Ergodic theorems for queuing systems with dependent inter-arrival times
We study a G/GI/1 single-server queuing model with i.i.d.\ service times that are independent of a stationary process of inter-arrival times. We show that the distribution of the waiting time converges to a stationary law as time tends to infinity provided that inter-arrival times satisfy a G\"artner-Ellis type condition. A convergence rate is given and a law of large numbers established. These results provide tools for the statistical analysis of such systems, transcending the standard case with independent inter-arrival times.
Open AccessErgodic theorems for queuing systems with dependent inter-arrival times
We study a G/GI/1 single-server queuing model with i.i.d.\ service times that are independent of a stationary process of inter-arrival times. We show that the distribution of the waiting time converges to a stationary law as time tends to infinity provided that inter-arrival times satisfy a G\"artner-Ellis type condition. A convergence rate is given and a law of large numbers established. These results provide tools for the statistical analysis of such systems, transcending the standard case with independent inter-arrival times.
- Open Access
Quantum Aitchison geometry
Multiplying a likelihood function with a positive number makes no difference in Bayesian statistical inference, therefore after normalization the likelihood function in many cases can be considered as probability distribution. This idea led Aitchison to define a vector space structure on the probability simplex in 1986. Pawlowsky-Glahn and Egozcue gave a statistically relevant scalar product on this space in 2001, endowing the probability simplex with a Hilbert space structure. In this paper we present the noncommutative counterpart of this geometry. We introduce a real Hilbert space structure on the quantum mechanical finite dimensional state space. We show that the scalar product in quantum setting respects the tensor product structure and can be expressed in terms of modular operators and Hamilton operators. Using the quantum analogue of the log-ratio transformation it turns out that all the newly introduced operations emerge naturally in the language of Gibbs states. We show an orthonormal basis in the state space and study the introduced geometry on the space of qubits in details.
Open AccessQuantum Aitchison geometry
Multiplying a likelihood function with a positive number makes no difference in Bayesian statistical inference, therefore after normalization the likelihood function in many cases can be considered as probability distribution. This idea led Aitchison to define a vector space structure on the probability simplex in 1986. Pawlowsky-Glahn and Egozcue gave a statistically relevant scalar product on this space in 2001, endowing the probability simplex with a Hilbert space structure. In this paper we present the noncommutative counterpart of this geometry. We introduce a real Hilbert space structure on the quantum mechanical finite dimensional state space. We show that the scalar product in quantum setting respects the tensor product structure and can be expressed in terms of modular operators and Hamilton operators. Using the quantum analogue of the log-ratio transformation it turns out that all the newly introduced operations emerge naturally in the language of Gibbs states. We show an orthonormal basis in the state space and study the introduced geometry on the space of qubits in details.
- Open Access
On the notion of quantum copulas
Working with multivariate probability distributions Sklar introduced the notion of copula in 1959, which turned out to be a key concept to understand the structure of distributions of composite systems. Roughly speaking Sklar proved that a joint distribution can be represented with its marginals and a copula. The main goal of this paper is to present a quantum analogue of the notion of copula. Our main theorem states that for any state of a composite quantum system there exists a unique copula such that they are connected to each other by invertible matrices, moreover, they are both separable or both entangled. So considering copulas instead of states is a separability preserving transformation and efficiently decreases the dimension of the state space of composite systems. The method how we prove these results draws attention to the fact that theorem for states can be achieved by considering the states as quantum channels and using theorems for channels and different kind of positive maps.
Open AccessOn the notion of quantum copulas
Working with multivariate probability distributions Sklar introduced the notion of copula in 1959, which turned out to be a key concept to understand the structure of distributions of composite systems. Roughly speaking Sklar proved that a joint distribution can be represented with its marginals and a copula. The main goal of this paper is to present a quantum analogue of the notion of copula. Our main theorem states that for any state of a composite quantum system there exists a unique copula such that they are connected to each other by invertible matrices, moreover, they are both separable or both entangled. So considering copulas instead of states is a separability preserving transformation and efficiently decreases the dimension of the state space of composite systems. The method how we prove these results draws attention to the fact that theorem for states can be achieved by considering the states as quantum channels and using theorems for channels and different kind of positive maps.