Complex Networks: New Models and Distributed Algorithms

Over the past few years, a consensus has emerged among scientists and engineers that net-centric technology can provide unprecedented levels of performance, robustness, and efficiency. Success stories such as the Internet, distributed sensor networks, and multi-agent networks of mobile robots are only a few examples that support this view. The important role played by complex networks has been widely observed in various physical, natural, and social systems. Given the complexity of many of these systems, it is important to understand the fundamental rules that govern them and introduce appropriate models that capture such principles, while abstracting away the redundant details. The main goal of this thesis is to contribute to the emerging field of network science\u27\u27 in two ways. The first part of the thesis focuses on the question of information aggregation over complex networks. The problem under study is the asymptotic behavior of agents in a network when they are willing to share information with their neighbors. We start by focusing on conditions under which all agents in the network will asymptotically agree on some quantity of interest, what is known as the consensus problem. We present conditions that guarantee asymptotic agreement when inter-agent communication links change randomly over time. We then propose a distributed (non-Bayesian) algorithm that enables agents to not only agree, but also learn the true underlying state of the world. We prove that our proposed learning rule results in successful information aggregation, in the sense that all agents asymptotically learn the truth as if they were completely informed of all signals and updated their beliefs rationally. Moreover, the simplicity of our local update rule guarantees that agents eventually achieve full learning, while at the same time, avoiding highly complex computations that are essential for full Bayesian learning over networks. The second part of this thesis focuses on presenting a new modeling paradigm that greatly expands the tool set for mathematical modeling of networks, beyond graphs. The approach taken is based on using simplicial complexes, which are objects of study in algebraic topology, as generalizations of graphs to higher dimensions. We show how simplicial complexes serve as more faithful models of the network and are able to capture many of its global topological properties. Furthermore, we develop distributed algorithms for computing various topological invariants of the network. These concepts and algorithms are further explored in the context of a specific application: coverage verification in coordinate-free sensor networks, where sensor nodes have no access to location, distance, or orientation information. We propose real-time, scalable, and decentralized schemes for detection of coverage holes, as well as computation of a minimal set of sensors required to monitor a given region of interest. The presented algorithms clarify the benefits of using simplicial complexes and simplicial homology, instead of applying tools from graph theory, in modeling and analyzing complex networks