Search

We introduce a Metropolis-Hastings Markov chain for Boltzmann distributions of classical spin systems. It relies on approximate tensor network contractions to propose correlated collective updates at each step of the evolution. We present benchmarks for a wide variety of instances of the two-dimensional Ising model, including ferromagnetic, antiferromagnetic, (fully) frustrated and Edwards-Anderson spin glass cases, and we show that, with modest computational effort, our Markov chain achieves sizeable acceptance rates, even in the vicinity of critical points. In each of the situations we have considered, the Markov chain compares well with other Monte Carlo schemes such as the Metropolis or Wolff algorithm: equilibration times appear to be reduced by a factor that varies between 40 and 2000, depending on the model and the observable being monitored. We also present an extension to three spatial dimensions, and demonstrate that it exhibits fast equilibration for finite ferro and antiferromagnetic instances. Additionally, and although it is originally designed for a square lattice of finite degrees of freedom with open boundary conditions, the proposed scheme can be used as such, or with slight modifications, to study triangular lattices, systems with continuous degrees of freedom, matrix models, a confined gas of hard spheres, or to deal with arbitrary boundary conditions., Comment: 21 pages, 25 figures

Most physical and other natural systems are complex entities composed of a large number of interacting individual elements. It is a surprising fact that they often obey the so-called scaling laws relating an observable quantity with a measure of the size of the system. Here we describe the discovery of universal superlinear metabolic scaling laws in human cancers. This dependence underpins increasing tumour aggressiveness, due to evolutionary dynamics, which leads to an explosive growth as the disease progresses. We validated this dynamic using longitudinal volumetric data of different histologies from large cohorts of cancer patients. To explain our observations we put forward increasingly complex biologically-inspired mathematical models that captured the key processes governing tumor growth. Our models predicted that the emergence of superlinear allometric scaling laws is an inherently three-dimensional phenomenon. Moreover, the scaling laws thereby identified allowed us to define a set of metabolic metrics with prognostic value, thus providing added clinical utility to the base findings.

In this work we initiate the study of Position Based Quantum Cryptography (PBQC) from the perspective of geometric functional analysis and its connections with quantum games. The main question we are interested in asks for the optimal amount of entanglement that a coalition of attackers have to share in order to compromise the security of any PBQC protocol. Known upper bounds for that quantity are exponential in the size of the quantum systems manipulated in the honest implementation of the protocol. However, known lower bounds are only linear. In order to deepen the understanding of this question, here we propose a Position Verification (PV) protocol and find lower bounds on the resources needed to break it. The main idea behind the proof of these bounds is the understanding of cheating strategies as vector valued assignments on the Boolean hypercube. Then, the bounds follow from the understanding of some geometric properties of particular Banach spaces, their type constants. Under some regularity assumptions on the former assignment, these bounds lead to exponential lower bounds on the quantum resources employed, clarifying the question in this restricted case. Known attacks indeed satisfy the assumption we make, although we do not know how universal this feature is. Furthermore, we show that the understanding of the type properties of some more involved Banach spaces would allow to drop out the assumptions and lead to unconditional lower bounds on the resources used to attack our protocol. Unfortunately, we were not able to estimate the relevant type constant. Despite that, we conjecture an upper bound for this quantity and show some evidence supporting it. A positive solution of the conjecture would lead to stronger security guarantees for the proposed PV protocol providing a better understanding of the question asked above., Comment: Presentation substantially improved. A couple of sections were removed for the sake of conciseness and some clarifications added

The dynamics of collaboration networks of firms follow a life-cycle of growth and decline. That does not imply they also become less resilient. Instead, declining collaboration networks may still have the ability to mitigate shocks from firms leaving, and to recover from these losses by adapting to new partners. To demonstrate this, we analyze 21.500 R\&D collaborations of 14.500 firms in six different industrial sectors over 25 years. We calculate time-dependent probabilities of firms leaving the network and simulate drop-out cascades, to determine the expected dynamics of decline. We then show that deviations from these expectations result from the adaptivity of the network, which mitigates the decline. These deviations can be used as a measure of network resilience.

The theory of entanglement provides a fundamentally new language for describing interactions and correlations in many body systems. Its vocabulary consists of qubits and entangled pairs, and the syntax is provided by tensor networks. We review how matrix product states and projected entangled pair states describe many-body wavefunctions in terms of local tensors. These tensors express how the entanglement is routed, act as a novel type of non-local order parameter, and we describe how their symmetries are reflections of the global entanglement patterns in the full system. We will discuss how tensor networks enable the construction of real-space renormalization group flows and fixed points, and examine the entanglement structure of states exhibiting topological quantum order. Finally, we provide a summary of the mathematical results of matrix product states and projected entangled pair states, highlighting the fundamental theorem of matrix product vectors and its applications., Comment: Review article. 72 pages

In this paper, a methodology inspired on bond and site percolation methods is applied to the estimation of the resilience against failures in power grids. Our approach includes vulnerability measures with both dynamical and structural foundations as an attempt to find more insights about the relationships between topology and dynamics in the second-order Kuramoto model on complex networks. As test cases for numerical simulations, we use the real-world topology of the Colombian power transmission system, as well as randomly generated networks with spatial embedding. It is observed that, by focusing the attacks on those dynamical vulnerabilities, the power grid becomes, in general, more prone to reach a state of total blackout, which in the case of node removal procedures it is conditioned by the homogeneity of power distribution in the network.

