Dynamical implications of network statistics
2014-08
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Dynamical implications of network statistics
Authors
Published Date
2014-08
Publisher
Type
Thesis or Dissertation
Abstract
Dynamics on large networks can be highly complex. I present several methods for investigating the effects of network structure/statistics on rate dynamics and spike correlations. The dynamical models under consideration come from computational neuroscience, but these methods may generalize to other contexts. The thesis focuses on both network constructions and dynamics on networks.I present two approaches to network constructions: random networks, and networks with patterns. For random networks, I give a generalization of the expected degree model (EDM) and a formulation of the EDM and its generalization which is invariant of the number of nodes. This generalization allows one to produce random networks which have nontrivial second and third order correlations among edges. I also introduce a method for constructing networks with nontrivial structures/patterns at multiple scales. I investigate the spectral properties of the resulting networks and extend the method to include stochastic elements.The singular value decomposition (SVD) is a powerful tool with many applications. I review its application to network adjacency matrices, including a known result which relates the singular values of an adjacency matrix to a measure of its randomness. Further, I demonstrate that for several random network models the degree sequence is the most significant feature of the connectivity.The primary dynamical model I consider is the Poisson spiking model (PSM). I derive first and second order statistics for the PSM using a path integral formalism.The major contribution of this work is a dimension reduction method for dynamics on a network using the SVD. I demonstrate how one can use these low rank representations of the connectivity, together with the reduced equations to approximately recover node-specific activity. Thus, not only do I present methods that reduce the number of dynamical variables, but I show how the dynamics of the full system may be decomposed into the reduced variables and network structure.
Description
University of Minnesota Ph.D dissertation. August 2014. Major: Mathematics. Advisor: Duane Q. Nykam. 1 computer file (PDF); vii, 145 pages, appendices A-B.
Related to
Replaces
License
Collections
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Campbell, Patrick Ronald. (2014). Dynamical implications of network statistics. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/166958.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.