Searcharxiv⌕ Search

arXiv subjects

Rubén J. Sánchez-García

Publications and source records attributed to Rubén J. Sánchez-García.

15 recordsLinked to original sources
arXiv2025

Equitability and explosive synchronisation in multiplex and higher-order networks

Cluster synchronisation is a key phenomenon observed in networks of coupled dynamical units. Its presence has been linked to symmetry and, more generally, to equability of the underlying pattern of interactions between dynamical units. However, it is not known under which conditions equitability-induced synchronisation is the only cluster synchronisation that can occur on a particular system. Here, we reveal a natural linear independent condition such that equitability becomes necessary, and sufficient, for the existence of cluster synchronised solutions on a very general dynamical system which allows multiplex or higher-order, arbitrarily weighted interactions. Our results explain the ubiquity of explosive synchronisation, as opposed to cluster synchronisation, in multiplex and higher-order networks: equitability imposes additional constraints that must be simultaneously satisfied on the same set of nodes. Our results have significant implications for the design of complex dynamical systems of coupled dynamical units with arbitrary cluster synchronisation patterns and coupling functions.

nlin.AO↗
arXiv2023

Zoo Guide to Network Embedding

Networks have provided extremely successful models of data and complex systems. Yet, as combinatorial objects, networks do not have in general intrinsic coordinates and do not typically lie in an ambient space. The process of assigning an embedding space to a network has attracted lots of interest in the past few decades, and has been efficiently applied to fundamental problems in network inference, such as link prediction, node classification, and community detection. In this review, we provide a user-friendly guide to the network embedding literature and current trends in this field which will allow the reader to navigate through the complex landscape of methods and approaches emerging from the vibrant research activity on these subjects.

cs.SI↗
arXiv2022

Possibility results for graph clustering: A novel consistency axiom

Kleinberg introduced three natural clustering properties, or axioms, and showed they cannot be simultaneously satisfied by any clustering algorithm. We present a new clustering property, Monotonic Consistency, which avoids the well-known problematic behaviour of Kleinberg's Consistency axiom, and the impossibility result. Namely, we describe a clustering algorithm, Morse Clustering, inspired by Morse Theory in Differential Topology, which satisfies Kleinberg's original axioms with Consistency replaced by Monotonic Consistency. Morse clustering uncovers the underlying flow structure on a set or graph and returns a partition into trees representing basins of attraction of critical vertices. We also generalise Kleinberg's axiomatic approach to sparse graphs, showing an impossibility result for Consistency, and a possibility result for Monotonic Consistency and Morse clustering.

cs.LG↗
arXiv2021

A directed persistent homology theory for dissimilarity functions

We develop a theory of persistent homology for directed simplicial complexes which detects persistent directed cycles in odd dimensions. We relate directed persistent homology to classical persistent homology, prove some stability results, and discuss the computational challenges of our approach. Our directed persistent homology theory is motivated by homology with semiring coefficients: by explicitly removing additive inverses, we are able to detect directed cycles algebraically.

math.AT↗
arXiv2021

Geometry and symmetry in biochemical reaction systems

Complex systems of intracellular biochemical reactions have a central role in regulating cell identities and functions. Biochemical reaction systems are typically studied using the language and tools of graph theory. However, graph representations only describe pairwise interactions between molecular species, and so are not well suited to modelling complex sets of reactions that may involve numerous reactants and/or products. Here we make use of a recently-developed hypergraph theory of chemical reactions that naturally allows for higher-order interactions to explore the geometry and quantify functional redundancy in biochemical reactions systems. Our results constitute a general theory of automorphisms for oriented hypergraphs and describe the effect of automorphism group structure on hypergraph Laplacian spectra.

math.CO↗
arXiv2020

Exploiting symmetry in network analysis

Virtually all network analyses involve structural measures between pairs of vertices, or of the vertices themselves, and the large amount of symmetry present in real-world complex networks is inherited by such measures. This has practical consequences which have not yet been explored in full generality, nor systematically exploited by network practitioners. Here we study the effect of network symmetry on arbitrary network measures, and show how this can be exploited in practice in a number of ways, from redundancy compression, to computational reduction. We also uncover the spectral signatures of symmetry for an arbitrary network measure such as the graph Laplacian. Computing network symmetries is very efficient in practice, and we test real-world examples up to several million nodes. Since network models are ubiquitous in the Applied Sciences, and typically contain a large degree of structural redundancy, our results are not only significant, but widely applicable.

math.CO↗
arXiv2018

