Learn More
We describe the structure of the graphs with the smallest average distance and the largest average clustering given their order and size. There is usually a unique graph with the largest average clustering, which at the same time has the smallest possible average distance. In contrast, there are many graphs with the same minimum average distance , ignoring(More)
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(More)
Acknowledgments Pursuing a Ph.D. is typically a lengthy endeavor, but in my case " lengthy " is something of an understatement. As such, coming up with a list of people I have met during my time here, and wish to acknowledge, is daunting to say the least. Here follows a no doubt incomplete attempt. Firstly, I would like to thank my acting advisor and(More)
We describe how noise propagates through a network by calculating the variance of the outputs. Using stochastic calculus and dynam-ical systems theory, we study the network topologies that accentuate or alleviate the effect of random variance in the network for both directed and undirected graphs. Given a linear tree network, the variance in the output is a(More)
  • 1