17 citations · 31 across the 7 of their papers we have counts for
7 papers
Descriptive complexity of controllable graphs
Aida Abiad, Anuj Dawar, Octavio Zapata
Let be a graph on vertices with adjacency matrix , and let be the all-ones vector. We call controllable if the set of vectors $\mathbf{1}, A\mathbf{1},…
The degree-distance and transmission-adjacency matrices
Carlos A. Alfaro, Octavio Zapata
Let be a connected graph with adjacency matrix . The distance matrix of has rows and columns indexed by with -entry equal to the distance $\mathrm{d…
Descriptive complexity of the generalized spectra of graphs
Aida Abiad, Anuj Dawar, Octavio Zapata
Two graphs are cospectral if their respective adjacency matrices have the same multiset of eigenvalues, and generalized cospectral if they are cospectral and so are their complemen…
Heterogeneity extends criticality
Fernanda Sánchez-Puig, Octavio Zapata, Omar K. Pineda +2
Criticality has been proposed as a mechanism for the emergence of complexity, life, and computation, as it exhibits a balance between robustness and adaptability. In classic models…
Effectus of Quantum Probability on Relational Structures
Octavio Zapata
The notion of effectus from categorical logic is relevant in the emerging field of categorical probability theory. In some cases, stochastic maps are represented by maps in the Kle…
The Quantum Monad on Relational Structures
Samson Abramsky, Rui Soares Barbosa, Nadish de Silva +1
Homomorphisms between relational structures play a central role in finite model theory, constraint satisfaction and database theory. A central theme in quantum computation is to sh…
Descriptive complexity of graph spectra
Anuj Dawar, Simone Severini, Octavio Zapata
Two graphs are co-spectral if their respective adjacency matrices have the same multi-set of eigenvalues. A graph is said to be determined by its spectrum if all graphs that are co…