{"paper":{"title":"Optimal Tree for Both Synchronizability and Converging Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"nlin.CD","authors_text":"An Zeng, Yanqing Hu, Zengru Di","submitted_at":"2009-06-02T14:24:34Z","abstract_excerpt":"It has been proved that the spanning tree from a given network has the optimal synchronizability, which means the index $R=\\lambda_{N}/\\lambda_{2}$ reaches the minimum 1. Although the optimal synchronizability is corresponding to the minimal critical overall coupling strength to reach synchronization, it does not guarantee a shorter converging time from disorder initial configuration to synchronized state. In this letter, we find that it is the depth of the tree that affects the converging time. In addition, we present a simple and universal way to get such an effective oriented tree in a give"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.0493","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}