2k citations
- Centre National de la Recherche ScientifiqueFR11 papers
- Foundation for Research and Technology HellasGR11 papers
- National Observatory of AthensGR10 papers
- University of ManchesterGB9 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR8 papers
- CEA Paris-SaclayFR7 papers
- European Organization for Nuclear ResearchCH7 papers
- National Technical University of AthensGR7 papers
- CY Cergy Paris UniversitéFR5 papers
- Imperial College LondonGB5 papers
- National and Kapodistrian University of AthensGR5 papers
- National Centre of Scientific Research "Demokritos"GR5 papers
9 papers · 1 filter
Entangling and decohering influence of noisy perturbations. Stochastic anti-resonance in the time evolution of interacting qubits
Demetris P. K. Ghikas, Athanasios C. Tzemos
We study the entanglement evolution of two coupled qubits in interaction with an external environment and in the presence of an external magnetic field with a stochastic component.…
Nonlinear waves in disordered chains: probing the limits of chaos and spreading
J. D. Bodyfelt, T. V. Laptyeva, Ch. Skokos +2
We probe the limits of nonlinear wave spreading in disordered chains which are known to localize linear waves. We particularly extend recent studies on the regimes of strong and we…
Non-abelian T-duality, Ramond Fields and Coset Geometries
Yolanda Lozano, Eoin 'O Colgain, Konstadinos Sfetsos +1
We extend previous work on non-abelian T-duality in the presence of Ramond fluxes to cases in which the duality group acts with isotropy such as in backgrounds containing coset spa…
Wang-Landau study of the 3D Ising model with bond disorder
P. E. Theodorakis, N. G. Fytas
We implement a two-stage approach of the Wang-Landau algorithm to investigate the critical properties of the 3D Ising model with quenched bond randomness. In particular, we conside…
Enforcing efficient equilibria in network design games via subsidies
John Augustine, Ioannis Caragiannis, Angelo Fanelli +1
The efficient design of networks has been an important engineering task that involves challenging combinatorial optimization problems. Typically, a network designer has to select a…
Efficient computation of approximate pure Nash equilibria in congestion games
Ioannis Caragiannis, Angelo Fanelli, Nick Gravin +1
Congestion games constitute an important class of games in which computing an exact or even approximate pure Nash equilibrium is in general {\sf PLS}-complete. We present a surpris…