Equivariant $K$-homology for hyperbolic reflection groups

We compute the equivariant $K$-homology of the classifying space for proper actions, for compact 3-dimensional hyperbolic reflection groups. This coincides with the topological $K$-theory of the reduced $C^\ast$-algebra associated to the group, via the Baum-Connes conjecture. We show that, for any such reflection group, the associated $K$-theory groups are torsion-free. As a result we can promote previous rational computations to integral compu- tations. Our proof relies on a new efficient algebraic criterion for checking torsion-freeness of K-theory groups, which could be applied to many other classes of groups.

math.KT↗
arXiv2014

Dimensionality reduction and spectral properties of multilayer networks

Network representations are useful for describing the structure of a large variety of complex systems. Although most studies of real-world networks suppose that nodes are connected by only a single type of edge, most natural and engineered systems include multiple subsystems and layers of connectivity. This new paradigm has attracted a great deal of attention and one fundamental challenge is to characterize multilayer networks both structurally and dynamically. One way to address this question is to study the spectral properties of such networks. Here, we apply the framework of graph quotients, which occurs naturally in this context, and the associated eigenvalue interlacing results, to the adjacency and Laplacian matrices of undirected multilayer networks. Specifically, we describe relationships between the eigenvalue spectra of multilayer networks and their two most natural quotients, the network of layers and the aggregate network, and show the dynamical implications of working with either of the two simplified representations. Our work thus contributes in particular to the study of dynamical processes whose critical properties are determined by the spectral properties of the underlying network.

physics.soc-ph↗
arXiv2012

Computing Borel's Regulator

We present an infinite series formula based on the Karoubi-Hamida integral, for the universal Borel class evaluated on H_{2n+1}(GL(\mathbb{C})). For a cyclotomic field F we define a canonical set of elements in K_3(F) and present a novel approach (based on a free differential calculus) to constructing them. Indeed, we are able to explicitly construct their images in H_{3}(GL(\mathbb{C})) under the Hurewicz map. Applying our formula to these images yields a value V_1(F), which coincides with the Borel regulator R_1(F) when our set is a basis of K_3(F) modulo torsion. For F= \mathbb{Q}(e^{2πi/3}) a computation of V_1(F) has been made based on our techniques.

math.KT↗
arXiv2011

Rational equivariant K-homology of low dimensional groups

We consider groups G which have a cocompact, 3-manifold model for the classifying space \underline{E}G. We provide an algorithm for computing the rationalized equivariant K-homology of \underline{E}G. Under the additional hypothesis that the quotient 3-orbifold \underline{E}G/G is geometrizable, the rationalized K-homology groups coincide with the rationalized K-theory of the reduced C*-algebra of G. We illustrate our algorithm on some concrete examples.

math.KT↗
arXiv2010

Microdynamics and Criticality of Adaptive Regulatory Networks

We present a model of adaptive regulatory networks consisting of a simple biologically-motivated rewiring procedure coupled to an elementary stability criterion. The resulting networks exhibit a characteristic stationary heavy-tailed degree distribution, show complex structural microdynamics and self-organize to a dynamically critical state. We show analytically that the observed criticality results from the formation and breaking of transient feedback loops during the adaptive process.

physics.soc-ph↗
arXiv2009

Spectral Characteristics of Network Redundancy

Many real-world complex networks contain a significant amount of structural redundancy, in which multiple vertices play identical topological roles. Such redundancy arises naturally from the simple growth processes which form and shape many real-world systems. Since structurally redundant elements may be permuted without altering network structure, redundancy may be formally investigated by examining network automorphism (symmetry) groups. Here, we use a group-theoretic approach to give a complete description of spectral signatures of redundancy in undirected networks. In particular, we describe how a network's automorphism group may be used to directly associate specific eigenvalues and eigenvectors with specific network motifs.

physics.soc-ph↗
arXiv2009

K-Theory for group C^*-algebras

These notes are based on a lecture course given by the first author in the Sedano Winter School on K-theory held in Sedano, Spain, on January 22-27th of 2007. They aim at introducing K-theory of C^*-algebras, equivariant K-homology and KK-theory in the context of the Baum-Connes conjecture.

math.KT↗
arXiv2007

On Automorphism Groups of Networks

We consider the size and structure of the automorphism groups of a variety of empirical `real-world' networks and find that, in contrast to classical random graph models, many real-world networks are richly symmetric. We relate automorphism group structure to network topology and discuss generic forms of symmetry and their origin in real-world networks.

physics.soc-ph↗