Search

Non-equilibrium selection pressures were proposed for the formation of oligonucleotides with rich functionalities encoded in their sequences, such as catalysis. Since phase separation was shown to direct various chemical processes, we ask whether condensed phases can provide mechanisms for sequence selection. To answer this question, we use non-equilibrium thermodynamics and describe the reversible oligomerization of different monomers to sequences at non-dilute conditions prone to phase separation. We find that when sequences oligomerize, their interactions give rise to phase separation, boosting specific sequences' enrichment and depletion. Our key result is that phase separation gives rise to a selection pressure for the oligomerization of specific sequence patterns when fragmentation maintains the system away from equilibrium. Specifically, slow fragmentation favors alternating sequences that interact well with their environment (more cooperative), while fast fragmentation selects sequences with extended motifs capable of specific sequence interactions (less cooperative). Our results highlight that out-of-equilibrium condensed phases could provide versatile hubs for Darwinian-like evolution toward functional sequences, both relevant for the molecular origin of life and de novo life.

Image manipulation detection and localization have received considerable attention from the research community given the blooming of Generative Models (GMs). Detection methods that follow a passive approach may overfit to specific GMs, limiting their application in real-world scenarios, due to the growing diversity of generative models. Recently, approaches based on a proactive framework have shown the possibility of dealing with this limitation. However, these methods suffer from two main limitations, which raises concerns about potential vulnerabilities: i) the manipulation detector is not robust to noise and hence can be easily fooled; ii) the fact that they rely on fixed perturbations for image protection offers a predictable exploit for malicious attackers, enabling them to reverse-engineer and evade detection. To overcome this issue we propose PADL, a new solution able to generate image-specific perturbations using a symmetric scheme of encoding and decoding based on cross-attention, which drastically reduces the possibility of reverse engineering, even when evaluated with adaptive attack [31]. Additionally, PADL is able to pinpoint manipulated areas, facilitating the identification of specific regions that have undergone alterations, and has more generalization power than prior art on held-out generative models. Indeed, although being trained only on an attribute manipulation GAN model [15], our method generalizes to a range of unseen models with diverse architectural designs, such as StarGANv2, BlendGAN, DiffAE, StableDiffusion and StableDiffusionXL. Additionally, we introduce a novel evaluation protocol, which offers a fair evaluation of localisation performance in function of detection accuracy and better captures real-world scenarios.

We establish the non-degeneracy of bubbling solutions for singular mean field equations when the blow-up points are either regular or non-quantized singular sources. This extends the results from Bartolucci-Jevnikar-Lee-Yang \cite{bart-5}, which focused on regular blow-up points. As a result, we establish the strict convexity of the entropy in the large energy limit for a specific class of two-dimensional domains in the Onsager mean field vortex model with sinks., Comment: 73 pages

Emulsions ripen with an average droplet size increasing in time. In chemically active emulsions, coarsening can be absent, leading to a non-equilibrium steady state with mono-disperse droplet sizes. By considering a minimal model for phase separation and chemical reactions maintained away from equilibrium, we show that there is a critical transition in the conserved quantity between two classes of chemically active droplets: intensive and extensive ones. Single intensive active droplets reach a stationary size mainly controlled by the reaction-diffusion length scales. Intensive droplets in an emulsion interact only weakly, and the stationary size of a single droplet approximately sets the size of each droplet. On the contrary, the size of a single extensive active droplet scales with the system size, similar to passive phases. In an emulsion of many extensive droplets, their sizes become stationary only due to interactions among them. We discuss how the critical transition between intensive and extensive active droplets affects shape instabilities, including the division of active droplets, paving the way for the observation of successive division events in chemically active emulsions

