Algebraic Connectivity Ratio of Ramanujan Graphs

By Reza Olfati-Saber. 2007

52 citations recorded by the source corpus.

Subfields: Geometry and Topology, Materials Chemistry, Physiology

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Geometry and Topology

1. Piet Van Mieghem
2. Lihua Xie
3. Ruggero Carli
4. Soummya Kar
5. Sandro Zampieri
6. Luca Schenato
7. Yinliang Xu
8. Wenxin Liu

In Materials Chemistry

1. Ruggero Carli
2. Soummya Kar
3. Sandro Zampieri
4. Luca Schenato
5. Yinliang Xu
6. Wenxin Liu

In Physiology

1. Ruggero Carli
2. Soummya Kar
3. Sandro Zampieri
4. Luca Schenato
5. Yinliang Xu
6. Wenxin Liu

Citations in the corpus

• MATCHA: Speeding Up Decentralized SGD via Matching Decomposition Sampling (2019, background): “the best error-runtime trade-off, one can carefully design the network topology, for example, using expander graphs that are sparse while being well connected [6, 23].”
• Network Topology and Communication-Computation Tradeoffs in Decentralized Optimization (2017, background): “f practical interest since they allow fast rates of convergence—hence, few iterations—while also having relatively few links—so each iteration requires few transmissions and is thus fast to implement [35], [36]. B. Worst-case scaling of decentralized averaging One might wonder about the worst-case c”
• Algebraic Connectivity of Interdependent Networks (2014, background): “Keywords: Network of Networks, Synchronization, Laplacian, Spectral Properties, System of Systems”
• Distributed Kalman filtering based on consensus strategies (2008, background): “The linear consensus problem has been widely studied in terms of convergence of Markov Chains [9] [27] [19], and it has been recently proposed as an effective approach to solve many control problems ranging from flocking to robot rendezvous as summarized in the survey paper [17] and references there”
• Distributed Consensus With Limited Communication Data Rate (2011, background): “Ramanujan graphs are expanders which achieve the largest possible algebraic connectivity ([39]–[42]).”
• Novel Multiagent Based Load Restoration Algorithm for Microgrids (2011, background): “The optimal solution is the solution that can minimize of the iteration matrix [24].”