SearcharxivSearch

arXiv subjects

D. Aleja

Publications and source records attributed to D. Aleja.

4 recordsLinked to original sources

Parenclitic hypergraphs and their application in personalized cancer therapy

Understanding the differences between individual instances of the same complex system remains a central challenge, particularly in biological contexts. Parenclitic networks constitute a suitable means to detect deviations in correlations with respect to reference populations. Here, we introduce parenclitic hypergraphs, a general framework for identifying anomalies in higher-order correlations across arbitrary interaction orders. After validating the method on synthetic datasets and benchmark ones, we apply it to patient-derived cancer organoids, capturing temporal changes in gene expression between healthy and cancerous tissues as the disease progresses. Our approach not only reproduces known oncogenic signatures, but also reveals a previously unrecognized candidate therapeutic target. Since organoids are generated from individual patients, our method provides, for the first time, a viable protocol for personalized cancer therapy based on higher-order correlation patterns. These findings offer a novel, systems-level strategy for precision oncology grounded in complex systems theory.

q-bio.QM

Endowing networks with desired symmetries and modular behavior

Symmetries in a network regulate its organization into functional clustered states. Given a generic ensemble of nodes and a desirable cluster (or group of clusters), we exploit the direct connection between the elements of the eigenvector centrality and the graph symmetries to generate a network equipped with the desired cluster(s), with such a synthetical structure being furthermore perfectly reflected in the modular organization of the network's functioning. Our results solve a relevant problem of reverse engineering, and are of generic application in all cases where a desired parallel functioning needs to be blueprinted.

nlin.AO

A compartmental model for cyber-epidemics

In our more and more interconnected world, a specific risk is that of a cyber-epidemic (or cyber-pandemic), produced either accidentally or intentionally, where a cyber virus propagates from device to device up to undermining the global Internet system with devastating consequences in terms of economic costs and societal harms related to the shutdown of essential services. We introduce a compartmental model for studying the spreading of a malware and of the awareness of its incidence through different waves which are evolving on top of the same graph structure (the global network of connected devices). This is realized by considering vectorial compartments made of two components, the first being descriptive of the state of the device with respect to the new malware's propagation, and the second accounting for the awareness of the device's user about the presence of the cyber threat. By introducing suitable transition rates between such compartments, one can then follow the evolution of a cyber-epidemic from the moment at which a new virus is seeded in the network, up to when a given user realizes that his/her device has suffered a damage and consequently starts a wave of awareness which eventually ends up with the development of a proper antivirus software. We then compare the overall damage that a malware is able to produce in Erdős-Rényi and scale-free network architectures for both the case in which the virus is causing a fixed damage on each device and the case where, instead, the virus is engineered to mutate while replicating from device to device. Our result constitute actually the attempt to build a specific compartmental model whose variables and parameters are entirely customized for describing cyber-epidemics.

cs.CR

The weighted periodic-parabolic degenerate logistic equation

The main goal of this paper is twofold. First, it characterizes the existence of positive periodic solutions for a general class of weighted periodic-parabolic logistic problems of degenerate type (see (1.1)). This result provides us with is a substantial generalization of Theorem 1.1 of Daners and López-Gómez [12] even for the elliptic counterpart of (1.1), and of some previous findings of the authors in [1] and [2]. Then, it sharpens some results of [19] by enlarging the class of critical degenerate weight functions for which (1.1) admits a positive periodic solution in an unbounded interval of values of the parameter $λ$. The latest findings, not having any previous elliptic counterpart, are utterly new and of great interest in Population Dynamics.

math.AP