Search for: All records

Award ID contains: 2239565

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Abstract Graph Neural Networks (GNNs) are promising tools for predicting tissue dynamics, but choosing the right architecture remains difficult because experimental datasets are limited, noisy, and system-specific. We introduce a controlled in silico benchmark for comparing GNN architectures on a vertex-model task: predicting relaxed cell–cell interface lengths after a cell neighbor exchange. Because simulated data provide known ground truth, we can vary tissue geometry, mechanics, perturbation complexity, dataset size, and input features independently. Provably Powerful Graph Networks (PPGN) and Principal Neighborhood Aggregation (PNA) were most sample-efficient when pre-event edge lengths were provided, whereas performance dropped sharply with topology alone. We also revealed a predict-or-copy strategy, whereby predictions far from the exchange copied pre-event lengths instead of predicting long-range changes. Prediction was harder in disordered tissues, suggesting hexagonality as a simple indicator of difficulty. These results provide a reproducible testbed for diagnosing feature dependence, copying behavior, and geometric consistency in tissue-remodeling prediction. 
    more » « less
    Free, publicly-accessible full text available August 13, 2027
  2. Free, publicly-accessible full text available September 29, 2027
  3. Free, publicly-accessible full text available May 31, 2027
  4. Free, publicly-accessible full text available May 31, 2027
  5. Free, publicly-accessible full text available May 31, 2027
  6. Free, publicly-accessible full text available May 31, 2027
  7. Free, publicly-accessible full text available April 30, 2027
  8. Free, publicly-accessible full text available April 30, 2027
  9. Magnetic graphs, originally developed to model quantum systems under magnetic fields, have recently emerged as a powerful framework for analyzing complex directed networks. Existing research has primarily used the spectral properties of the magnetic graph matrix to study global and stationary network features. However, their capacity to model local, nonequilibrium behaviors, often described by matrix powers, remains largely unexplored. We present a combinatorial interpretation of the magnetic graph matrix powers through directed walk profiles—counts of graph walks indexed by the number of edge reversals. Crucially, we establish that walk profiles correspond to a Fourier transform of magnetic matrix powers. The connection allows exact reconstruction of walk profiles from magnetic matrix powers at multiple discrete potentials, and more importantly, an even smaller number of potentials often suffices for accurate approximate reconstruction in real networks. This shows the empirical compressibility of the information captured by the magnetic matrix. This fresh perspective suggests further applications; for example, we illustrate how powers of the magnetic matrix can identify frustrated directed cycles (e.g., feedforward loops) and can be effectively employed for link prediction by encoding local structural details in directed graphs. 
    more » « less
    Free, publicly-accessible full text available March 24, 2027
  10. Free, publicly-accessible full text available January 1, 2027