From the 1 of 32 linked papers with an AI index.
32 papers
Spectral and Additive Combinatorial Methods for Cycles and Absorbing Sets in Lifted-Product Quantum LDPC Codes
Aida Abiad, Nichola Castriota
The paper develops spectral and additive combinatorial techniques to analyze short cycles and absorbing sets in lifted‑product quantum LDPC codes, providing closed‑form counts and…
Spectral Sparsification of Laplacian-Constrained Gaussian and Hüsler-Reiss Graphical Models
Ignacio Echave-Sustaeta RodrÃguez, Aida Abiad, Frank Röttger
Graph Laplacians encode graph structures in matrix form, and thus facilitate the application of linear algebra to graph theory. In statistics, two related families of probabilistic…
Wang-Qiu-Hu switching and isomorphism
Aida Abiad, Hong-Jun Ge
Cospectral graphs (graphs that share the same eigenvalues) expose the limitations of using the graph spectrum to uniquely identify graphs, and they also help to understand what str…
Spectral bounds for distance coloring and packing parameters of graphs via semidefinite programming
Aida Abiad, Yue Yang, Jiang Zhou
Using methods from spectral graph theory and semidefinite programming, we obtain sharp spectral bounds for several graph parameters related to distance colorings and packing, inclu…
Learning Gaussian Graphical Models under Total Positivity via Spectral Graph Sparsification
Ignacio Echave-Sustaeta RodrÃguez, Aida Abiad, Frank Röttger
Many practical data analysis tasks reduce to learning, from observed samples, how a collection of variables depend on each other. A widely used approach is to fit a Gaussian graphi…
An algebraic-combinatorial framework for finding the average hitting times in graphs with high regularity
Aida Abiad, Yusaku Nishimura
For any given vertices and in a graph, the hitting time of a random walk on a finite graph is the number of steps it takes for a random walk to reach vertex starting at…