CaltechAUTHORS
  A Caltech Library Service

Quantification and Minimization of Crosstalk Sensitivity in Networks

Barmpoutis, Dionysios and Murray, Richard M. (2010) Quantification and Minimization of Crosstalk Sensitivity in Networks. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20190410-120605649

[img] PDF - Submitted Version
See Usage Policy.

294Kb

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20190410-120605649

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.


Item Type:Report or Paper (Discussion Paper)
Related URLs:
URLURL TypeDescription
http://arxiv.org/abs/1012.0606arXivDiscussion Paper
ORCID:
AuthorORCID
Murray, Richard M.0000-0002-5785-7481
Record Number:CaltechAUTHORS:20190410-120605649
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20190410-120605649
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:94625
Collection:CaltechAUTHORS
Deposited By: George Porter
Deposited On:11 Apr 2019 18:00
Last Modified:03 Oct 2019 21:05

Repository Staff Only: item control page