\begin{thebibliography}{10}

\bibitem{j_hale_compliance_nodate}
{J. Hale}, P.~Hawrylak, and M.~Papa, ``Compliance {Method} for a
  {Cyber}-{Physical} {System}.''
\newblock U.S. Patent Number 9,471,789, Oct. 18, 2016.

\bibitem{baloyi_guidelines_2019}
N.~Baloyi and P.~Kotzé, ``Guidelines for {Data} {Privacy} {Compliance}: {A}
  {Focus} on {Cyberphysical} {Systems} and {Internet} of {Things},'' in {\em
  {SAICSIT} '19: {Proceedings} of the {South} {African} {Institute} of
  {Computer} {Scientists} and {Information} {Technologists} 2019}, (Skukuza
  South Africa), Association for Computing Machinery, 2019.

\bibitem{allman_complying_2006}
E.~Allman, ``Complying with {Compliance}: {Blowing} it off is not an option.,''
  {\em ACM Queue}, vol.~4, no.~7, 2006.

\bibitem{Jha2002TwoFA}
S.~Jha, O.~Sheyner, and J.~M. Wing, ``Two formal analyses of attack graphs,''
  {\em Proceedings 15th IEEE Computer Security Foundations Workshop. CSFW-15},
  pp.~49--63, 2002.

\bibitem{10.1016/j.comcom.2006.06.01837}
L.~Wang, S.~Noel, and S.~Jajodia, ``Minimum-cost network hardening using attack
  graphs,'' {\em Computer Communications}, vol.~29, pp.~3812--3824, nov 2006.

\bibitem{Islam2008AHA36}
T.~Islam and L.~Wang, ``A heuristic approach to minimum-cost network hardening
  using attack graph,'' {\em 2008 New Technologies, Mobility and Security},
  pp.~1--5, 2008.

\bibitem{10.1109/IAS.2008.38}
F.~Chen, L.~Wang, and J.~Su, ``An efficient approach to minimum-cost network
  hardening using attack graphs,'' in {\em Proceedings of the 2008 The Fourth
  International Conference on Information Assurance and Security}, IAS '08,
  (USA), pp.~209--212, IEEE Computer Society, 2008.

\bibitem{GCAI-2018:Analysis_of_Attack_Graph}
T.~Gonda, T.~Pascal, R.~Puzis, G.~Shani, and B.~Shapira, ``Analysis of attack
  graph representations for ranking vulnerability fixes,'' in {\em GCAI-2018.
  4th Global Conference on Artificial Intelligence} (D.~Lee, A.~Steen, and
  T.~Walsh, eds.), vol.~55 of {\em EPiC Series in Computing}, pp.~215--228,
  EasyChair, 2018.

\bibitem{ming_diss}
M.~Li, P.~Hawrylak, and J.~Hale, {\em A System for Attack Graph Generation and
  Analysis}.
\newblock {PhD} dissertation, The University of Tulsa, Tulsa, OK, 2021.

\bibitem{10.1145/3491257}
M.~Li, P.~Hawrylak, and J.~Hale, ``Strategies for practical hybrid attack graph
  generation and analysis,'' {\em Digital Threats}, Oct 2021.

\bibitem{Guo2017HermitianAM}
K.~Guo and B.~Mohar, ``{Hermitian Adjacency Matrix of Digraphs and Mixed
  Graphs},'' {\em Journal of Graph Theory}, vol.~85, 2017.

\bibitem{Mieghem2018DirectedGA}
P.~V. Mieghem, ``Directed graphs and mysterious complex eigenvalues,'' 2018.
\newblock {Delft University of Technology.}

\bibitem{Brualdi2010SpectraOD}
R.~A. Brualdi, ``{Spectra of Digraphs},'' {\em Linear Algebra and Its
  Applications}, vol.~432, pp.~2181--2213, 2010.

