# Circulant type formulas for the eigenvalues of linear network maps

Lee DeVille, Eddie Nijholt

Research output: Contribution to journalArticlepeer-review

## Abstract

Given an admissible map γf for a homogeneous network N, it is known that the Jacobian Dγf(x) around a fully synchronous point x=(x0,…,x0) is again an admissible map for N. Motivated by this, we study the spectra of linear admissible maps for homogeneous networks. In particular, we define so-called network multipliers. These are (relatively small) matrices that depend linearly on the coefficients of the response function, and whose eigenvalues together make up the spectrum of the corresponding admissible map. More precisely, given a network N, we define a finite set of network multipliers (Λl)l=1k and a class of networks C containing N. This class is furthermore closed under taking quotient networks, subnetworks and disjoint unions. We then show that the eigenvalues of an admissible map for any network in C are given by those of (a subset of) the network multipliers, with fixed multiplicities (ml)l=1k and independently of the given (finite dimensional) phase space of a node. The coefficients of all the network multipliers of C are furthermore linearly independent, which implies that one may find the multiplicities (ml)l=1k by simply expressing the trace of an admissible map as a linear combination of the traces of the multipliers. In particular, we will give examples of networks where the network multipliers need not be constructed, but can be determined by looking at small networks in C. We also show that network multipliers are multiplicative with respect to composition of linear maps.

Original language English (US) 379-439 61 Linear Algebra and Its Applications 610 https://doi.org/10.1016/j.laa.2020.09.023 Accepted/In press - 2020

## Keywords

• Eigenvalues
• Homogeneous network
• Jacobian
• Linear analysis
• Networks

## ASJC Scopus subject areas

• Algebra and Number Theory
• Numerical Analysis
• Geometry and Topology
• Discrete Mathematics and Combinatorics
{"ft_lang_label":"__label__en","ft_lang_prob":0.8537266,"math_prob":0.8484712,"size":1940,"snap":"2021-04-2021-17","text_gpt3_token_len":441,"char_repetition_ratio":0.15599173,"word_repetition_ratio":0.0,"special_character_ratio":0.20515464,"punctuation_ratio":0.07012195,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99464804,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-01-25T12:10:34Z\",\"WARC-Record-ID\":\"<urn:uuid:f23fc438-17e2-465f-8e26-6e76a7e7e844>\",\"Content-Length\":\"52341\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:faa59e62-dccb-4d4f-928d-6647cccc6a74>\",\"WARC-Concurrent-To\":\"<urn:uuid:05d51ca7-02a4-48b4-87b0-4bd33f0a231f>\",\"WARC-IP-Address\":\"18.210.30.88\",\"WARC-Target-URI\":\"https://experts.illinois.edu/en/publications/circulant-type-formulas-for-the-eigenvalues-of-linear-network-map\",\"WARC-Payload-Digest\":\"sha1:WUHOS3GDY4PP7GL7MABSAZG2NBG2KRGK\",\"WARC-Block-Digest\":\"sha1:BMRDL4E45VXSVLAGITXSQRMMOUSGWUDV\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-04/CC-MAIN-2021-04_segments_1610703565541.79_warc_CC-MAIN-20210125092143-20210125122143-00738.warc.gz\"}"}