The geometry of spontaneous spiking in neuronal networks
|
|
- Basil Fisher
- 5 years ago
- Views:
Transcription
1 The geometry of spontaneous spiking in neuronal networks Georgi Medvedev Drexel University Mathemacs Colloquium Rensselaer Polytechnic Instute March 4, 203 Work par=ally supported by NSF through grant DMS 09367
2 Network dynamics = local dynamics+coupling 7/3/3 2
3 LaNce Dynamical Systems u t = Δu + Fu ' u i, j = γ u i, j + u i+, j + u i, j + u i, j+ 4u i, j + Fu i, j γ = h 2 Coupled map lances Kaneko 80 s 7/3/3 3
4 The Adjacency Matrix Adjacency matrix A =! # # # # " $ & & & & % 7/3/3 4
5 The pixel picture y x Lovasz, Large networks and graph limits, 203 5
6 The Kuramoto model φ i t = ω + n i+k j=i k sin φ j φ i, i [n] cf. Kuramoto, ω = 0, φ i+ φ i = const q- twisted states: φ i = qi + j mod n, q, j Z Wiley, Strogatz, Girvan 2006, Girnyk, Hasler, Maistrenko 202 7/3/3 6
7 The con=nuum limit φ i t = ω + n i+k j=i k sin φ j φ i, i [n] t φ x,t = ω + W x, ysin φy,t φx,t dy Wiley, Strogatz, Girvan 2006, Girnyk, Hasler, Maistrenko 202, Grinshpan, Kaliuzhnyi- Verbovetski, Medvedev 203 7/3/3 7
8 Chimera states t φ x,t = ω + Gx ysin φy,t φx,t+α dy Gx = exp{ κ x } Kuramoto, Babogtokh 2002, Abrams, Strogatz /3/3 8
9 Power grids and consensus protocols Power system model Dorfler, Bullo SICON 202 M i φ i + Di φ i = ω i + a ij sin φ j φ i δ ij, i [n] j i Consensus protocol Medvedev, SICON 202 φ i = a ij t φ j φ i +ξ i t, i [n] j i 7/3/3 9
10 Ac=vity paberns in Locus Coeruleus neurons correlate with cogni=ve performance Usher et al, Science, 999; Brown et al, J. Comp. Neurosci., /3/3 0
11 The conductance- based model of the LC neuron G.S. Medvedev and S. Zhuravytska, J. Nonlinear Sci., 202 7/3/3
12 7/3/3 2 N i v n v n n w v v d g n v I Cv i i i i i i j N i ij i i ion i,2,...,,, = = + + = = τ σ The coupled network of LC neurons
13 Incorpora=ng connec=vity 7/3/ i i i i i v v g v v g v + + = +,...,,,... 2 N v v v V glv V = =
14 The graph Laplacian Images downloaded from simonsfounda=on.org/ ij Lv = b U = x i x j 2 = x T Lx cf. Erica Klarrich, Network solu=ons, simonsfounda=on.org/ 7/3/3 4
15 Algebraic graph theory: Define matrices associated with graphs. Understand graphs using methods of linear algebra and matrix analysis. Biggs, Algebraic graph theory Spectral graph theory: Relate structural proper=es of graphs to the eigenvalues of matrices associated with the graphs. Chung, Spectral graph theory 7/3/3 5
16 7/3/ L = D A = " # $ $ $ $ % & ' ' ' ' " # $ $ $ $ % & ' ' ' ' = " # $ $ $ $ % & ' ' ' ' = H Alterna=vely, using coboundary matrix, Graph Laplacian H H L T = Adjacency matrix A = ! " # # # # $ % & & & & Matrices
17 Eigenvalues of L = H T H = λ λ 2... λ n λ = 0, =,,, Algebraic connec=vity AC cf. Fiedler,973 λ 2 > 0 Large AC implies good connec=vity Example: λ 2 P n n 2 0, n 7/3/3 7
18 Random Walk on G X 0, X, X 2,..., X i,... The rate of convergence to the sta=onary distribu=on is determined by λ 2 Example: λ 2 P n n 2 0, n 7/3/3 8
19 Expanders are sparse well- connected graphs Hoory, Linial, Wigderson, Bull. Am. Math. Soc., 2006 {G n } : λ 2 G n α > 0 n Pinsker 973 Margulis 988 Lubotzky, Phillips, and Sarnak 988 Reingold, Vadhan, and Wigderson /3/3 9
20 Random graphs are good expanders Random d- regular graphs: P{λ 2 G n d 2 d ε} = o n ε > 0 Friedman, 2008 λ 2 G n d 2 d + o n The Alon- Boppana inequality 7/3/3 20
21 Effec=ve resistance R ij Image downloaded from simonsfounda=on.org/ Total effec=ve resistance RG = n n i= 2 λ i L RG = i< j R ij Gosh, Boyd, Saberi, Minimizing effec=ve resistance of a graph, SIAM Review, 2008
22 Weak coupling => the rate slows down Intermediate coupling => clusters and waves Strong coupling => synchroniza=on 7/3/3 22
23 The firing rate plot 7/3/3 23
24 The center manifold reduc=on The original system The reduced system z = z 2 + σ 2 w Rewrite as a gradient system, z = U 'z+ σ 2 w Uz = z 3 z3 7/3/3 24
25 The reduced coupled system! # # # # " z z 2... z n $! & # & # & = # # & # % " z 2 z z 2 n $ & & & γlz +σw & & % z = f z γ Lz +σ W, z R n 7/3/3 25
26 The energy z = Uz+ σ 2 W, z R n Uz = γ 2 zt Lz + Φz Excitable energy local Φz = N Fz i, Fξ = 2 3 +ξ 3 ξ 3 i= Energy of connec=ons global γ 2 zt Lz = γ 2 Hz, Hz 7/3/3 Image downloaded from simonsfounda=on.org/
27 The =me and loca=on of the first exit z = Uz+σ 2 w Large devia=on es=mates U * :=Uz * = min z D Uz A lim σ 0 P zτ z * < δ = B τ exp σ 2 U * Freidlin, Wentzell, Random Perturba=ons of Dynamical Systems 7/3/3 27
28 The exit problem for the coupled system z = Uz+ σ 2 W, z R n U * :=Uz * = min z D Uz A lim σ 0 P zτ z * < δ = Bτ exp σ 2 U * 7/3/3 28
29 The minimiza=on problem z = Uz+ σ 2 W U γ z min z D 7/3/3 29
30 The minimiza=on problem: weak coupling N γ 2 3 U z = Hz, Hz + F z, F ξ = + ξ ξ 2 i i= 3 3 Minima of Φ z: ξ 2 ξ 3 ξ =,, =,, =,, 7/3/3 30
31 The weak coupling regime Use the Implicit Func=on Theorem φ0 = n, d dγ φ i γ γ=0 = l i 7/3/3 3
32 The weak coupling regime => firing rate min U γ z D i = 4 3 +γ degv i +Oγ 2 # Eτ expσ 2 4 % $ 3 +γ volg & ' 7/3/3 32
33 For weak coupling the connec=vity is not important 7/3/3 33
34 Strong coupling => synchroniza=on Uz = γ 2 Hz, Hz + Φz Hz, Hz min ker H=span{,,..,} γ 2 λ 2 L n = span{,,...,} = minu γ z D 7/3/3 34
35 For strong coupling the connec=vity is important 7/3/3 35
36 Intermediate coupling => clusters 7/3/3 36
37 Transi=on to synchrony 7/3/3 37
38 The geometry of synchroniza=on z = f z γlz, z R n n n = span{,,...,} R n z = η,ζ R R n, η = n n T z, ξ= Hz 7/3/3 38
39 Slow- fast system ξ = γ 2 ˆLξ +σ H W +... n η = f η+ σ n w n Reduced matrix ˆL = HL H + R n n, ˆL > 0, λ ˆL = λ 2 L Medvedev, SICON 202 7/3/3 39
40 Fast subsystem: Synchroniza=on ξ = γ 2 ˆLξ +σ H W Expected value Covariance matrix mt = Eξt Vt = E[ξt mtξt mt T ] Synchronizability Stochas=c stability robustness to noise m = γ 2 ˆLm V = γ 2 ˆLV +V ˆL+σ 2 I n 7/3/3 40
41 Fast subsystem: Synchroniza=on Expected value Covariance matrix mt = Eξt Vt = E[ξt mtξt mt T ] Synchronizability Stochas=c stability mt = m0exp{-γλ 2 Gt} 0 Tr Vt σ 2 2γ κg κg = Tr{ ˆL H H T } cycle subspace of G, effec=ve resistance of G cf. Medvedev, SICON 202 7/3/3 4
42 Slow subsystem: escape from the poten=al well ξ = γ 2 ˆLξ +σ H W +... n η = f η+ σ n w n # τ exp 2nΔU & %, ΔU =U U0 = 4 $ σ 2 ' 3 7/3/3 42
43 Mixed- mode oscilla=ons 6 2 n vt 0 Frequency, % v t Number of small oscillations M., Hitczenko, The Poincare map of randomly perturbed periodic mo=on, J. Nonlin. Sci., accepted
44 Why beta cells exhibit spontaneous spiking in isola=on and regular burs=ng in electrically coupled islets of Langerhans? One cell Network Scenario A Scenario B Sherman, Rinzel, Sherman 88; Sherman, Rinzel 9 M., Zhuravytska, Biol. Cyberne=cs, 202
45 Conclusions The varia=onal interpreta=on of pabern forma=on in coupled networks Bifurca=ons in stochas=c system Slow- fast analysis of synchroniza=on: role of network topology 7/3/3 45
46 Related papers G.S. Medvedev and S. Zhuravytska, The geometry of spontaneous spiking in neuronal networks, J. Nonlinear Sci., 202 G.S. Medvedev and S. Zhuravytska, Shaping burs=ng by electrical coupling and noise, Biol. Cyberne=cs, vol. 06, pp , 202. G.S. Medvedev, Stochas=c stability of con=nuous =me consensus protocols, SIAM J. Control Op=m., Vol. 50, No. 4, pp , /3/3 46
The Poincare map for randomly perturbed periodic mo5on
The Poincare map for randomly perturbed periodic mo5on Georgi Medvedev Drexel University SIAM Conference on Applica1ons of Dynamical Systems May 19, 2013 Pawel Hitczenko and Georgi Medvedev, The Poincare
More informationTOPOLOGY FOR GLOBAL AVERAGE CONSENSUS. Soummya Kar and José M. F. Moura
TOPOLOGY FOR GLOBAL AVERAGE CONSENSUS Soummya Kar and José M. F. Moura Department of Electrical and Computer Engineering Carnegie Mellon University, Pittsburgh, PA 15213 USA (e-mail:{moura}@ece.cmu.edu)
More informationTheory and applications of random Poincaré maps
Nils Berglund nils.berglund@univ-orleans.fr http://www.univ-orleans.fr/mapmo/membres/berglund/ Random Dynamical Systems Theory and applications of random Poincaré maps Nils Berglund MAPMO, Université d'orléans,
More informationAlgorithms, Graph Theory, and Linear Equa9ons in Laplacians. Daniel A. Spielman Yale University
Algorithms, Graph Theory, and Linear Equa9ons in Laplacians Daniel A. Spielman Yale University Shang- Hua Teng Carter Fussell TPS David Harbater UPenn Pavel Cur9s Todd Knoblock CTY Serge Lang 1927-2005
More informationNoise-induced bursting. Georgi Medvedev
Noise-induced bursting Georgi Medvedev Department of Mathematics, Dreel University September 16, 27 Two problems Noise-induced bursting in single cell models (with Pawel Hitczenko, Dreel U.) Bursting in
More informationDiffusion and random walks on graphs
Diffusion and random walks on graphs Leonid E. Zhukov School of Data Analysis and Artificial Intelligence Department of Computer Science National Research University Higher School of Economics Structural
More informationOn Asymptotic Synchronization of Interconnected Hybrid Systems with Applications
On Asymptotic Synchronization of Interconnected Hybrid Systems with Applications Sean Phillips and Ricardo G. Sanfelice Abstract In this paper, we consider the synchronization of the states of a multiagent
More informationConvex Optimization of Graph Laplacian Eigenvalues
Convex Optimization of Graph Laplacian Eigenvalues Stephen Boyd Abstract. We consider the problem of choosing the edge weights of an undirected graph so as to maximize or minimize some function of the
More informationStochastic differential equations in neuroscience
Stochastic differential equations in neuroscience Nils Berglund MAPMO, Orléans (CNRS, UMR 6628) http://www.univ-orleans.fr/mapmo/membres/berglund/ Barbara Gentz, Universität Bielefeld Damien Landon, MAPMO-Orléans
More informationAn Elementary Construction of Constant-Degree Expanders
An Elementary Construction of Constant-Degree Expanders Noga Alon Oded Schwartz Asaf Shapira Abstract We describe a short and easy to analyze construction of constant-degree expanders. The construction
More informationSynchronization in Complex Network System With Uncertainty
Synchronization in Complex Network System With Uncertainty Amit Diwadkar and Umesh Vaidya Abstract In this paper, we study the problem of synchronization in a network of nonlinear systems with scalar dynamics.
More informationarxiv: v1 [math.ds] 10 May 2018
Bifurcations in the Kuramoto model on graphs arxiv:185.3786v1 [math.ds] 1 May 18 Hayato Chiba, Georgi S. Medvedev, and Matthew S. Mizuhara May 11, 18 Abstract In his classical work, Kuramoto analytically
More informationGEORGI S. MEDVEDEV, PH.D.
GEORGI S. MEDVEDEV, PH.D. Department of Mathematics (215) 895-6612 (voice) Drexel University (215) 895-1582 (fax) 3141 Chestnut Street medvedev@drexel.edu Philadelphia, PA 19104 www.math.drexel.edu/ medvedev
More informationSynchronization in delaycoupled bipartite networks
Synchronization in delaycoupled bipartite networks Ram Ramaswamy School of Physical Sciences Jawaharlal Nehru University, New Delhi February 20, 2015 Outline Ø Bipartite networks and delay-coupled phase
More informationLecturer: Naoki Saito Scribe: Ashley Evans/Allen Xue. May 31, Graph Laplacians and Derivatives
MAT 280: Laplacian Eigenfunctions: Theory, Applications, and Computations Lecture 19: Introduction to Spectral Graph Theory II. Graph Laplacians and Eigenvalues of Adjacency Matrices and Laplacians Lecturer:
More informationConvex Optimization of Graph Laplacian Eigenvalues
Convex Optimization of Graph Laplacian Eigenvalues Stephen Boyd Stanford University (Joint work with Persi Diaconis, Arpita Ghosh, Seung-Jean Kim, Sanjay Lall, Pablo Parrilo, Amin Saberi, Jun Sun, Lin
More informationSynchronization and Kron Reduction in Power Networks
Synchronization and Kron Reduction in Power Networks Florian Dörfler and Francesco Bullo Center for Control, Dynamical Systems & Computation University of California at Santa Barbara IFAC Workshop on Distributed
More informationHomogeniza*ons in Perforated Domain. Ki Ahm Lee Seoul Na*onal University
Homogeniza*ons in Perforated Domain Ki Ahm Lee Seoul Na*onal University Outline 1. Perforated Domain 2. Neumann Problems (joint work with Minha Yoo; interes*ng discussion with Li Ming Yeh) 3. Dirichlet
More informationFast Linear Iterations for Distributed Averaging 1
Fast Linear Iterations for Distributed Averaging 1 Lin Xiao Stephen Boyd Information Systems Laboratory, Stanford University Stanford, CA 943-91 lxiao@stanford.edu, boyd@stanford.edu Abstract We consider
More informationEigenvalues, random walks and Ramanujan graphs
Eigenvalues, random walks and Ramanujan graphs David Ellis 1 The Expander Mixing lemma We have seen that a bounded-degree graph is a good edge-expander if and only if if has large spectral gap If G = (V,
More informationRandom Lifts of Graphs
27th Brazilian Math Colloquium, July 09 Plan of this talk A brief introduction to the probabilistic method. A quick review of expander graphs and their spectrum. Lifts, random lifts and their properties.
More informationSpectral and Electrical Graph Theory. Daniel A. Spielman Dept. of Computer Science Program in Applied Mathematics Yale Unviersity
Spectral and Electrical Graph Theory Daniel A. Spielman Dept. of Computer Science Program in Applied Mathematics Yale Unviersity Outline Spectral Graph Theory: Understand graphs through eigenvectors and
More informationAffine extractors over large fields with exponential error
Affine extractors over large fields with exponential error Jean Bourgain Zeev Dvir Ethan Leeman Abstract We describe a construction of explicit affine extractors over large finite fields with exponentially
More informationConsensus, Flocking and Opinion Dynamics
Consensus, Flocking and Opinion Dynamics Antoine Girard Laboratoire Jean Kuntzmann, Université de Grenoble antoine.girard@imag.fr International Summer School of Automatic Control GIPSA Lab, Grenoble, France,
More informationChimera states in networks of biological neurons and coupled damped pendulums
in neural models in networks of pendulum-like elements in networks of biological neurons and coupled damped pendulums J. Hizanidis 1, V. Kanas 2, A. Bezerianos 3, and T. Bountis 4 1 National Center for
More informationStability of Feedback Solutions for Infinite Horizon Noncooperative Differential Games
Stability of Feedback Solutions for Infinite Horizon Noncooperative Differential Games Alberto Bressan ) and Khai T. Nguyen ) *) Department of Mathematics, Penn State University **) Department of Mathematics,
More informationAverage-Consensus of Multi-Agent Systems with Direct Topology Based on Event-Triggered Control
Outline Background Preliminaries Consensus Numerical simulations Conclusions Average-Consensus of Multi-Agent Systems with Direct Topology Based on Event-Triggered Control Email: lzhx@nankai.edu.cn, chenzq@nankai.edu.cn
More informationImage Processing 1 (IP1) Bildverarbeitung 1
MIN-Fakultät Fachbereich Informatik Arbeitsbereich SAV/BV (KOGS Image Processing 1 (IP1 Bildverarbeitung 1 Lecture 5 Perspec
More informationRandom and Deterministic perturbations of dynamical systems. Leonid Koralov
Random and Deterministic perturbations of dynamical systems Leonid Koralov - M. Freidlin, L. Koralov Metastability for Nonlinear Random Perturbations of Dynamical Systems, Stochastic Processes and Applications
More informationSparsification of Graphs and Matrices
Sparsification of Graphs and Matrices Daniel A. Spielman Yale University joint work with Joshua Batson (MIT) Nikhil Srivastava (MSR) Shang- Hua Teng (USC) HUJI, May 21, 2014 Objective of Sparsification:
More informationData Analysis and Manifold Learning Lecture 7: Spectral Clustering
Data Analysis and Manifold Learning Lecture 7: Spectral Clustering Radu Horaud INRIA Grenoble Rhone-Alpes, France Radu.Horaud@inrialpes.fr http://perception.inrialpes.fr/ Outline of Lecture 7 What is spectral
More informationResearch Article Mathematical Model and Cluster Synchronization for a Complex Dynamical Network with Two Types of Chaotic Oscillators
Applied Mathematics Volume 212, Article ID 936, 12 pages doi:1.11/212/936 Research Article Mathematical Model and Cluster Synchronization for a Complex Dynamical Network with Two Types of Chaotic Oscillators
More informationSome thoughts on linearity, nonlinearity, and partial separability
Some thoughts on linearity, nonlinearity, and partial separability Paul Hovland Argonne Na0onal Laboratory Joint work with Boyana Norris, Sri Hari Krishna Narayanan, Jean Utke, Drew Wicke Argonne Na0onal
More informationRandomness in Number Theory
Randomness in Number Theory Peter Sarnak Mahler Lectures 2011 Number Theory Probability Theory Whole numbers Random objects Prime numbers Points in space Arithmetic operations Geometries Diophantine equations
More informationLecture 17: Cheeger s Inequality and the Sparsest Cut Problem
Recent Advances in Approximation Algorithms Spring 2015 Lecture 17: Cheeger s Inequality and the Sparsest Cut Problem Lecturer: Shayan Oveis Gharan June 1st Disclaimer: These notes have not been subjected
More informationOn the bang-bang property of time optimal controls for infinite dimensional linear systems
On the bang-bang property of time optimal controls for infinite dimensional linear systems Marius Tucsnak Université de Lorraine Paris, 6 janvier 2012 Notation and problem statement (I) Notation: X (the
More informationA random perturbation approach to some stochastic approximation algorithms in optimization.
A random perturbation approach to some stochastic approximation algorithms in optimization. Wenqing Hu. 1 (Presentation based on joint works with Chris Junchi Li 2, Weijie Su 3, Haoyi Xiong 4.) 1. Department
More informationTikhonov Regularization of Large Symmetric Problems
NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS Numer. Linear Algebra Appl. 2000; 00:1 11 [Version: 2000/03/22 v1.0] Tihonov Regularization of Large Symmetric Problems D. Calvetti 1, L. Reichel 2 and A. Shuibi
More informationDiffuse interface methods on graphs: Data clustering and Gamma-limits
Diffuse interface methods on graphs: Data clustering and Gamma-limits Yves van Gennip joint work with Andrea Bertozzi, Jeff Brantingham, Blake Hunter Department of Mathematics, UCLA Research made possible
More informationarxiv:nlin/ v1 [nlin.cd] 13 May 2006
On transition to bursting via deterministic chaos arxiv:nlin/0605030v1 [nlin.cd] 13 May 2006 Georgi S. Medvedev September 23, 2018 Abstract We study statistical properties of the irregular bursting arising
More informationRobust Synchronization in Networks of Compartmental Systems. Milad Alekajbaf
Robust Synchronization in Networks of Compartmental Systems by Milad Alekajbaf A thesis submitted in conformity with the requirements for the degree of Master of Applied Science Graduate Department of
More informationGraph Sparsification III: Ramanujan Graphs, Lifts, and Interlacing Families
Graph Sparsification III: Ramanujan Graphs, Lifts, and Interlacing Families Nikhil Srivastava Microsoft Research India Simons Institute, August 27, 2014 The Last Two Lectures Lecture 1. Every weighted
More informationA Model of Evolutionary Dynamics with Quasiperiodic Forcing
paper presented at Society for Experimental Mechanics (SEM) IMAC XXXIII Conference on Structural Dynamics February 2-5, 205, Orlando FL A Model of Evolutionary Dynamics with Quasiperiodic Forcing Elizabeth
More informationGraph Partitioning Using Random Walks
Graph Partitioning Using Random Walks A Convex Optimization Perspective Lorenzo Orecchia Computer Science Why Spectral Algorithms for Graph Problems in practice? Simple to implement Can exploit very efficient
More informationThe University of Texas at Austin Department of Electrical and Computer Engineering. EE381V: Large Scale Learning Spring 2013.
The University of Texas at Austin Department of Electrical and Computer Engineering EE381V: Large Scale Learning Spring 2013 Assignment 1 Caramanis/Sanghavi Due: Thursday, Feb. 7, 2013. (Problems 1 and
More informationFinding normalized and modularity cuts by spectral clustering. Ljubjana 2010, October
Finding normalized and modularity cuts by spectral clustering Marianna Bolla Institute of Mathematics Budapest University of Technology and Economics marib@math.bme.hu Ljubjana 2010, October Outline Find
More informationThe critical group of a graph
The critical group of a graph Peter Sin Texas State U., San Marcos, March th, 4. Critical groups of graphs Outline Laplacian matrix of a graph Chip-firing game Smith normal form Some families of graphs
More informationNonlinear Dimensionality Reduction
Outline Hong Chang Institute of Computing Technology, Chinese Academy of Sciences Machine Learning Methods (Fall 2012) Outline Outline I 1 Kernel PCA 2 Isomap 3 Locally Linear Embedding 4 Laplacian Eigenmap
More informationDynamical modelling of systems of coupled oscillators
Dynamical modelling of systems of coupled oscillators Mathematical Neuroscience Network Training Workshop Edinburgh Peter Ashwin University of Exeter 22nd March 2009 Peter Ashwin (University of Exeter)
More informationChapter 11. Matrix Algorithms and Graph Partitioning. M. E. J. Newman. June 10, M. E. J. Newman Chapter 11 June 10, / 43
Chapter 11 Matrix Algorithms and Graph Partitioning M. E. J. Newman June 10, 2016 M. E. J. Newman Chapter 11 June 10, 2016 1 / 43 Table of Contents 1 Eigenvalue and Eigenvector Eigenvector Centrality The
More information1 The Observability Canonical Form
NONLINEAR OBSERVERS AND SEPARATION PRINCIPLE 1 The Observability Canonical Form In this Chapter we discuss the design of observers for nonlinear systems modelled by equations of the form ẋ = f(x, u) (1)
More informationSpace-Variant Computer Vision: A Graph Theoretic Approach
p.1/65 Space-Variant Computer Vision: A Graph Theoretic Approach Leo Grady Cognitive and Neural Systems Boston University p.2/65 Outline of talk Space-variant vision - Why and how of graph theory Anisotropic
More informationSpectral clustering. Two ideal clusters, with two points each. Spectral clustering algorithms
A simple example Two ideal clusters, with two points each Spectral clustering Lecture 2 Spectral clustering algorithms 4 2 3 A = Ideally permuted Ideal affinities 2 Indicator vectors Each cluster has an
More informationarxiv: v1 [nlin.ao] 8 Dec 2017
Nonlinearity 31(1):R1-R23 (2018) Identical synchronization of nonidentical oscillators: when only birds of different feathers flock together arxiv:1712.03245v1 [nlin.ao] 8 Dec 2017 Yuanzhao Zhang 1 and
More informationLecture 10: October 27, 2016
Mathematical Toolkit Autumn 206 Lecturer: Madhur Tulsiani Lecture 0: October 27, 206 The conjugate gradient method In the last lecture we saw the steepest descent or gradient descent method for finding
More informationSynchronization Transitions in Complex Networks
Synchronization Transitions in Complex Networks Y. Moreno 1,2,3 1 Institute for Biocomputation and Physics of Complex Systems (BIFI) University of Zaragoza, Zaragoza 50018, Spain 2 Department of Theoretical
More informationarxiv: v1 [nlin.ao] 3 May 2015
UNI-DIRECTIONAL SYNCHRONIZATION AND FREQUENCY DIFFERENCE LOCKING INDUCED BY A HETEROCLINIC RATCHET arxiv:155.418v1 [nlin.ao] 3 May 215 Abstract A system of four coupled oscillators that exhibits unusual
More informationEIGENVECTOR NORMS MATTER IN SPECTRAL GRAPH THEORY
EIGENVECTOR NORMS MATTER IN SPECTRAL GRAPH THEORY Franklin H. J. Kenter Rice University ( United States Naval Academy 206) orange@rice.edu Connections in Discrete Mathematics, A Celebration of Ron Graham
More informationNetworks and Their Spectra
Networks and Their Spectra Victor Amelkin University of California, Santa Barbara Department of Computer Science victor@cs.ucsb.edu December 4, 2017 1 / 18 Introduction Networks (= graphs) are everywhere.
More information2012 NCTS Workshop on Dynamical Systems
Barbara Gentz gentz@math.uni-bielefeld.de http://www.math.uni-bielefeld.de/ gentz 2012 NCTS Workshop on Dynamical Systems National Center for Theoretical Sciences, National Tsing-Hua University Hsinchu,
More informationSynchrony in Stochastic Pulse-coupled Neuronal Network Models
Synchrony in Stochastic Pulse-coupled Neuronal Network Models Katie Newhall Gregor Kovačič and Peter Kramer Aaditya Rangan and David Cai 2 Rensselaer Polytechnic Institute, Troy, New York 2 Courant Institute,
More informationLeast Squares Parameter Es.ma.on
Least Squares Parameter Es.ma.on Alun L. Lloyd Department of Mathema.cs Biomathema.cs Graduate Program North Carolina State University Aims of this Lecture 1. Model fifng using least squares 2. Quan.fica.on
More informationUniformly Uniformly-ergodic Markov chains and BSDEs
Uniformly Uniformly-ergodic Markov chains and BSDEs Samuel N. Cohen Mathematical Institute, University of Oxford (Based on joint work with Ying Hu, Robert Elliott, Lukas Szpruch) Centre Henri Lebesgue,
More informationDesynchronization waves in small-world networks
PHYSICAL REVIEW E 75, 0611 007 Desynchronization waves in small-world networks Kwangho Park and Liang Huang Department of Electrical Engineering, Arizona State University, Tempe, Arizona 8587, USA Ying-Cheng
More informationMulti-Robotic Systems
CHAPTER 9 Multi-Robotic Systems The topic of multi-robotic systems is quite popular now. It is believed that such systems can have the following benefits: Improved performance ( winning by numbers ) Distributed
More informationNumerical Schemes from the Perspective of Consensus
Numerical Schemes from the Perspective of Consensus Exploring Connections between Agreement Problems and PDEs Department of Electrical Engineering and Computer Sciences University of California, Berkeley
More informationRobust Laplacian Eigenmaps Using Global Information
Manifold Learning and its Applications: Papers from the AAAI Fall Symposium (FS-9-) Robust Laplacian Eigenmaps Using Global Information Shounak Roychowdhury ECE University of Texas at Austin, Austin, TX
More informationOblivious and Adaptive Strategies for the Majority and Plurality Problems
Oblivious and Adaptive Strategies for the Majority and Plurality Problems Fan Chung 1, Ron Graham 1, Jia Mao 1, and Andrew Yao 2 1 Department of Computer Science and Engineering, University of California,
More informationRegulatory Inferece from Gene Expression. CMSC858P Spring 2012 Hector Corrada Bravo
Regulatory Inferece from Gene Expression CMSC858P Spring 2012 Hector Corrada Bravo 2 Graphical Model Let y be a vector- valued random variable Suppose some condi8onal independence proper8es hold for some
More informationDiscrete Double Integrator Consensus
Proceedings of the 47th IEEE Conference on Decision and Control Cancun, Mexico, Dec. 9-11, 28 Discrete Double Integrator Consensus David W. Casbeer, Randy Beard, and A. Lee Swindlehurst Abstract A distributed
More informationMoment-Based Analysis of Synchronization in Small-World Networks of Oscillators
Moment-Based Analysis of Synchronization in Small-World etworks of Oscillators Victor M. Preciado and Ali Jadbabaie Abstract In this paper, we investigate synchronization in a small-world network of coupled
More informationMachine Learning for Data Science (CS4786) Lecture 11
Machine Learning for Data Science (CS4786) Lecture 11 Spectral clustering Course Webpage : http://www.cs.cornell.edu/courses/cs4786/2016sp/ ANNOUNCEMENT 1 Assignment P1 the Diagnostic assignment 1 will
More informationIndex Theory and Periodic Solution of Delay Differential Systems
Index Theory and Periodic Solution of Delay Differential Systems Liu Chungen School of Mathematics, Nankai University workshop on nonlinear PDE and calculus of variation, Chern Mathematical Institute 2013.9.16
More informationKernels for Dynamic Textures
Kernels for Dynamic Textures S.V.N. Vishwanathan SVN.Vishwanathan@nicta.com.au http://web.anu.edu.au/~vishy National ICT Australia and Australian National University Joint work with Alex Smola and René
More informationWhy You should do a PhD in Statistical Mechanics
Why You should do a PhD in Statistical Mechanics Quirin Vogel Department of Mathematics Warwick Open Day, 7th February 2018 Outline General Introduction Statistical Mechanics of discrete State Spaces My
More informationNonequilibrium Response in a Model for Sensory Adapta8on
The 7 th KIAS Conference on Sta8s8cal Physics, 4-7 July 2016 Nonequilibrium Sta8s8cal Physics of Complex Systems Nonequilibrium Response in a Model for Sensory Adapta8on Shouwen Wang and Lei- Han Tang
More informationOn the Landscape of Synchronization Networks: A Perspective from Nonconvex Optimization
On the Landscape of Synchronization Networks: A Perspective from Nonconvex Optimization Shuyang Ling, Ruitu Xu, Afonso S. Bandeira September 8, 018 Abstract Studying the landscape of nonconvex cost function
More informationPower Grid Partitioning: Static and Dynamic Approaches
Power Grid Partitioning: Static and Dynamic Approaches Miao Zhang, Zhixin Miao, Lingling Fan Department of Electrical Engineering University of South Florida Tampa FL 3320 miaozhang@mail.usf.edu zmiao,
More informationAvailable online at ScienceDirect. Procedia IUTAM 19 (2016 ) IUTAM Symposium Analytical Methods in Nonlinear Dynamics
Available online at www.sciencedirect.com ScienceDirect Procedia IUTAM 19 (2016 ) 11 18 IUTAM Symposium Analytical Methods in Nonlinear Dynamics A model of evolutionary dynamics with quasiperiodic forcing
More informationEigenvalue comparisons in graph theory
Eigenvalue comparisons in graph theory Gregory T. Quenell July 1994 1 Introduction A standard technique for estimating the eigenvalues of the Laplacian on a compact Riemannian manifold M with bounded curvature
More informationZeta functions in Number Theory and Combinatorics
Zeta functions in Number Theory and Combinatorics Winnie Li Pennsylvania State University, U.S.A. and National Center for Theoretical Sciences, Taiwan 1 1. Riemann zeta function The Riemann zeta function
More informationData Mining and Analysis: Fundamental Concepts and Algorithms
Data Mining and Analysis: Fundamental Concepts and Algorithms dataminingbook.info Mohammed J. Zaki 1 Wagner Meira Jr. 2 1 Department of Computer Science Rensselaer Polytechnic Institute, Troy, NY, USA
More informationFacebook Friends! and Matrix Functions
Facebook Friends! and Matrix Functions! Graduate Research Day Joint with David F. Gleich, (Purdue), supported by" NSF CAREER 1149756-CCF Kyle Kloster! Purdue University! Network Analysis Use linear algebra
More informationarxiv:cond-mat/ v1 [cond-mat.dis-nn] 6 Oct 2006
Revealing Network Connectivity From Dynamics Marc Timme arxiv:cond-mat/0610188v1 [cond-mat.dis-nn] 6 Oct 2006 Center for Applied Mathematics, Theoretical & Applied Mechanics, Kimball Hall, Cornell University,
More informationHalf of Final Exam Name: Practice Problems October 28, 2014
Math 54. Treibergs Half of Final Exam Name: Practice Problems October 28, 24 Half of the final will be over material since the last midterm exam, such as the practice problems given here. The other half
More informationHigher Order Averaging : periodic solutions, linear systems and an application
Higher Order Averaging : periodic solutions, linear systems and an application Hartono and A.H.P. van der Burgh Faculty of Information Technology and Systems, Department of Applied Mathematical Analysis,
More informationDoug Cochran. 3 October 2011
) ) School Electrical, Computer, & Energy Arizona State University (Joint work with Stephen Howard and Bill Moran) 3 October 2011 Tenets ) The purpose sensor networks is to sense; i.e., to enable detection,
More informationOn the Hyers-Ulam Stability of a System of Euler Differential Equations of First Order
Tamsui Oxford Journal of Mathematical Sciences 24(4) (2008) 381-388 Aletheia University On the Hyers-Ulam Stability of a System of Euler Differential Equations of First Order Soon-Mo Jung, Byungbae Kim
More informationComplex Laplacians and Applications in Multi-Agent Systems
1 Complex Laplacians and Applications in Multi-Agent Systems Jiu-Gang Dong, and Li Qiu, Fellow, IEEE arxiv:1406.186v [math.oc] 14 Apr 015 Abstract Complex-valued Laplacians have been shown to be powerful
More informationSaturation of Information Exchange in Locally Connected Pulse-Coupled Oscillators
Saturation of Information Exchange in Locally Connected Pulse-Coupled Oscillators Will Wagstaff School of Computer Science, Georgia Institute of Technology, Atlanta, Georgia 30332, USA (Dated: 13 December
More informationPSRGs via Random Walks on Graphs
Spectral Graph Theory Lecture 11 PSRGs via Random Walks on Graphs Daniel A. Spielman October 3, 2012 11.1 Overview There has been a lot of work on the design of Pseudo-Random Number Generators (PSRGs)
More informationWhat will you learn?
Section 2.2 Basic Differentiation Rules & Rates of Change Calc What will you learn? Find the derivative using the Constant Rule Find the derivative using the Power Rule Find the derivative using the Constant
More informationNeuroscience applications: isochrons and isostables. Alexandre Mauroy (joint work with I. Mezic)
Neuroscience applications: isochrons and isostables Alexandre Mauroy (joint work with I. Mezic) Outline Isochrons and phase reduction of neurons Koopman operator and isochrons Isostables of excitable systems
More informationSpectral Generative Models for Graphs
Spectral Generative Models for Graphs David White and Richard C. Wilson Department of Computer Science University of York Heslington, York, UK wilson@cs.york.ac.uk Abstract Generative models are well known
More informationAn Accelerated Block-Parallel Newton Method via Overlapped Partitioning
An Accelerated Block-Parallel Newton Method via Overlapped Partitioning Yurong Chen Lab. of Parallel Computing, Institute of Software, CAS (http://www.rdcps.ac.cn/~ychen/english.htm) Summary. This paper
More informationEigenvalues of graphs
Eigenvalues of graphs F. R. K. Chung University of Pennsylvania Philadelphia PA 19104 September 11, 1996 1 Introduction The study of eigenvalues of graphs has a long history. From the early days, representation
More informationLeast Square Es?ma?on, Filtering, and Predic?on: ECE 5/639 Sta?s?cal Signal Processing II: Linear Es?ma?on
Least Square Es?ma?on, Filtering, and Predic?on: Sta?s?cal Signal Processing II: Linear Es?ma?on Eric Wan, Ph.D. Fall 2015 1 Mo?va?ons If the second-order sta?s?cs are known, the op?mum es?mator is given
More informationUpper bounds on algebraic connectivity via convex optimization
Linear Algebra and its Applications 418 (2006) 693 707 www.elsevier.com/locate/laa Upper bounds on algebraic connectivity via convex optimization Arpita Ghosh, Stephen Boyd Department of Electrical Engineering,
More informationSpectral Graph Theory
Spectral Graph Theory Aaron Mishtal April 27, 2016 1 / 36 Outline Overview Linear Algebra Primer History Theory Applications Open Problems Homework Problems References 2 / 36 Outline Overview Linear Algebra
More information