\bibitem{PMID:30064421}
M.~Ashtiani, A.~Salehzadeh-Yazdi, Z.~Razaghi-Moghadam, H.~Hennig,
  O.~Wolkenhauer, M.~Mirzaie, and M.~Jafari, ``A systematic survey of
  centrality measures for protein-protein interaction networks,'' {\em {BMC
  Systems Biology}}, vol.~12, p.~80, July 2018.

\bibitem{newman2010networks}
M.~Newman, {\em Networks: An Introduction}.
\newblock Oxford University Press, 2010.

\bibitem{Graphviz}
T.~G. Authors, {\em {Graphviz}: Graph Visualization}, 2023.
\newblock Graphviz release 8.1.0 [Online]. Available:https://www.graphviz.org/.

\bibitem{igraph}
G.~Csárdi, T.~Nepusz, V.~Traag, S.~Horvát, F.~Zanini, D.~Noom, and
  K.~Müller, {\em {Igraph}: Network Analysis and Visualization in R}, 2023.
\newblock R package version 1.5.1.

\bibitem{brandes}
U.~Brandes, ``A faster algorithm for betweenness centrality*,'' {\em The
  Journal of Mathematical Sociology}, vol.~25, no.~2, pp.~163--177, 2001.

\bibitem{Katz}
L.~Katz, ``{A New Status Index Derived From Sociometric Analysis},'' {\em
  Psychometrika}, vol.~18, pp.~39--43, March 1953.

\bibitem{ModKatz}
M.~Ogura and V.~M. Preciado, ``Katz centrality of markovian temporal networks:
  Analysis and optimization,'' {\em 2017 American Control Conference (ACC)},
  pp.~5001--5006, 2017.

\bibitem{laug}
E.~Anderson, Z.~Bai, C.~Bischof, S.~Blackford, J.~Demmel, J.~Dongarra,
  J.~Du~Croz, A.~Greenbaum, S.~Hammarling, A.~McKenney, and D.~Sorensen, {\em
  {LAPACK} Users' Guide}.
\newblock Philadelphia, PA: Society for Industrial and Applied Mathematics,
  3rd~ed., 1999.

\bibitem{stankovic2023fourier}
L.~Stankovic, M.~Dakovic, A.~B. Bardi, M.~Brajovic, and I.~Stankovic, ``Fourier
  analysis of signals on directed acyclic graphs (dag) using graph
  zero-padding,'' 2023.
\newblock arXiv:2311.01073.

\bibitem{seifert2023causal}
B.~Seifert, C.~Wendler, and M.~Püschel, ``Causal fourier analysis on directed
  acyclic graphs and posets,'' 2023.
\newblock arXiv:2209.07970.

\bibitem{MACEDO2016999}
H.~D. Macedo, ``Gaussian elimination is not optimal, revisited,'' {\em Journal
  of Logical and Algebraic Methods in Programming}, vol.~85, no.~5, Part 2,
  pp.~999--1010, 2016.

\bibitem{williams2023new}
V.~V. Williams, Y.~Xu, Z.~Xu, and R.~Zhou, ``New bounds for matrix
  multiplication: From alpha to omega,'' 2023.

\bibitem{alman2020refined}
J.~Alman and V.~V. Williams, ``A refined laser method and faster matrix
  multiplication,'' 2020.

\bibitem{PageRank}
S.~Brin and L.~Page, ``The anatomy of a large-scale hypertextual web search
  engine,'' {\em Computer Networks and ISDN Systems}, vol.~30, no.~1,
  pp.~107--117, 1998.
\newblock Proceedings of the Seventh International World Wide Web Conference.

\bibitem{Adapted_PageRank}
T.~Agryzkov, J.~L. Oliver, L.~Tortosa, and J.-F. Vicent, ``An algorithm for
  ranking the nodes of an urban network based on the concept of pagerank
  vector,'' {\em Appl. Math. Comput.}, vol.~219, pp.~2186--2193, 2012.

\bibitem{10.1371/journal.pone.0053095}
M.~Piraveenan, M.~Prokopenko, and L.~Hossain, ``Percolation centrality:
  Quantifying graph-theoretic impact of nodes during percolation in networks,''
  {\em Plos One}, vol.~8, pp.~1--14, 01 2013.

\bibitem{10.1145/3288599.3295597}
S.~De, M.~S. Barik, and I.~Banerjee, ``A percolation-based recovery mechanism
  for bot infected p2p cloud,'' in {\em Proceedings of the 20th International
  Conference on Distributed Computing and Networking}, ICDCN '19, (New York,
  NY, USA), pp.~474--479, Association for Computing Machinery, 2019.

