How Can Social Networks Ever Become Complex? Modelling the Emergence of Complex Networks from Local Social Exchanges

Small-world and power-law network structures have been prominently proposed as models of large networks. However, the assumptions of these models usually lack sociological grounding. We present a computational model grounded in social exchange theory. Agents search attractive exchange partners in a diverse population. Agent use simple decision heuristics, based on imperfect, local information. Computer simulations show that the topological structure of the emergent social network depends heavily upon two sets of conditions, harshness of the exchange game and learning capacities of the agents. Further analysis show that a combination of these conditions affects whether star-like, small-world or power-law structures emerge.Complex Networks, Power-Law, Scale-Free, Small-World, Agent-Based Modeling, Social Exchange Theory, Structural Emergence

Advances in photonic reservoir computing on an integrated platform

Reservoir computing is a recent approach from the fields of machine learning and artificial neural networks to solve a broad class of complex classification and recognition problems such as speech and image recognition. As is typical for methods from these fields, it involves systems that were trained based on examples, instead of using an algorithmic approach. It originated as a new training technique for recurrent neural networks where the network is split in a reservoir that does the `computation' and a simple readout function. This technique has been among the state-of-the-art. So far implementations have been mainly software based, but a hardware implementation offers the promise of being low-power and fast. We previously demonstrated with simulations that a network of coupled semiconductor optical amplifiers could also be used for this purpose on a simple classification task. This paper discusses two new developments. First of all, we identified the delay in between the nodes as the most important design parameter using an amplifier reservoir on an isolated digit recognition task and show that when optimized and combined with coherence it even yields better results than classical hyperbolic tangent reservoirs. Second we will discuss the recent advances in photonic reservoir computing with the use of resonator structures such as photonic crystal cavities and ring resonators. Using a network of resonators, feedback of the output to the network, and an appropriate learning rule, periodic signals can be generated in the optical domain. With the right parameters, these resonant structures can also exhibit spiking behaviour

Data-Efficient Power Flow Learning for Network Contingencies

This work presents an efficient data-driven method to learn power flows in grids with network contingencies and to estimate corresponding probabilistic voltage envelopes (PVE). First, a network-aware Gaussian process (GP) termed Vertex-Degree Kernel (VDK-GP), developed in prior work, is used to estimate voltage-power functions for a few network configurations. The paper introduces a novel multi-task vertex degree kernel (MT-VDK) that amalgamates the learned VDK-GPs to determine power flows for unseen networks, with a significant reduction in the computational complexity and hyperparameter requirements compared to alternate approaches. Simulations on the IEEE 30-Bus network demonstrate the retention and transfer of power flow knowledge in both N-1 and N-2 contingency scenarios. The MT-VDK-GP approach achieves over 50% reduction in mean prediction error for novel N-1 contingency network configurations in low training data regimes (50-250 samples) over VDK-GP. Additionally, MT-VDK-GP outperforms a hyper-parameter based transfer learning approach in over 75% of N-2 contingency network structures, even without historical N-2 outage data. The proposed method demonstrates the ability to achieve PVEs using sixteen times fewer power flow solutions compared to Monte-Carlo sampling-based methods

Optical information processing: advances in nanophotonic reservoir computing

We present a complex network of interconnected optical structures for information processing. This network is an implementation of reservoir computing, a novel method in the field of machine learning. Reservoir computing can be used for example in classification problems such as speech and image recognition, or for the generation of arbitrary patterns, tasks which are usually very hard to generalize. A nanophotonic reservoir can be constructed to perform optical signal processing. Previously, simulations demonstrated that a reservoir consisting of Semiconductor Optical Amplifiers (SOA) can outperform traditional software-based reservoirs for a speech task. Here we propose a network of coupled photonic crystal cavities. Because of the resonating behaviour, a lot of power is stored in the cavity, which gives rise to interesting nonlinear effects. Simulations are done using a novel software tool developed at Ghent University, called Caphe. We train this network of coupled resonators to generate a periodic pattern using a technique called FORCE. It is shown that photonic reservoirs can outperform classical software-based reservoirs on a pattern generation task

Configurations of aromatic networks for power distribution system

A distribution network is one of the main parts of a power system that distributes power to customers. While there are various types of power distribution networks, a recently introduced novel structure of an aromatic network could begin a new era in the distribution levels of power systems and designs of microgrids or smart grids. In order to minimize blackout periods during natural disasters and provide sustainable energy, improve energy efficiency and maintain stability of a distribution network, it is essential to configure/reconfigure the network topology based on its geographical location and power demand, and also important to realize its self-healing function. In this paper, a strategy for reconfiguring aromatic networks based on structures of natural aromatic molecules is explained. Various network structures are designed, and simulations have been conducted to justify the performance of each configuration. It is found that an aromatic network does not need to be fixed in a specific configuration (i.e., a DDT structure), which provides flexibility in designing networks and demonstrates that the successful use of such structures will be a perfect solution for both distribution networks and microgrid systems in providing sustainable energy to the end users

Critical Node Identifcation for accessing network vulnerability, a necessary consideration

Timely identification of critical nodes is crucial for assessing network vulnerability and survivability. This thesis presents two new approaches for the identification of critical nodes in a network with the first being an intuition based approach and the second being build on a mathematical framework. The first approach which is referred to as the Combined Banzhaf & Diversity Index (CBDI) uses a newly devised diversity metric, that uses the variability of a node’s attributes relative to its neighbours and the Banzhaf power index which characterizes the degree of participation of a node in forming the shortest path route. The Banzhaf power index is inspired from the theory of voting games in game theory whereas, the diversity index is inspired from the analysis and understanding of the influence of the average path length of a network on its performance. This thesis also presents a new approach for evaluating this average path length metric of a network with reduced computational complexity and proposes a new mechanism for reducing the average path length of a network for relatively larger network structures. The proposed average path length reduction mechanism is tested for a wireless sensor network and the results compared for multiple existing approaches. It has been observed using simulations that, the proposed average path length reduction mechanism outperforms existing approaches by reducing the average path length to a greater extent and with a simpler hardware requirement. The second approach proposed in this thesis for the identification of critical nodes is build on a mathematical framework and it is based on suboptimal solutions of two optimization problems, namely the algebraic connectivity minimization problem and a min-max network utility problem. The former attempts to address the topological as- pect of node criticality whereas, the latter attempts to address its connection-oriented nature. The suboptimal solution of the algebraic connectivity minimization problem is obtained through spectral partitioning considerations. This approach leads to a distributed solution which is computationally less expensive than other approaches that exist in the literature and is near optimal, in the sense that it is shown through simulations to approximate a lower bound which is obtained analytically. Despite the generality of the proposed approaches, this thesis evaluates their performance on a wireless ad hoc network and demonstrates through extensive simulations that the proposed solutions are able to choose more critical nodes relative to other approaches, as it is observed that when these nodes are removed they lead to the highest degrada- tion in network performance in terms of the achieved network throughput, the average network delay, the average network jitter and the number of dropped packets