Debt recycling is an aggressive equity extraction strategy that potentially permits faster repayment of a mortgage. While equity progressively builds up as the mortgage is repaid monthly, mortgage holders may obtain another loan they could use to invest on a risky asset. The wealth produced by a successful investment is then used to repay the mortgage faster. The strategy is riskier than a standard repayment plan since fluctuations in the house market and investment's volatility may also lead to a fast default, as both the mortgage and the liquidity loan are secured against the same good. The general conditions of the mortgage holder and the outside market under which debt recycling may be recommended or discouraged have not been fully investigated. In this paper, to evaluate the effectiveness of traditional monthly mortgage repayment versus debt recycling strategies, we build a dynamical model of debt recycling and study the time evolution of equity and mortgage balance as a function of loan-to-value ratio, house market performance, and return of the risky investment. We find that the model has a rich behavior as a function of its main parameters, showing strongly and weakly successful phases - where the mortgage is eventually repaid faster and slower than the standard monthly repayment strategy, respectively - a default phase where the equity locked in the house vanishes before the mortgage is repaid, signalling a failure of the debt recycling strategy, and a permanent re-mortgaging phase - where further investment funds from the lender are continuously secured, but the mortgage is never fully repaid. The strategy's effectiveness is found to be highly sensitive to the initial mortgage-to-equity ratio, the monthly amount of scheduled repayments, and the economic parameters at the outset. The analytical results are corroborated with numerical simulations with excellent agreement., Comment: 27 pages, 13 figures

We introduce a novel large-scale deep learning model for Limit Order Book mid-price changes forecasting, and we name it `HLOB'. This architecture (i) exploits the information encoded by an Information Filtering Network, namely the Triangulated Maximally Filtered Graph, to unveil deeper and non-trivial dependency structures among volume levels; and (ii) guarantees deterministic design choices to handle the complexity of the underlying system by drawing inspiration from the groundbreaking class of Homological Convolutional Neural Networks. We test our model against 9 state-of-the-art deep learning alternatives on 3 real-world Limit Order Book datasets, each including 15 stocks traded on the NASDAQ exchange, and we systematically characterize the scenarios where HLOB outperforms state-of-the-art architectures. Our approach sheds new light on the spatial distribution of information in Limit Order Books and on its degradation over increasing prediction horizons, narrowing the gap between microstructural modeling and deep learning-based forecasting in high-frequency financial markets., Comment: 34 pages, 7 figures, 7 tables, 3 equations

We are concerned with Grad-Shafranov type equations, describing in dimension $N=2$ the equilibrium configurations of a plasma in a Tokamak. We obtain a sharp superlinear generalization of the result of Temam (1977) about the linear case, implying the first general uniqueness result ever for superlinear free boundary problems arising in plasma physics. Previous general uniqueness results of Beresticky-Brezis (1980) were concerned with globally Lipschitz nonlinearities. In dimension $N\geq 3$ the uniqueness result is new but not sharp, motivating the local analysis of a spikes condensation-quantization phenomenon for superlinear and subcritical singularly perturbed Grad-Shafranov type free boundary problems, implying among other things a converse of the results about spikes condensation in Flucher-Wei (1998) and Wei (2001). Interestingly enough, in terms of the "physical" global variables, we come up with a concentration-quantization-compactness result sharing the typical features of critical problems (Yamabe $N\geq 3$, Liouville $N=2$) but in a subcritical setting, the singular behavior being induced by a sort of infinite mass limit, in the same spirit of Brezis-Merle (1991)., Comment: 54 pages

We exploit cutting-edge deep learning methodologies to explore the predictability of high-frequency Limit Order Book mid-price changes for a heterogeneous set of stocks traded on the NASDAQ exchange. In so doing, we release `LOBFrame', an open-source code base to efficiently process large-scale Limit Order Book data and quantitatively assess state-of-the-art deep learning models' forecasting capabilities. Our results are twofold. We demonstrate that the stocks' microstructural characteristics influence the efficacy of deep learning methods and that their high forecasting power does not necessarily correspond to actionable trading signals. We argue that traditional machine learning metrics fail to adequately assess the quality of forecasts in the Limit Order Book context. As an alternative, we propose an innovative operational framework that evaluates predictions' practicality by focusing on the probability of accurately forecasting complete transactions. This work offers academics and practitioners an avenue to make informed and robust decisions on the application of deep learning techniques, their scope and limitations, effectively exploiting emergent statistical properties of the Limit Order Book., Comment: 43 pages, 14 figures, 12 Tables

