arXiv subjects

Cory Glover

Publications and source records attributed to Cory Glover.

6 recordsLinked to original sources

arXiv2026

Design Principles for Reproducible Networks

From protein complexes to electronic circuits, many natural and engineered systems function only if assembled in an exact, reproducible fashion. The structure of each of these systems can be understood as a network, yet network science lacks the mechanisms to consistently reproduce exact topologies, focusing instead on generating network ensembles. We introduce the framework of network design where we encode the local constraints obeyed by a system's building blocks in a design set, and derive the Unigraphical Design Theorem, which determines when these constraints guarantee reproducible assembly into a unique structure, a process we call unigraphical assembly. For systems whose design sets do not specify a unique outcome, we identify guided assembly as a second route to reproducibility, in which temporal ordering decomposes construction into unigraphical steps. Applying these results to 3,618 reproducible systems, including protein complexes, molecules, and robots, we classify those that undergo unigraphical assembly and those that require guided assembly. We further identify a diversity-redundancy boundary that explains how systems trade component variety for structurally interchangeable parts while retaining unique assembly. Finally, we experimentally test the theory using 3D-printed components to re-engineer generative construction sets into systems that assemble unigraphically into prescribed topologies. Network design thus reframes reproducibility as a mathematically testable property of real networks, opening a route to the rational engineering of complex systems.

cond-mat.dis-nn↗

arXiv2024

Measuring Entanglement in Physical Networks

The links of a physical network cannot cross, which often forces the network layout into non-optimal entangled states. Here we define a network fabric as a two-dimensional projection of a network and propose the average crossing number as a measure of network entanglement. We analytically derive the dependence of the crossing number on network density, average link length, degree heterogeneity, and community structure and show that the predictions accurately estimate the entanglement of both network models and of real physical networks.

cond-mat.dis-nn↗

arXiv2022

Effects of Backtracking on PageRank

In this paper, we consider three variations on standard PageRank: Non-backtracking PageRank, $\mu$-PageRank, and $\infty$-PageRank, all of which alter the standard formula by adjusting the likelihood of backtracking in the algorithm's random walk. We show that in the case of regular and bipartite biregular graphs, standard PageRank and its variants are equivalent. We also compare each centrality measure and investigate their clustering capabilities.

cs.SI↗

arXiv2022

Kemeny's constant for non-backtracking random walks

Kemeny's constant for a connected graph $G$ is the expected time for a random walk to reach a randomly-chosen vertex $u$, regardless of the choice of the initial vertex. We extend the definition of Kemeny's constant to non-backtracking random walks and compare it to Kemeny's constant for simple random walks. We explore the relationship between these two parameters for several families of graphs and provide closed-form expressions for regular and biregular graphs. In nearly all cases, the non-backtracking variant yields the smaller Kemeny's constant.

math.CO↗

arXiv2020

Spectral properties of the non-backtracking matrix of a graph

We investigate the spectrum of the non-backtracking matrix of a graph. In particular, we show how to obtain eigenvectors of the non-backtracking matrix in terms of eigenvectors of a smaller matrix. Furthermore, we find an expression for the eigenvalues of the non-backtracking matrix in terms of eigenvalues of the adjacency matrix and use this to upper-bound the spectral radius of the non-backtracking matrix and to give a lower bound on the spectrum. We also investigate properties of a graph that can be determined by the spectrum. Specifically, we prove that the number of components, the number of degree 1 vertices, and whether or not the graph is bipartite are all determined by the spectrum of the non-backtracking matrix.

math.CO↗

arXiv2018

A Reidemeister type theorem for petal diagrams of knots

We study petal diagrams of knots, which provide a method of describing knots in terms of permutations in a symmetric group $S_{2n+1}$. We define two classes of moves on such permutations, called trivial petal additions and crossing exchanges, which do not change the isotopy class of the underlying knot. We prove that any two permutations which represent isotopic knots can be related by a sequence of these moves and their inverses.

math.GT↗