https://murray.cds.caltech.edu/index.php?title=Quantification_and_Minimization_of_Crosstalk_Sensitivity_in_Networks&feed=atom&action=historyQuantification and Minimization of Crosstalk Sensitivity in Networks - Revision history2022-12-01T03:56:51ZRevision history for this page on the wikiMediaWiki 1.37.2https://murray.cds.caltech.edu/index.php?title=Quantification_and_Minimization_of_Crosstalk_Sensitivity_in_Networks&diff=19765&oldid=prevMurray: htdb2wiki: creating page for 2010m_bm10b-arvix.html2016-05-15T06:16:12Z<p>htdb2wiki: creating page for 2010m_bm10b-arvix.html</p>
<p><b>New page</b></p><div>{{HTDB paper<br />
| authors = Dionysios Barmpoutis, Richard M Murray<br />
| title = Quantification and Minimization of Crosstalk Sensitivity in Networks<br />
| source = arXiv, q-bio.MN<br />
| year = 2010<br />
| type = Preprint<br />
| funding = <br />
| url = http://www.cds.caltech.edu/~murray/preprints/BM10b-arxiv.pdf<br />
| abstract = Crosstalk is defined as the set of unwanted interactions among the different entities of a network. Crosstalk is present in various degrees in every system where information is transmitted through a means that is accessible by all the individual units of the network. Using concepts from graph theory, we introduce a quantifiable measure for sensitivity to crosstalk, and analytically derive the structure of the networks in which it is minimized. It is shown that networks with an inhomogeneous degree distribution are more robust to crosstalk than corresponding homogeneous networks. We provide a method to construct the graph with the minimum possible sensitivity to crosstalk, given its order and size. Finally, for networks with a fixed degree sequence, we present an algorithm to find the optimal interconnection structure among their vertices.<br />
| flags = <br />
| tag = bm10b-arvix<br />
| id = 2010m<br />
}}</div>Murray