Studying the function spaces defined by neural networks helps to understand the corresponding learning models and their inductive bias. While in some limits neural networks correspond to function spaces that are reproducing kernel Hilbert spaces, these regimes do not capture the properties of the networks used in practice. In contrast, in this paper we show that deep neural networks define suitable reproducing kernel Banach spaces. These spaces are equipped with norms that enforce a form of sparsity, enabling them to adapt to potential latent structures within the input data and their representations. In particular, leveraging the theory of reproducing kernel Banach spaces, combined with variational results, we derive representer theorems that justify the finite architectures commonly employed in applications. Our study extends analogous results for shallow networks and can be seen as a step towards considering more practically plausible neural architectures.

The Katz centrality of a node in a complex network is a measure of the node's importance as far as the flow of information across the network is concerned. For ensembles of locally tree-like and undirected random graphs, this observable is a random variable. Its full probability distribution is of interest but difficult to handle analytically because of its "global" character and its definition in terms of a matrix inverse. Leveraging a fast Gaussian Belief Propagation-cavity algorithm to solve linear systems on a tree-like structure, we show that (i) the Katz centrality of a single instance can be computed recursively in a very fast way, and (ii) the probability $P(K)$ that a random node in the ensemble of undirected random graphs has centrality $K$ satisfies a set of recursive distributional equations, which can be analytically characterized and efficiently solved using a population dynamics algorithm. We test our solution on ensembles of Erd\H{o}s-R\'enyi and scale-free networks in the locally tree-like regime, with excellent agreement. The distributions display a crossover between multimodality and unimodality as the mean degree increases, where distinct peaks correspond to the contribution to the centrality coming from nodes of different degrees. We also provide an approximate formula based on a rank-$1$ projection that works well if the network is not too sparse, and we argue that an extension of our method could be efficiently extended to tackle analytical distributions of other centrality measures such as PageRank for directed networks in a transparent and user-friendly way., Comment: 14 pages, 11 fig

For singular mean field equations defined on a compact Riemann surface, we prove the uniqueness of bubbling solutions as far as blowup points are either regular points or non-quantized singular sources. In particular the uniqueness result covers the most general case extending or improving all previous works of Bartolucci-Jevnikar-Lee-Yang \cite{bart-4,bart-4-2} and Wu-Zhang \cite{wu-zhang-ccm}. For example, unlike previous results, we drop the assumption of singular sources being critical points of a suitably defined Kirchoff-Routh type functional. Our argument is based on refined estimates, robust and flexible enough to be applied to a wide range of problems requiring a delicate blowup analysis. In particular we come up with a major simplification of previous uniqueness proofs., Comment: 79 pages

In recent years, decentralized applications (dApps) built on blockchain platforms such as Ethereum and coded in languages such as Solidity, have gained attention for their potential to disrupt traditional centralized systems. Despite their rapid adoption, limited research has been conducted to understand the underlying code structure of these applications. In particular, each dApp is composed of multiple smart contracts, each containing a number of functions that can be called to trigger a specific event, e.g., a token transfer. In this paper, we reconstruct and analyse the network of contracts and functions calls within the dApp, which is helpful to unveil vulnerabilities that can be exploited by malicious attackers. We show how decentralization is architecturally implemented, identifying common development patterns and anomalies that could influence the system's robustness and efficiency. We find a consistent network structure characterized by modular, self-sufficient contracts and a complex web of function interactions, indicating common coding practices across the blockchain community. Critically, a small number of key functions within each dApp play a pivotal role in maintaining network connectivity, making them potential targets for cyber attacks and highlighting the need for robust security measures., Comment: 28 pages, 23 figures

This paper presents MindTheDApp, a toolchain designed specifically for the structural analysis of Ethereum-based Decentralized Applications (DApps), with a distinct focus on a complex network-driven approach. Unlike existing tools, our toolchain combines the power of ANTLR4 and Abstract Syntax Tree (AST) traversal techniques to transform the architecture and interactions within smart contracts into a specialized bipartite graph. This enables advanced network analytics to highlight operational efficiencies within the DApp's architecture. The bipartite graph generated by the proposed tool comprises two sets of nodes: one representing smart contracts, interfaces, and libraries, and the other including functions, events, and modifiers. Edges in the graph connect functions to smart contracts they interact with, offering a granular view of interdependencies and execution flow within the DApp. This network-centric approach allows researchers and practitioners to apply complex network theory in understanding the robustness, adaptability, and intricacies of decentralized systems. Our work contributes to the enhancement of security in smart contracts by allowing the visualisation of the network, and it provides a deep understanding of the architecture and operational logic within DApps. Given the growing importance of smart contracts in the blockchain ecosystem and the emerging application of complex network theory in technology, our toolchain offers a timely contribution to both academic research and practical applications in the field of blockchain technology.

