This thesis presents an in-depth examination of the properties and efficient computation of Graph Diffusion Distance (GDD). This distance metric, defined for undirected graphs of unequal size, uses the eigenvalues of the graph Laplacian to quantify the difference in behavior between diffusion of heat running on the nodes of each graph. In Chapter 2, we defined a class of distance measures which use the eigenvalues of a graph Laplacian, and its matrix exponential, as a distinctive measurement of the properties of diffusion on the nodes of the graph. This family of related distance measures have several nice theoretical properties, which we examine in detail in Chapter 3. One specific nice property is that GDD and several of its variants are bounded above and below by expressions which depend on the eigenvalues of the two graphs (the spectral lower and upper bounds), making them possible to compute with real-valued (rather than combinatorial) optimization. However, these measures typically still require expensive matrix-valued optimizations to calculate. In Chapters 4 and 5 we present, and examine the numeric behavior of, a novel optimization algorithm which greatly reduces the number and size of matrix optimizations which need to be performed, resulting in a speedup of up to 1000x.
With this computational speedup, GDD can differentiate digits of MNIST, distinguish which of several 3D meshes a given graph is a discretization of, and be used to classify biological data (morphological graphs); we show some of these applications in Chapter 8. Furthermore, the matrix which is produced during the GDD calculation is useful as a prolongation/restriction operator to coarsen and refine computational graphs. An example of this latter application is the use of coarsening and refinement operators as part of a neural network architecture; these multiscale machine learning models are more accurate and more efficient than their single-level counterparts. In Chapters 6 and 7 we demonstrate the advantages of these machine learning approaches through a variety of numerical experiments. Specifically, matrices can be used to automatically coarsen the model architecture of a machine learning model. The resulting coarsened model learns more efficiently, and in the case of the experiments in Chapter 7 learns to emulate a dataset with lower error than a model operating only at one scale.
The graph Laplacian (along with its matrix exponential), is a fundamental object which captures structural information about a graph. This thesis presents a variety of methods for comparing such operators and accelerating machine learning models which are constructed around the graph Laplacian.
Abadi, Martín, Paul Barham, Jianmin Chen, Zhifeng Chen, Andy Davis, Jeffrey Dean, Matthieu Devin, et al. 2016. “TensorFlow: A System for Large-Scale Machine Learning.” In OSDI, 16:265–83.
Abu-El-Haija, Sami, Amol Kapoor, Bryan Perozzi, and Joonseok Lee. 2018. “N-GCN: Multi-Scale Graph Convolution for Semi-supervised Node Classification.”
Allgower, Eugene L, and Kurt Georg. 2012. Numerical Continuation Methods: An Introduction. Vol. 13. Springer Science & Business Media.
Anderson, E., Z. Bai, C. Bischof, S. Blackford, J. Demmel, J. Dongarra, J. Du Croz, et al. 1999. LAPACK Users’ Guide. Third. Philadelphia, PA: Society for Industrial; Applied Mathematics.
Andrew, Alan L, K-W Eric Chu, and Peter Lancaster. 1993. “Derivatives of Eigenvalues and Eigenvectors of Matrix Functions.” SIAM Journal on Matrix Analysis and Applications 14 (4). SIAM: 903–26.
Bacciu, Davide, Federico Errica, Alessio Micheli, and Marco Podda. 2019. “A Gentle Introduction to Deep Learning for Graphs.” arXiv Preprint arXiv:1912.12693.
Bacciu, Davide, Federico Errica, Alessio Micheli, and Marco Podda. 2020. “A Gentle Introduction to Deep Learning for Graphs.” Neural Networks. Elsevier.
Bakshi, Bhavik R, and George Stephanopoulos. 1993. “Wave-Net: A Multiresolution, Hierarchical Neural Network with Localized Learning.” AIChE Journal 39 (1). Wiley Online Library: 57–81.
Belkin, Mikhail, and Partha Niyogi. 2002. “Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering.” In Advances in Neural Information Processing Systems, 585–91.
Benjamini, Itai, and Oded Schramm. 2001. “Recurrence of Distributional Limits of Finite Planar Graphs.” Electron. J. Probab. 6. The Institute of Mathematical Statistics; the Bernoulli Society: 13 pp. https://doi.org/10.1214/EJP.v6-96.
Bentley, Jon Louis. 1975. “Multidimensional Binary Search Trees Used for Associative Searching.” Communications of the ACM 18 (9). ACM: 509–17.
Bijsterbosch, J, and A Volgenant. 2010. “Solving the Rectangular Assignment Problem and Applications.” Annals of Operations Research 181 (1). Springer: 443–62.
Bishop, Christopher M. 2006. Pattern Recognition and Machine Learning (Information Science and Statistics). Springer-Verlag New York, Inc.
Borgs, Christian, Jennifer Chayes, Henry Cohn, and Yufei Zhao. 2019. “An Theory of Sparse Graph Convergence I: Limits, Sparse Random Graph Models, and Power Law Distributions.” Transactions of the American Mathematical Society 372 (5): 3019–62.
Brouwer, Andries E, and Willem H Haemers. 2011. Spectra of Graphs. Springer Science & Business Media.
———. 2012. “Distance-Regular Graphs.” In Spectra of Graphs, 177–85. Springer.
Brouwer, Andries E, and Edward Spence. 2009. “Cospectral Graphs on 12 Vertices.” The Electronic Journal of Combinatorics 16 (1): N20.
Burkard, Rainer E, and Eranda Cela. 1999. “Linear Assignment Problems and Extensions.” In Handbook of Combinatorial Optimization, 75–149. Springer.
Burkard, Rainer E, Mauro Dell’Amico, and Silvano Martello. 2009. Assignment Problems. Springer.
Chakrabortty, Bandan, Ikram Blilou, Ben Scheres, and Bela M Mulder. 2018. “A Computational Framework for Cortical Microtubule Dynamics in Realistically Shaped Plant Cells.” PLoS Computational Biology 14 (2). Public Library of Science: e1005959.
Chen, Liqun, Zhe Gan, Yu Cheng, Linjie Li, Lawrence Carin, and Jingjing Liu. 2020. “Graph Optimal Transport for Cross-Domain Alignment.” In International Conference on Machine Learning, 1542–53. PMLR.
Clapper, Brian M. n.d. “Munkres Implementation for Python.” http://software.clapper.org/munkres/.
Cohen-Steiner, David, Weihao Kong, Christian Sohler, and Gregory Valiant. 2018. “Approximating the Spectrum of a Graph.” In Proceedings of the 24th Acm Sigkdd International Conference on Knowledge Discovery & Data Mining, 1263–71. ACM.
Cox, Michael AA, and Trevor F Cox. 2008. “Multidimensional Scaling.” In Handbook of Data Visualization, 315–47. Springer.
Croes, Georges A. 1958. “A Method for Solving Traveling-Salesman Problems.” Operations Research 6 (6). INFORMS: 791–812.
Cvetkovic, Dragos M, Peter Rowlinson, and Slobodan Simic. 2010. An Introduction to the Theory of Graph Spectra. Cambridge University Press Cambridge, UK.
Dodonova, Yulia, Mikhail Belyaev, Anna Tkachev, Dmitry Petrov, and Leonid Zhukov. 2016. “Kernel Classification of Connectomes Based on Earth Mover’s Distance Between Graph Spectra.” arXiv Preprint arXiv:1611.08812.
Donnat, Claire, and Susan Holmes. 2018. “Tracking Network Dynamics: A Survey of Distances and Similarity Metrics.” arXiv Preprint arXiv:1801.07351.
Dou, Haobin, and Xihong Wu. 2015. “Coarse-to-Fine Trained Multi-Scale Convolutional Neural Networks for Image Classification.” In 2015 International Joint Conference on Neural Networks (Ijcnn), 1–7. IEEE.
Dumais, Jacques. 2009. “Plant Morphogenesis: A Role for Mechanical Signals.” Current Biology 19 (5). Elsevier: R207–R208.
Eshera, MA, and King-Sun Fu. 1984. “A Graph Distance Measure for Image Analysis.” IEEE Transactions on Systems, Man, and Cybernetics SMC-14 (3). IEEE: 398–408.
———. 1986. “An Image Understanding System Using Attributed Symbolic Representation and Inexact Graph-Matching.” IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI-8 (5). IEEE: 604–18.
Falgout, Robert D, Stephanie Friedhoff, Tz V Kolev, Scott P MacLachlan, and Jacob B Schroder. 2014. “Parallel Time Integration with Multigrid.” SIAM Journal on Scientific Computing 36 (6). SIAM: C635–C661.
Fiedler, Miroslav. 1973. “Algebraic Connectivity of Graphs.” Czechoslovak Mathematical Journal 23 (2). Institute of Mathematics, Academy of Sciences of the Czech Republic: 298–305.
Fredman, Michael L, and Robert Endre Tarjan. 1987. “Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms.” Journal of the ACM (JACM) 34 (3). ACM: 596–615.
Fukushima, Kunihiko, and Sei Miyake. 1982. “Neocognitron: A Self-Organizing Neural Network Model for a Mechanism of Visual Pattern Recognition.” In Competition and Cooperation in Neural Nets, 267–85. Springer.
Gao, Xinbo, Bing Xiao, Dacheng Tao, and Xuelong Li. 2010. “A Survey of Graph Edit Distance.” Pattern Analysis and Applications 13 (1). Springer: 113–29.
Gardner, Melissa K, Alan J Hunt, Holly V Goodson, and David J Odde. 2008. “Microtubule Assembly Dynamics: New Insights at the Nanoscale.” Current Opinion in Cell Biology 20 (1). Elsevier: 64–70.
Gardner, Melissa K, Marija Zanic, and Jonathon Howard. 2013. “Microtubule Catastrophe and Rescue.” Current Opinion in Cell Biology 25 (1). Elsevier: 14–22.
Godsil, Chris D, and BD McKay. 1982. “Constructing Cospectral Graphs.” Aequationes Mathematicae 25 (1). Springer: 257–68.
Gold, Steven, Chien-Ping Lu, Anand Rangarajan, Suguna Pappu, and Eric Mjolsness. 1995. “New Algorithms for 2D and 3D Point Matching: Pose Estimation and Correspondence.” In Advances in Neural Information Processing Systems, 957–64.
Gold, Steven, Anand Rangarajan, and Eric Mjolsness. 1995. “Learning with Preknowledge: Clustering with Point and Graph Matching Distance Measures.” In Advances in Neural Information Processing Systems, 713–20.
Grais, Emad M, Hagen Wierstorf, Dominic Ward, and Mark D Plumbley. 2017. “Multi-Resolution Fully Convolutional Neural Networks for Monaural Audio Source Separation.” arXiv Preprint arXiv:1710.11473.
Gu, Jiao, Bobo Hua, and Shiping Liu. 2015. “Spectral Distances on Graphs.” Discrete Applied Mathematics 190. Elsevier: 56–74.
Haber, Eldad, Lars Ruthotto, Elliot Holtham, and Seong-Hwan Jun. 2018. “Learning Across Scales - Multiscale Methods for Convolution Neural Networks.” In Thirty-Second Aaai Conference on Artificial Intelligence.
Hadsell, Raia, Sumit Chopra, and Yann LeCun. 2006. “Dimensionality Reduction by Learning an Invariant Mapping.” In 2006 Ieee Computer Society Conference on Computer Vision and Pattern Recognition (Cvpr’06), 2:1735–42. IEEE.
Hagberg, Aric, Pieter Swart, and Daniel S Chult. 2008. “Exploring Network Structure, Dynamics, and Function Using NetworkX.” Los Alamos National Lab.(LANL), Los Alamos, NM (United States).
Hammond, David K, Yaniv Gur, and Chris R Johnson. 2013. “Graph Diffusion Distance: A Difference Measure for Weighted Graphs Based on the Graph Laplacian Exponential Kernel.” In 2013 Ieee Global Conference on Signal and Information Processing, 419–22. IEEE.
Hartle, Harrison, Brennan Klein, Stefan McCabe, Alexander Daniels, Guillaume St-Onge, Charles Murphy, and Laurent Hébert-Dufresne. 2020. “Network Comparison and the Within-Ensemble Graph Distance.” Proceedings of the Royal Society A 476 (2243). The Royal Society Publishing: 20190744.
Heindl, Christoph. 2018. “lapsolver: Fast Linear Assignment Problem (LAP) Solvers for Python Based on c-extensions.” https://github.com/cheind/py-lapsolver.
Hinton, Geoffrey, Nitish Srivastava, and Kevin Swersky. n.d. “Neural Networks for Machine Learning Lecture 6a Overview of Mini-Batch Gradient Descent.”
Hogben, Leslie. 2006. Handbook of Linear Algebra. CRC Press.
Inc., Wolfram Research, n.d. “Mathematica, Version 11.3.”
Jewett, Andrew I, Zhuoyun Zhuang, and Joan-Emma Shea. 2013. “Moltemplate: A Coarse-Grained Model Assembly Tool.” Biophysical Journal 104 (2). Elsevier: 169a.
Johnson, Todd, Tom Bartol, Terrence Sejnowski, and Eric Mjolsness. 2015. “Model Reduction for Stochastic Camkii Reaction Kinetics in Synapses by Graph-Constrained Correlation Dynamics.” Physical Biology 12 (4). IOP Publishing: 045005.
Jones, Eric, Travis Oliphant, Pearu Peterson, and others. n.d. “SciPy: Open Source Scientific Tools for Python.” http://www.scipy.org/.
Jones, Travis Oliphant, Pearu Peterson, and others. n.d. “SciPy: Open Source Scientific Tools for Python.” http://www.scipy.org/.
Kaul, Samir, Hean L Koo, Jennifer Jenkins, Michael Rizzo, Timothy Rooney, Luke J Tallon, Tamara Feldblyum, et al. 2000. “Analysis of the Genome Sequence of the Flowering Plant Arabidopsis Thaliana.” Nature 408 (6814). Nature Publishing Groups: 796–815.
Ke, Tsung-Wei, Michael Maire, and Stella X Yu. 2016. “Neural Multigrid.” arXiv Preprint arXiv:1611.07661.
———. 2017. “Multigrid Neural Architectures.” In Proceedings of the Ieee Conference on Computer Vision and Pattern Recognition, 6665–73.
Kikumoto, Mahito, Masashi Kurachi, Valer Tosa, and Hideo Tashiro. 2006. “Flexural Rigidity of Individual Microtubules Measured by a Buckling Force with Optical Traps.” Biophysical Journal 90 (5). Elsevier: 1687–96.
Kingma, Diederik P, and Jimmy Ba. 2014. “Adam: A Method for Stochastic Optimization.” arXiv Preprint arXiv:1412.6980.
Kipf, Thomas N, and Max Welling. 2016. “Semi-Supervised Classification with Graph Convolutional Networks.” arXiv Preprint arXiv:1609.02907.
Kis, A, S Kasas, B Babić, AJ Kulik, W Benoit, GAD Briggs, C Schönenberger, S Catsicas, and L Forro. 2002. “Nanomechanics of Microtubules.” Physical Review Letters 89 (24). APS: 248101.
Laub, Alan J. 2005. Matrix Analysis for Scientists and Engineers. Vol. 91. SIAM.
LeCun, Yann, Léon Bottou, Yoshua Bengio, and Patrick Haffner. 1998. “Gradient-Based Learning Applied to Document Recognition.” Proceedings of the IEEE 86 (11). IEEE: 2278–2324.
LeCun, Yann, Corinna Cortes, and CJ Burges. 2010. “MNIST Handwritten Digit Database.” AT&T Labs [Online]. Available: Http://Yann.lecun.com/Exdb/Mnist 2.
Liao, Renjie, Zhizhen Zhao, Raquel Urtasun, and Richard S Zemel. 2019. “LanczosNet: Multi-Scale Deep Graph Convolutional Networks.” arXiv Preprint arXiv:1901.01484.
Lovász, László. 2012. Large Networks and Graph Limits. Vol. 60. American Mathematical Soc.
Maretic, Hermina Petric, Mireille El Gheche, Giovanni Chierchia, and Pascal Frossard. 2019. “GOT: An Optimal Transport Framework for Graph Comparison.” In Advances in Neural Information Processing Systems, 13876–87.
Margolin, Gennady, Ivan V Gregoretti, Trevor M Cickovski, Chunlei Li, Wei Shi, Mark S Alber, and Holly V Goodson. 2012. “The Mechanisms of Microtubule Catastrophe and Rescue: Implications from Analysis of a Dimer-Scale Computational Model.” Molecular Biology of the Cell 23 (4). Am Soc Cell Biol: 642–56.
McGregor, Andrew, and Daniel Stubbs. 2013. “Sketching Earth-Mover Distance on Graph Metrics.” In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 274–86. Springer.
Molodtsov, Maxim I, Elena A Ermakova, Emmanuil E Shnol, Ekaterina L Grishchuk, J Richard McIntosh, and Fazly I Ataullakhanov. 2005. “A Molecular-Mechanical Model of the Microtubule.” Biophysical Journal 88 (5). Elsevier: 3167–79.
Morvan, Jean-Marie, and Boris Thibert. 2002. “On the Approximation of a Smooth Surface with a Triangulated Mesh.” Computational Geometry 23 (3). Elsevier: 337–52.
Munkres, James. 1957. “Algorithms for the Assignment and Transportation Problems.” Journal of the Society for Industrial and Applied Mathematics 5 (1). SIAM: 32–38.
Nelder, John A, and Roger Mead. 1965. “A Simplex Method for Function Minimization.” The Computer Journal 7 (4). Oxford University Press: 308–13.
Nelson, Richard B. 1976. “Simplified Calculation of Eigenvector Derivatives.” AIAA Journal 14 (9): 1201–5.
Onoyama, Takashi, Sen Kubota, Kazuko Oyanagi, and Setsuo Tsuruta. 2000. “A Method for Solving Nested Combinatorial Optimization Problems-a Case of Optimizing a Large-Scale Distribution Network.” In SMC 2000 Conference Proceedings. 2000 IEEE International Conference on Systems, Man and Cybernetics. ’Cybernetics Evolving to Systems, Humans, Organizations, and Their Complex Interactions’ (Cat. No. 0, 1:340–45. IEEE.
Pampaloni, Francesco, and Ernst-Ludwig Florin. 2008. “Microtubule Architecture: Inspiration for Novel Carbon Nanotube-Based Biomimetic Materials.” Trends in Biotechnology 26 (6). Elsevier: 302–10.
Pan, Victor Y, and Zhao Q Chen. 1999. “The Complexity of the Matrix Eigenproblem.” In Proceedings of the Thirty-First Annual Acm Symposium on Theory of Computing, 507–16. ACM.
Paszke, Adam, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, et al. 2019. “Pytorch: An Imperative Style, High-Performance Deep Learning Library.” arXiv Preprint arXiv:1912.01703.
Patney, Anjul, Mohamed S Ebeida, and John D Owens. 2009. “Parallel View-Dependent Tessellation of Catmull-Clark Subdivision Surfaces.” In Proceedings of the Conference on High Performance Graphics 2009, 99–108.
Pedregosa, Fabian, Gaël Varoquaux, Alexandre Gramfort, Vincent Michel, Bertrand Thirion, Olivier Grisel, Mathieu Blondel, et al. 2011. “Scikit-Learn: Machine Learning in Python.” The Journal of Machine Learning Research 12. JMLR. org: 2825–30.
Plimpton, Steve. 1993. “Fast Parallel Algorithms For Short-Range Molecular Dynamics.” Sandia National Labs., Albuquerque, NM (United States).
Rangarajan, Anand, Steven Gold, and Eric Mjolsness. 1996. “A Novel Optimizing Network Architecture with Applications.” Neural Computation 8 (5). MIT Press: 1041–60.
Rapcsák, Tamás. 2002. “On Minimization on Stiefel Manifolds.” European Journal of Operational Research 143 (2). Elsevier: 365–76.
Raw, Michael. 1996. “Robustness of Coupled Algebraic Multigrid for the Navier-Stokes Equations.” In 34th Aerospace Sciences Meeting and Exhibit, 297.
Ronneberger, Olaf, Philipp Fischer, and Thomas Brox. 2015. “U-Net: Convolutional Networks for Biomedical Image Segmentation.” In International Conference on Medical Image Computing and Computer-Assisted Intervention, 234–41. Springer.
Rossum, Guido. 1995. “Python Reference Manual.” Technical Report. CWI (Centre for Mathematics; Computer Science).
Sanfeliu, Alberto, and King-Sun Fu. 1983. “A Distance Measure Between Attributed Relational Graphs for Pattern Recognition.” IEEE Transactions on Systems, Man, and Cybernetics SMC-13 (3). IEEE: 353–62.
Schaefer, Estelle, Katia Belcram, Magalie Uyttewaal, Yann Duroc, Magali Goussot, David Legland, Elise Laruelle, Marie-Ludivine de Tauzia-Moreau, Martine Pastuglia, and David Bouchez. 2017. “The Preprophase Band of Microtubules Controls the Robustness of Division Orientation in Plants.” Science 356 (6334). American Association for the Advancement of Science: 186–89.
Schneider, T, and E Stoll. 1978. “Molecular-Dynamics Study of a Three-Dimensional One-Component Model for Distortive Phase Transitions.” Physical Review B 17 (3). APS: 1302.
Schroder, Jacob B. 2017. “Parallelizing Over Artificial Neural Network Training Runs with Multigrid.” arXiv Preprint arXiv:1708.02276.
Scott, C. B., and Eric Mjolsness. 2019. “Novel Diffusion-Derived Distance Measures for Graphs.”
Scott, CB, and Eric Mjolsness. 2019. “Multilevel Artificial Neural Network Training for Spatially Correlated Learning.” SIAM Journal on Scientific Computing 41 (5). SIAM: S297–S320.
———. 2021. “Graph Diffusion Distance: Properties and Efficient Computation.” Plos One 16 (4). Public Library of Science San Francisco, CA USA: e0249624.
Scott, Cory B. 2021. “DiffusionDistance: Efficient Calculation of Graph Diffusion Distance in Python.” https://github.com/scottcb/DiffusionDistance.
Serban, Iulian Vlad, Tim Klinger, Gerald Tesauro, Kartik Talamadupula, Bowen Zhou, Yoshua Bengio, and Aaron C Courville. 2017. “Multiresolution Recurrent Neural Networks: An Application to Dialogue Response Generation.” In AAAI, 3288–94.
Shamir, Ariel. 2008. “A Survey on Mesh Segmentation Techniques.” In Computer Graphics Forum, 27:1539–56. 6. Wiley Online Library.
Shaw, Sidney L, Roheena Kamyar, and David W Ehrhardt. 2003. “Sustained Microtubule Treadmilling in Arabidopsis Cortical Arrays.” Science 300 (5626). American Association for the Advancement of Science: 1715–8.
Sinha, Ankur, Pekka Malo, and Kalyanmoy Deb. 2018. “A Review on Bilevel Optimization: From Classical to Evolutionary Approaches and Applications.” IEEE Transactions on Evolutionary Computation 22 (2). IEEE: 276–95.
Stewman, Shannon F, and Ao Ma. 2018. “A Structural Mechano-Chemical Model for Dynamic Instability of Microtubule.” bioRxiv. Cold Spring Harbor Laboratory, 291682.
Stukowski, Alexander. n.d. “Visualization and Analysis of Atomistic Simulation Data with OVITO - the Open Visualization Tool.” Modelling Simulation in Materials Science and Engineering 18 (1). https://doi.org/{10.1088/0965-0393/18/1/015012}.
Stüben, Klaus. 2001. “A Review of Algebraic Multigrid.” In Numerical Analysis: Historical Developments in the 20th Century, 331–59. Elsevier.
Takasone, Toru, Saulius Juodkazis, Yuji Kawagishi, Akira Yamaguchi, Shigeki Matsuo, Hitoshi Sakakibara, Haruto Nakayama, and Hiroaki Misawa. 2002. “Flexural Rigidity of a Single Microtubule.” Japanese Journal of Applied Physics 41 (5R). IOP Publishing: 3015.
Tange, O. 2011. “GNU Parallel - The Command-Line Power Tool.”;Login: The USENIX Magazine 36 (1). Frederiksberg, Denmark: 42–47. https://doi.org/http://dx.doi.org/10.5281/zenodo.16303.
Tindemans, Simon H, Eva E Deinum, Jelmer J Lindeboom, and Bela Mulder. 2014. “Efficient Event-Driven Simulations Shed New Light on Microtubule Organization in the Plant Cortical Array.” Frontiers in Physics 2. Frontiers: 19.
Townsend, James, Niklas Koep, and Sebastian Weichwald. 2016. “Pymanopt: A Python Toolbox for Optimization on Manifolds Using Automatic Differentiation.” arXiv Preprint arXiv:1603.03236.
Turaga, Pavan, Ashok Veeraraghavan, and Rama Chellappa. 2008. “Statistical Analysis on Stiefel and Grassmann Manifolds with Applications in Computer Vision.” In Computer Vision and Pattern Recognition, 2008. CVPR 2008. IEEE Conference on, 1–8. IEEE.
VanBuren, Vincent, Lynne Cassimeris, and David J Odde. 2005. “Mechanochemical Model of Microtubule Structure and Self-Assembly Kinetics.” Biophysical Journal 89 (5). Elsevier: 2911–26.
Van Dam, Edwin R, and Willem H Haemers. 2003. “Which Graphs Are Determined by Their Spectrum?” Linear Algebra and Its Applications 373. Elsevier: 241–72.
———. 2009. “Developments on Spectral Characterizations of Graphs.” Discrete Mathematics 309 (3). Elsevier: 576–86.
Van Der Walt, Stefan, S Chris Colbert, and Gael Varoquaux. 2011. “The NumPy Array: A Structure for Efficient Numerical Computation.” Computing in Science & Engineering 13 (2). IEEE Computer Society: 22.
Vaněk, Petr, Jan Mandel, and Marian Brezina. 1996. “Algebraic Multigrid by Smoothed Aggregation for Second and Fourth Order Elliptic Problems.” Computing 56 (3). Springer: 179–96.
Verlet, Loup. 1967. “Computer “Experiments" on Classical Fluids. I. Thermodynamical Properties of Lennard-Jones Molecules.” Physical Review 159 (1). APS: 98.
Wang, Hong-Wei, and Eva Nogales. 2005. “Nucleotide-Dependent Bending Flexibility of Tubulin Regulates Microtubule Assembly.” Nature 435 (7044). Nature Publishing Group: 911–15.
Wen, Zaiwen, and Wotao Yin. 2013. “A Feasible Method for Optimization with Orthogonality Constraints.” Mathematical Programming 142 (1-2). Springer: 397–434.
Wesseling, Pieter, and Cornelis W Oosterlee. 2001. “Geometric Multigrid with Applications to Computational Fluid Dynamics.” Journal of Computational and Applied Mathematics 128 (1-2). Elsevier: 311–34.
Ying, Zhitao, Jiaxuan You, Christopher Morris, Xiang Ren, Will Hamilton, and Jure Leskovec. 2018. “Hierarchical Graph Representation Learning with Differentiable Pooling.” In Advances in Neural Information Processing Systems, 4800–4810.
Zhang, Tong, Wenming Zheng, Zhen Cui, and Yang Li. 2018. “Tensor Graph Convolutional Neural Network.” arXiv Preprint arXiv:1803.10071.
Zhao, Jie, Lei Dai, Mo Zhang, Fei Yu, Meng Li, Hongfeng Li, Wenjia Wang, and Li Zhang. 2019. “PGU-net+: Progressive Growing of U-net+ for Automated Cervical Nuclei Segmentation.” Lecture Notes in Computer Science, December. Springer International Publishing, 51–58.