\bibitem{9680376}
A.~Chandramouli, S.~Jana, and K.~Kothapalli, ``Efficient parallel algorithms
  for computing percolation centrality,'' in {\em 2021 IEEE 28th International
  Conference on High Performance Computing, Data, and Analytics (HiPC)},
  pp.~111--120, 2021.

\bibitem{NetworkX}
A.~Hagberg, P.~J. Swart, and D.~A. Schult, ``Exploring network structure,
  dynamics, and function using networkx,''
\newblock {Available: https://www.osti.gov/biblio/960616}.

\bibitem{reticulate}
K.~Ushey, J.~Allaire, and Y.~Tang, {\em Reticulate: Interface to 'Python'},
  2023.
\newblock {R package version 1.28. Available:
  https://CRAN.R-project.org/package=reticulate}.

\bibitem{AUDRITO2021102584}
G.~Audrito, D.~Pianini, F.~Damiani, and M.~Viroli, ``Aggregate centrality
  measures for iot-based coordination,'' {\em Science of Computer Programming},
  vol.~203, p.~102584, 2021.

\bibitem{LI2018512}
C.~Li, L.~Wang, S.~Sun, and C.~Xia, ``Identification of influential spreaders
  based on classified neighbors in real-world complex networks,'' {\em Applied
  Mathematics and Computation}, vol.~320, pp.~512--523, 2018.

\bibitem{MO2019121538}
H.~Mo and Y.~Deng, ``Identifying node importance based on evidence theory in
  complex networks,'' {\em Physica A: Statistical Mechanics and Its
  Applications}, vol.~529, p.~121538, 2019.

\bibitem{bordacent}
A.~Madotto and J.~Liu, ``Super-spreader identification using meta-centrality,''
  {\em Scientific Reports}, vol.~6, Dec. 2016.

\bibitem{6023c4f8-ecc1-3dbe-9f88-265b318523d2}
J.~G. Kemeny, ``Mathematics without numbers,'' {\em Daedalus}, vol.~88, no.~4,
  pp.~577--591, 1959.

\bibitem{doi:10.1137/0135023}
H.~P. Young and A.~Levenglick, ``A consistent extension of condorcet’s
  election principle,'' {\em SIAM Journal on Applied Mathematics}, vol.~35,
  no.~2, pp.~285--300, 1978.

\bibitem{li_combining_2019}
M.~Li, P.~Hawrylak, and J.~Hale, ``Combining {OpenCL} and {MPI} to support
  heterogeneous computing on a cluster,'' {\em ACM International Conference
  Proceeding Series}, 2019.

\bibitem{zeng_cyber_2017}
K.~Zeng, ``Cyber {Attack} {Analysis} {Based} on {Markov} {Process} {Model},''
  Master's thesis, The University of Tulsa, Tulsa, OK, 2017.

\bibitem{dominance}
R.~T. Prosser, ``Applications of boolean matrices to the analysis of flow
  diagrams,'' in {\em Papers Presented at the December 1-3, 1959, Eastern Joint
  IRE-AIEE-ACM Computer Conference}, IRE-AIEE-ACM '59 (Eastern), (New York, NY,
  USA), p.~133–138, Association for Computing Machinery, 1959.

\bibitem{PhysRevLett.87.198701}
V.~Latora and M.~Marchiori, ``Efficient behavior of small-world networks,''
  {\em Phys. Rev. Lett.}, vol.~87, p.~198701, Oct 2001.

\end{thebibliography}