Deep learning methods have demonstrated outstanding performances on classification and regression tasks on homogeneous data types (e.g., image, audio, and text data). However, tabular data still pose a challenge, with classic machine learning approaches being often computationally cheaper and equally effective than increasingly complex deep learning architectures. The challenge arises from the fact that, in tabular data, the correlation among features is weaker than the one from spatial or semantic relationships in images or natural language, and the dependency structures need to be modeled without any prior information. In this work, we propose a novel deep learning architecture that exploits the data structural organization through topologically constrained network representations to gain relational information from sparse tabular inputs. The resulting model leverages the power of convolution and is centered on a limited number of concepts from network topology to guarantee: (i) a data-centric and deterministic building pipeline; (ii) a high level of interpretability over the inference process; and (iii) an adequate room for scalability. We test our model on 18 benchmark datasets against 5 classic machine learning and 3 deep learning models, demonstrating that our approach reaches state-of-the-art performances on these challenging datasets. The code to reproduce all our experiments is provided at https://github.com/FinancialComputingUCL/HomologicalCNN., Comment: 26 pages, 5 figures, 11 tables, 1 equation, 1 algorithm

Sampled Gabor phase retrieval - the problem of recovering a square-integrable signal from the magnitude of its Gabor transform sampled on a lattice - is a fundamental problem in signal processing, with important applications in areas such as imaging and audio processing. Recently, a classification of square-integrable signals which are not phase retrievable from Gabor measurements on parallel lines has been presented. This classification was used to exhibit a family of counterexamples to uniqueness in sampled Gabor phase retrieval. Here, we show that the set of counterexamples to uniqueness in sampled Gabor phase retrieval is dense in $L^2(\mathbb{R})$, but is not equal to the whole of $L^2(\mathbb{R})$ in general. Overall, our work contributes to a better understanding of the fundamental limits of sampled Gabor phase retrieval., Comment: 5 pages, 2 figures

The aim of this note is to present the first qualitative global bifurcation diagram of the equation $-\Delta u=\mu|x|^{2\alpha}e^u$. To this end, we introduce the notion of domains of first/second kind for singular mean field equations and base our approach on a suitable spectral analysis. In particular, we treat also non-radial solutions and non-symmetric domains and show that the shape of the branch of solutions still resembles the well-known one of the model regular radial case on the disk. Some work is devoted also to the asymptotic profile for $\mu\to-\infty$., Comment: 15 pages

We study a chemically active binary mixture undergoing phase separation and show that under non-equilibrium conditions, stable liquid spherical shells can form via a spinodal instability in the droplet center. A single liquid shell tends to grow until it undergoes a shape instability beyond a critical size. In an active emulsion, many stable and stationary liquid shells can coexist. We discuss conditions under which liquid shells are stable and dominant as compared to regimes where droplets undergo shape instabilities and divide.

The aim of this note is to study the spectrum of a linearized Liouville-type problem, characterizing the case in which the first eigenvalue is zero. Interestingly enough, we obtain also point-wise information on the associated first eigenfunction. To this end, we refine the Alexandrov-Bol inequality suitable for our problem and characterize its equality case., Comment: 14 pages

Recently, operator learning, or learning mappings between infinite-dimensional function spaces, has garnered significant attention, notably in relation to learning partial differential equations from data. Conceptually clear when outlined on paper, neural operators necessitate discretization in the transition to computer implementations. This step can compromise their integrity, often causing them to deviate from the underlying operators. This research offers a fresh take on neural operators with a framework Representation equivalent Neural Operators (ReNO) designed to address these issues. At its core is the concept of operator aliasing, which measures inconsistency between neural operators and their discrete representations. We explore this for widely-used operator learning techniques. Our findings detail how aliasing introduces errors when handling different discretizations and grids and loss of crucial continuous structures. More generally, this framework not only sheds light on existing challenges but, given its constructive and broad nature, also potentially offers tools for developing new neural operators., Comment: 28 pages

