2008, 3(2): 201-219. doi: 10.3934/nhm.2008.3.201

On algebraic graph theory and the dynamics of innovation networks


Chair of Systems Design, ETH Zürich, Kreuzplatz 5, CH-8032 Zürich, Switzerland, Switzerland, Switzerland


Chair of Systems Design, ETH Zürich, Kreuzplatz 5, 8032 Zürich

Received  November 2007 Revised  February 2008 Published  March 2008

We investigate some of the properties and extensions of a dynamic innovation network model recently introduced in [37]. In the model, the set of efficient graphs ranges, depending on the cost for maintaining a link, from the complete graph to the (quasi-) star, varying within a well defined class of graphs. However, the interplay between dynamics on the nodes and topology of the network leads to equilibrium networks which are typically not efficient and are characterized, as observed in empirical studies of R&D networks, by sparseness, presence of clusters and heterogeneity of degree. In this paper, we analyze the relation between the growth rate of the knowledge stock of the agents from R&D collaborations and the properties of the adjacency matrix as- sociated with the network of collaborations. By means of computer simulations we further investigate how the equilibrium network is affected by increasing the evaluation time $\tau$ over which agents evaluate whether to maintain a link or not. We show that only if $\tau$ is long enough, efficient networks can be obtained by the selfish link formation process of agents, otherwise the equilibrium network is inefficient. This work should assist in building a theoretical framework of R&D networks from which policies can be derived that aim at fostering efficient innovation networks.
Citation: M. D. König, Stefano Battiston, M. Napoletano, F. Schweitzer. On algebraic graph theory and the dynamics of innovation networks. Networks & Heterogeneous Media, 2008, 3 (2) : 201-219. doi: 10.3934/nhm.2008.3.201

Mirela Domijan, Markus Kirkilionis. Graph theory and qualitative analysis of reaction networks. Networks & Heterogeneous Media, 2008, 3 (2) : 295-322. doi: 10.3934/nhm.2008.3.295


Konstantin Avrachenkov, Giovanni Neglia, Vikas Vikram Singh. Network formation games with teams. Journal of Dynamics & Games, 2016, 3 (4) : 303-318. doi: 10.3934/jdg.2016016


Liu Hui, Lin Zhi, Waqas Ahmad. Network(graph) data research in the coordinate system. Mathematical Foundations of Computing, 2018, 1 (1) : 1-10. doi: 10.3934/mfc.2018001


Deena Schmidt, Janet Best, Mark S. Blumberg. Random graph and stochastic process contributions to network dynamics. Conference Publications, 2011, 2011 (Special) : 1279-1288. doi: 10.3934/proc.2011.2011.1279


Barton E. Lee. Consensus and voting on large graphs: An application of graph limit theory. Discrete & Continuous Dynamical Systems - A, 2018, 38 (4) : 1719-1744. doi: 10.3934/dcds.2018071


V. Lanza, D. Ambrosi, L. Preziosi. Exogenous control of vascular network formation in vitro: a mathematical model. Networks & Heterogeneous Media, 2006, 1 (4) : 621-637. doi: 10.3934/nhm.2006.1.621


Marco Scianna, Luca Munaron. Multiscale model of tumor-derived capillary-like network formation. Networks & Heterogeneous Media, 2011, 6 (4) : 597-624. doi: 10.3934/nhm.2011.6.597


Yao-Li Chuang, Tom Chou, Maria R. D'Orsogna. A network model of immigration: Enclave formation vs. cultural integration. Networks & Heterogeneous Media, 2019, 14 (1) : 53-77. doi: 10.3934/nhm.2019004


Peter Hinow, Edward A. Rietman, Sara Ibrahim Omar, Jack A. Tuszyński. Algebraic and topological indices of molecular pathway networks in human cancers. Mathematical Biosciences & Engineering, 2015, 12 (6) : 1289-1302. doi: 10.3934/mbe.2015.12.1289


Robert Carlson. Spectral theory for nonconservative transmission line networks. Networks & Heterogeneous Media, 2011, 6 (2) : 257-277. doi: 10.3934/nhm.2011.6.257


Maya Mincheva, Gheorghe Craciun. Graph-theoretic conditions for zero-eigenvalue Turing instability in general chemical reaction networks. Mathematical Biosciences & Engineering, 2013, 10 (4) : 1207-1226. doi: 10.3934/mbe.2013.10.1207


A. C. Eberhard, J-P. Crouzeix. Existence of closed graph, maximal, cyclic pseudo-monotone relations and revealed preference theory. Journal of Industrial & Management Optimization, 2007, 3 (2) : 233-255. doi: 10.3934/jimo.2007.3.233


Xianmin Geng, Shengli Zhou, Jiashan Tang, Cong Yang. A sufficient condition for classified networks to possess complex network features. Networks & Heterogeneous Media, 2012, 7 (1) : 59-69. doi: 10.3934/nhm.2012.7.59


Jian-Jun Xu, Junichiro Shimizu. Asymptotic theory for disc-like crystal growth (II): interfacial instability and pattern formation at early stage of growth. Communications on Pure & Applied Analysis, 2004, 3 (3) : 527-543. doi: 10.3934/cpaa.2004.3.527


Serap Ergün, Bariş Bülent Kırlar, Sırma Zeynep Alparslan Gök, Gerhard-Wilhelm Weber. An application of crypto cloud computing in social networks by cooperative game theory. Journal of Industrial & Management Optimization, 2017, 13 (5) : 1-15. doi: 10.3934/jimo.2019036


Zhuwei Qin, Fuxun Yu, Chenchen Liu, Xiang Chen. How convolutional neural networks see the world --- A survey of convolutional neural network visualization methods. Mathematical Foundations of Computing, 2018, 1 (2) : 149-180. doi: 10.3934/mfc.2018008


D. Warren, K Najarian. Learning theory applied to Sigmoid network classification of protein biological function using primary protein structure. Conference Publications, 2003, 2003 (Special) : 898-904. doi: 10.3934/proc.2003.2003.898


Stéphane Chrétien, Sébastien Darses, Christophe Guyeux, Paul Clarkson. On the pinning controllability of complex networks using perturbation theory of extreme singular values. application to synchronisation in power grids. Numerical Algebra, Control & Optimization, 2017, 7 (3) : 289-299. doi: 10.3934/naco.2017019


Eric Babson and Dmitry N. Kozlov. Topological obstructions to graph colorings. Electronic Research Announcements, 2003, 9: 61-68.


Oded Schramm. Hyperfinite graph limits. Electronic Research Announcements, 2008, 15: 17-23. doi: 10.3934/era.2008.15.17

2017 Impact Factor: 1.187


  • PDF downloads (6)
  • HTML views (0)
  • Cited by (7)

[Back to Top]