To track online emotional expressions of the Austrian population close to real-time during the COVID-19 pandemic, we build a self-updating monitor of emotion dynamics using digital traces from three different data sources. This enables decision makers and the interested public to assess issues such as the attitude towards counter-measures taken during the pandemic and the possible emergence of a (mental) health crisis early on. We use web scraping and API access to retrieve data from the news platform derstandard.at, Twitter and a chat platform for students. We document the technical details of our workflow in order to provide materials for other researchers interested in building a similar tool for different contexts. Automated text analysis allows us to highlight changes of language use during COVID-19 in comparison to a neutral baseline. We use special word clouds to visualize that overall difference. Longitudinally, our time series show spikes in anxiety that can be linked to several events and media reporting. Additionally, we find a marked decrease in anger. The changes last for remarkably long periods of time (up to 12 weeks). We discuss these and more patterns and connect them to the emergence of collective emotions. The interactive dashboard showcasing our data is available online under http://www.mpellert.at/covid19_monitor_austria/. Our work has attracted media attention and is part of an web archive of resources on COVID-19 collected by the Austrian National Library., Comment: 23 pages, 3 figures, 1 table

This paper presents a study showing the benefits of the EfficientNet models compared with heavier Convolutional Neural Networks (CNNs) in the Document Classification task, essential problem in the digitalization process of institutions. We show in the RVL-CDIP dataset that we can improve previous results with a much lighter model and present its transfer learning capabilities on a smaller in-domain dataset such as Tobacco3482. Moreover, we present an ensemble pipeline which is able to boost solely image input by combining image model predictions with the ones generated by BERT model on extracted text by OCR. We also show that the batch size can be effectively increased without hindering its accuracy so that the training process can be sped up by parallelizing throughout multiple GPUs, decreasing the computational time needed. Lastly, we expose the training performance differences between PyTorch and Tensorflow Deep Learning frameworks.

It is a generalized belief that there are no thermal phase transitions in short range 1D quantum systems. However, the only known case for which this is rigorously proven is for the particular case of finite range translational invariant interactions. The proof was obtained by Araki in his seminal paper of 1969 as a consequence of pioneering locality estimates for the time-evolution operator that allowed him to prove its analiticity on the whole complex plane, when applied to a local observable. However, as for now there is no mathematical proof of the abscence of 1D thermal phase transitions if one allows exponential tails in the interactions. In this work we extend Araki's result to include exponential (or faster) tails. Our main result is the analyticity of the time-evolution operator applied on a local observable on a suitable strip around the real line. As a consequence we obtain that thermal states in 1D exhibit exponential decay of correlations above a threshold temperature that decays to zero with the exponent of the interaction decay, recovering Araki's result as a particular case. Our result however still leaves open the possibility of 1D thermal short range phase transitions. We conclude with an application of our result to the spectral gap problem for Projected Entangled Pair States (PEPS) on 2D lattices, via the holographic duality due to Cirac et al., Comment: 38 pages

Thus far, end-to-end (E2E) models have not been shown to outperform state-of-the-art conventional models with respect to both quality, i.e., word error rate (WER), and latency, i.e., the time the hypothesis is finalized after the user stops speaking. In this paper, we develop a first-pass Recurrent Neural Network Transducer (RNN-T) model and a second-pass Listen, Attend, Spell (LAS) rescorer that surpasses a conventional model in both quality and latency. On the quality side, we incorporate a large number of utterances across varied domains to increase acoustic diversity and the vocabulary seen by the model. We also train with accented English speech to make the model more robust to different pronunciations. In addition, given the increased amount of training data, we explore a varied learning rate schedule. On the latency front, we explore using the end-of-sentence decision emitted by the RNN-T model to close the microphone, and also introduce various optimizations to improve the speed of LAS rescoring. Overall, we find that RNN-T+LAS offers a better WER and latency tradeoff compared to a conventional model. For example, for the same latency, RNN-T+LAS obtains a 8% relative improvement in WER, while being more than 400-times smaller in model size., Comment: In Proceedings of IEEE ICASSP 2020

It is known that individual opinions on different policy issues often align to a dominant ideological dimension (e.g. "left" vs. "right") and become increasingly polarized. We provide an agent-based model that reproduces these two stylized facts as emergent properties of an opinion dynamics in a multi-dimensional space of continuous opinions. The mechanisms for the change of agents' opinions in this multi-dimensional space are derived from cognitive dissonance theory and structural balance theory. We test assumptions from proximity voting and from directional voting regarding their ability to reproduce the expected emerging properties. We further study how the emotional involvement of agents, i.e. their individual resistance to change opinions, impacts the dynamics. We identify two regimes for the global and the individual alignment of opinions. If the affective involvement is high and shows a large variance across agents, this fosters the emergence of a dominant ideological dimension. Agents align their opinions along this dimension in opposite directions, i.e. create a state of polarization., Comment: 34 pp