This paper evaluates the capability of two state-of-the-art artificial intelligence (AI) models, GPT-3.5 and Bard, in generating Java code given a function description. We sourced the descriptions from CodingBat.com, a popular online platform that provides practice problems to learn programming. We compared the Java code generated by both models based on correctness, verified through the platform's own test cases. The results indicate clear differences in the capabilities of the two models. GPT-3.5 demonstrated superior performance, generating correct code for approximately 90.6% of the function descriptions, whereas Bard produced correct code for 53.1% of the functions. While both models exhibited strengths and weaknesses, these findings suggest potential avenues for the development and refinement of more advanced AI-assisted code generation tools. The study underlines the potential of AI in automating and supporting aspects of software development, although further research is required to fully realize this potential.

This paper is concerned with upstreamness and downstreamness of industries and countries in global value chains. Upstreamness and downstreamness measure respectively the average distance of an industrial sector from final consumption and from primary inputs, and they are computed from based on the most used global Input-Output tables databases, e.g., the World Input-Output Database (WIOD). Recently, Antr\`as and Chor reported a puzzling and counter-intuitive finding in data from the period 1995-2011, namely that (at country level) upstreamness appears to be positively correlated with downstreamness, with a correlation slope close to $+1$. This effect is stable over time and across countries, and it has been confirmed and validated by later analyses. We first analyze a simple model of random Input/Output tables, and we show that, under minimal and realistic structural assumptions, there is a natural positive correlation emerging between upstreamness and downstreamness of the same industrial sector/country, with correlation slope equal to $+1$. This effect is robust against changes in the randomness of the entries of the I/O table and different aggregation protocols. Secondly, we perform experiments by randomly reshuffling the entries of the empirical I/O table where these puzzling correlations are detected, in such a way that the global structural constraints are preserved. Again, we find that the upstreamness and downstreamness of the same industrial sector/country are positively correlated with slope close to $+1$, even though the random reshuffling has destroyed any underlying economic information about inter-sectorial connections and trends. Our results strongly suggest that the empirically observed puzzling correlation may rather be a necessary consequence of the few structural constraints that Input/Output tables must meet., Comment: 14 pages, 10 figures. Added experiments about random reshuffling of I-O tables

We study the problem of recovering a signal from magnitudes of its wavelet frame coefficients when the analyzing wavelet is real-valued. We show that every real-valued signal can be uniquely recovered, up to global sign, from its multi-wavelet frame coefficients \[ \{\lvert \mathcal{W}_{\phi_i} f(\alpha^{m}\beta n,\alpha^{m}) \rvert: i\in\{1,2,3\}, m,n\in\mathbb{Z}\} \] for every $\alpha>1,\beta>0$ with $\beta\ln(\alpha)\leq 4\pi/(1+4p)$, $p>0$, when the three wavelets $\phi_i$ are suitable linear combinations of the Poisson wavelet $P_p$ of order $p$ and its Hilbert transform $\mathscr{H}P_p$. For complex-valued signals we find that this is not possible for any choice of the parameters $\alpha>1,\beta>0$, and for any window. In contrast to the existing literature on wavelet sign retrieval, our uniqueness results do not require any bandlimiting constraints or other a priori knowledge on the real-valued signals to guarantee their unique recovery from the absolute values of their wavelet coefficients., Comment: 14 pages, 2 figures

Although very successfully used in conventional machine learning, convolution based neural network architectures -- believed to be inconsistent in function space -- have been largely ignored in the context of learning solution operators of PDEs. Here, we present novel adaptations for convolutional neural networks to demonstrate that they are indeed able to process functions as inputs and outputs. The resulting architecture, termed as convolutional neural operators (CNOs), is designed specifically to preserve its underlying continuous nature, even when implemented in a discretized form on a computer. We prove a universality theorem to show that CNOs can approximate operators arising in PDEs to desired accuracy. CNOs are tested on a novel suite of benchmarks, encompassing a diverse set of PDEs with possibly multi-scale solutions and are observed to significantly outperform baselines, paving the way for an alternative framework for robust and accurate operator learning. Our code is publicly available at https://github.com/bogdanraonic3/ConvolutionalNeuralOperator