Elka Korutcheva
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
Research Subjects
Elka Korutcheva has a total of 63 co-authors. Here are the top co-authors by number of shared publications:
Kostadin Koroutchev
Escuela Politécnica Superior, Universidad Autónoma de Madrid, E-28049 Cantoblanco, Spain
8 shared publications- Yonko T. Millev
Max Planck Institute of Mathematics in the Sciences, Inselstr. 22-26, D-04103 Leipzig, Germany
6 shared publications - David Dominguez
Grupo de Neurocomputación Biológica, Dpto. de Ingeniería Informática, Escuela Politécnica Superior, Universidad Autónoma de Madrid, 28049 Madrid, Spain
4 shared publications - Javier Rodríguez-Laguna
Universidad Nacional de Educación a Distancia (UNED)
4 shared publications D. I. Uzunov
G. Nadjakov Institute of Solid State Physics, Bulgarian Academy of Sciences, Sofia
3 shared publications- Hassan Chamati
Institute of Solid State Physics, Bulgarian Academy of Sciences, 72 Tzarigradsko Chaussee, 1784 Sofia, Bulgaria
3 shared publications
Latest Publications
- Open Access
- 1 January 2023
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 2436 (1)
The Restricted Boltzmann Machine Ansatz through Adiabiatic Routes
We discuss the expressive power of the quantum restricted Boltzmann machine Ansatz in order to represent faithfully the operation process of a quantum spin-glass system undergoing an adiabatic quantum computation process. We address both the representability and the trainability problems associated to the restricted Boltzmann machine Ansatz when we try to describe the ground state of a quantum Ising spin-glass in a transverse field. In our approach, we obtain the ground state of the system using exact diagonalization and find the optimal restricted Boltzman machine. Our preliminary results show that due to the complex spin-glass landscape, for some topologies of the restricted Bolztmann machine, the parameters of the representation are hard to be found.
- 1 January 2023
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 2436 (1)
Open AccessThe Restricted Boltzmann Machine Ansatz through Adiabiatic Routes
We discuss the expressive power of the quantum restricted Boltzmann machine Ansatz in order to represent faithfully the operation process of a quantum spin-glass system undergoing an adiabatic quantum computation process. We address both the representability and the trainability problems associated to the restricted Boltzmann machine Ansatz when we try to describe the ground state of a quantum Ising spin-glass in a transverse field. In our approach, we obtain the ground state of the system using exact diagonalization and find the optimal restricted Boltzman machine. Our preliminary results show that due to the complex spin-glass landscape, for some topologies of the restricted Bolztmann machine, the parameters of the representation are hard to be found.
- Open Access
Political Signed Temporal Networks: A Deep Learning Approach
The evolution analysis of networks whose links are either positive or negative, representing opposite relationships such as friendship and enmity, has been revealed to be particularly useful in sociological contexts. Using a large relational dataset containing the last two centuries of state-wise geopolitical information (the correlates of war–alliance conflicts), a machine learning approach is presented to predict network dynamics. The combination of geometric as well as information–theoretic measures to characterize the resulting discrete time series together with the power of deep learning machines is used to generate a model whose predictions are even accurate on the few days in two centuries of international relations when the typical value (i.e., Alliance or Neutral) changed to a war or a conflict. In other words, the model can predict the next state of the network with a probability of error close to zero.
Open AccessPolitical Signed Temporal Networks: A Deep Learning Approach
The evolution analysis of networks whose links are either positive or negative, representing opposite relationships such as friendship and enmity, has been revealed to be particularly useful in sociological contexts. Using a large relational dataset containing the last two centuries of state-wise geopolitical information (the correlates of war–alliance conflicts), a machine learning approach is presented to predict network dynamics. The combination of geometric as well as information–theoretic measures to characterize the resulting discrete time series together with the power of deep learning machines is used to generate a model whose predictions are even accurate on the few days in two centuries of international relations when the typical value (i.e., Alliance or Neutral) changed to a war or a conflict. In other words, the model can predict the next state of the network with a probability of error close to zero.
- Open Access
A Schelling Extended Model in Networks—Characterization of Ghettos in Washington D.C.
Segregation affects millions of urban dwellers. The main expression of this reality is the creation of ghettos which are city parts characterized by a combination of features: low income, poor cultural level… Segregation models have been usually defined over regular lattices. However, in recent years, the focus has shifted from these unrealistic frameworks to other environments defined via geographic information systems (GIS) or networks. Nevertheless, each one of them has its drawbacks: GIS demands high-resolution data, that are not always available, and networks tend to have limited real-world applications. Our work tries to fill the gap between them. First, we use some basic GIS information to define the network, and then, run an extended Schelling model on it. As a result, we obtain the location of ghettos. After that, we analyze which parts of the city are segregated, via spatial analysis and machine learning and compare our results. For the case study of Washington D.C., we obtain an accuracy.Open AccessA Schelling Extended Model in Networks—Characterization of Ghettos in Washington D.C.
Segregation affects millions of urban dwellers. The main expression of this reality is the creation of ghettos which are city parts characterized by a combination of features: low income, poor cultural level… Segregation models have been usually defined over regular lattices. However, in recent years, the focus has shifted from these unrealistic frameworks to other environments defined via geographic information systems (GIS) or networks. Nevertheless, each one of them has its drawbacks: GIS demands high-resolution data, that are not always available, and networks tend to have limited real-world applications. Our work tries to fill the gap between them. First, we use some basic GIS information to define the network, and then, run an extended Schelling model on it. As a result, we obtain the location of ghettos. After that, we analyze which parts of the city are segregated, via spatial analysis and machine learning and compare our results. For the case study of Washington D.C., we obtain an accuracy. - 26 July 2019
- Published by American Physical Society (APS) in Physical Review E
- Vol. 100 (1) , 012143
Power accretion in social systems
We consider a model of power distribution in a social system where a set of agents plays a simple game on a graph: The probability of winning each round is proportional to the agent's current power, and the winner gets more power as a result. We show that when the agents are distributed on simple one-dimensional and two-dimensional networks, inequality grows naturally up to a certain stationary value characterized by a clear division between a higher and a lower class of agents. High class agents are separated by one or several lower class agents which serve as a geometrical barrier preventing further flow of power between them. Moreover, we consider the effect of redistributive mechanisms, such as proportional (nonprogressive) taxation. Sufficient taxation will induce a sharp transition towards a more equal society, and we argue that the critical taxation level is uniquely determined by the system geometry. Interestingly, we find that the roughness and Shannon entropy of the power distributions are a very useful complement to the standard measures of inequality, such as the Gini index and the Lorenz curve.
- 26 July 2019
- Published by American Physical Society (APS) in Physical Review E
- Vol. 100 (1) , 012143
Power accretion in social systems
We consider a model of power distribution in a social system where a set of agents plays a simple game on a graph: The probability of winning each round is proportional to the agent's current power, and the winner gets more power as a result. We show that when the agents are distributed on simple one-dimensional and two-dimensional networks, inequality grows naturally up to a certain stationary value characterized by a clear division between a higher and a lower class of agents. High class agents are separated by one or several lower class agents which serve as a geometrical barrier preventing further flow of power between them. Moreover, we consider the effect of redistributive mechanisms, such as proportional (nonprogressive) taxation. Sufficient taxation will induce a sharp transition towards a more equal society, and we argue that the critical taxation level is uniquely determined by the system geometry. Interestingly, we find that the roughness and Shannon entropy of the power distributions are a very useful complement to the standard measures of inequality, such as the Gini index and the Lorenz curve.
- 1 January 2019
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2075, 020005
Synchronization of delayed fluctuating complex networks
- 1 January 2019
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2075, 020005
Synchronization of delayed fluctuating complex networks
- Open Access
- 1 November 2018
- Published by Springer Nature in The European Physical Journal Special Topics
- Vol. 227 (10-11) , 1129-1150
Understanding the enhanced synchronization of delay-coupled networks with fluctuating topology
- 1 November 2018
- Published by Springer Nature in The European Physical Journal Special Topics
- Vol. 227 (10-11) , 1129-1150
Open AccessUnderstanding the enhanced synchronization of delay-coupled networks with fluctuating topology
- 1 November 2016
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 462, 603-618
A 3-states magnetic model of binary decisions in sociophysics
- 1 November 2016
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 462, 603-618
A 3-states magnetic model of binary decisions in sociophysics
- Open Access
- 8 February 2016
- Published by American Physical Society (APS) in Physical Review E
- Vol. 93 (2) , 022206
Chaos synchronization by resonance of multiple delay times
Chaos synchronization may arise in networks of nonlinear units with delayed couplings. We study complete and sublattice synchronization generated by resonance of two large time delays with a specific ratio. As it is known for single-delay networks, the number of synchronized sublattices is determined by the greatest common divisor (GCD) of the network loop lengths. We demonstrate analytically the GCD condition in networks of iterated Bernoulli maps with multiple delay times and complement our analytic results by numerical phase diagrams, providing parameter regions showing complete and sublattice synchronization by resonance for Tent and Bernoulli maps. We compare networks with the same GCD with single and multiple delays, and we investigate the sensitivity of the correlation to a detuning between the delays in a network of coupled Stuart-Landau oscillators. Moreover, the GCD condition also allows detection of time-delay resonances, leading to high correlations in nonsynchronizable networks. Specifically, GCD-induced resonances are observed both in a chaotic asymmetric network and in doubly connected rings of delay-coupled noisy linear oscillators.
- 8 February 2016
- Published by American Physical Society (APS) in Physical Review E
- Vol. 93 (2) , 022206
Open AccessChaos synchronization by resonance of multiple delay times
Chaos synchronization may arise in networks of nonlinear units with delayed couplings. We study complete and sublattice synchronization generated by resonance of two large time delays with a specific ratio. As it is known for single-delay networks, the number of synchronized sublattices is determined by the greatest common divisor (GCD) of the network loop lengths. We demonstrate analytically the GCD condition in networks of iterated Bernoulli maps with multiple delay times and complement our analytic results by numerical phase diagrams, providing parameter regions showing complete and sublattice synchronization by resonance for Tent and Bernoulli maps. We compare networks with the same GCD with single and multiple delays, and we investigate the sensitivity of the correlation to a detuning between the delays in a network of coupled Stuart-Landau oscillators. Moreover, the GCD condition also allows detection of time-delay resonances, leading to high correlations in nonsynchronizable networks. Specifically, GCD-induced resonances are observed both in a chaotic asymmetric network and in doubly connected rings of delay-coupled noisy linear oscillators.
- 1 April 2013
- Published by Elsevier in Neural Networks
- Vol. 40, 52-72
Intelligence and embodiment: A statistical mechanics approach
- 1 April 2013
- Published by Elsevier in Neural Networks
- Vol. 40, 52-72
Intelligence and embodiment: A statistical mechanics approach
- 18 February 2013
- Published by Springer Nature in The European Physical Journal B
- Vol. 86 (2) , 1-5
Slope selection of mounds with permeable steps in homoepitaxy
- 18 February 2013
- Published by Springer Nature in The European Physical Journal B
- Vol. 86 (2) , 1-5
Slope selection of mounds with permeable steps in homoepitaxy