When Less Is More: Systematic Analysis of Cascade-Based Community Detection

Information diffusion, spreading of infectious diseases, and spreading of rumors are fundamental processes occurring in real-life networks. In many practical cases, one can observe when nodes become infected, but the underlying network, over which a contagion or information propagates, is hidden. Inferring properties of the underlying network is important since these properties can be used for constraining infections, forecasting, viral marketing, and so on. Moreover, for many applications, it is sufficient to recover only coarse high-level properties of this network rather than all its edges. This article conducts a systematic and extensive analysis of the following problem: Given only the infection times, find communities of highly interconnected nodes. This task significantly differs from the well-studied community detection problem since we do not observe a graph to be clustered. We carry out a thorough comparison between existing and new approaches on several large datasets and cover methodological challenges specific to this problem. One of the main conclusions is that the most stable performance and the most significant improvement on the current state-of-the-art are achieved by our proposed simple heuristic approaches agnostic to a particular graph structure and epidemic model. We also show that some well-known community detection algorithms can be enhanced by including edge weights based on the cascade data.

Hardware Architecture for Asynchronous Cellular Self-Organizing Maps

Nowadays, one of the main challenges in computer architectures is scalability; indeed, novel processor architectures can include thousands of processing elements on a single chip and using them efficiently remains a big issue. An interesting source of inspiration for handling scalability is the mammalian brain and different works on neuromorphic computation have attempted to address this question. The Self-configurable 3D Cellular Adaptive Platform (SCALP) has been designed with the goal of prototyping such types of systems and has led to the proposal of the Cellular Self-Organizing Maps (CSOM) algorithm. In this paper, we present a hardware architecture for CSOM in the form of interconnected neural units with the specific property of supporting an asynchronous deployment on a multi-FPGA 3D array. The Asynchronous CSOM (ACSOM) algorithm exploits the underlying Network-on-Chip structure to be provided by SCALP in order to overcome the multi-path propagation issue presented by a straightforward CSOM implementation. We explore its behaviour under different map topologies and scalar representations. The results suggest that a larger network size with low precision coding obtains an optimal ratio between algorithm accuracy and FPGA resources.

Design, Development, and Evaluation of 5G-Enabled Vehicular Services: The 5G-HEART Perspective

The ongoing transition towards 5G technology expedites the emergence of a variety of mobile applications that pertain to different vertical industries. Delivering on the key commitment of 5G, these diverse service streams, along with their distinct requirements, should be facilitated under the same unified network infrastructure. Consequently, in order to unleash the benefits brought by 5G technology, a holistic approach towards the requirement analysis and the design, development, and evaluation of multiple concurrent vertical services should be followed. In this paper, we focus on the Transport vertical industry, and we study four novel vehicular service categories, each one consisting of one or more related specific scenarios, within the framework of the “5G Health, Aquaculture and Transport (5G-HEART)” 5G PPP ICT-19 (Phase 3) project. In contrast to the majority of the literature, we provide a holistic overview of the overall life-cycle management required for the realization of the examined vehicular use cases. This comprises the definition and analysis of the network Key Performance Indicators (KPIs) resulting from high-level user requirements and their interpretation in terms of the underlying network infrastructure tasked with meeting their conflicting or converging needs. Our approach is complemented by the experimental investigation of the real unified 5G pilot’s characteristics that enable the delivery of the considered vehicular services and the initial trialling results that verify the effectiveness and feasibility of the presented theoretical analysis.

Causal motifs and existence of endogenous cascades in directed networks with application to company defaults

Motivated by the problem of detection of cascades of defaults in economy, we developed a detection framework for an endogenous spreading based on causal motifs we define in this paper. We assume that the change of state of a vertex can be triggered either by an endogenous (related to the network) or an exogenous (unrelated to the network) event, that the underlying network is directed and that times when vertices changed their states are available. After simulating default cascades driven by different stochastic processes on different synthetic networks, we show that some of the smallest causal motifs can robustly detect endogenous spreading events. Finally, we apply the method to the data of defaults of Croatian companies and observe the time window in which an endogenous cascade was likely happening.

COVID-19 vaccination strategies depend on the underlying network of social interactions

Since the onset of the coronavirus disease 2019 (COVID-19) pandemic, different mitigation and management strategies limiting economic and social activities have been implemented across many countries. Despite these strategies, the virus continues to spread and mutate. As a result, vaccinations are now administered to suppress the pandemic. Current COVID-19 epidemic models need to be expanded to account for the change in behaviour of new strains, such as an increased virulence and higher transmission rate. Furthermore, models need to account for an increasingly vaccinated population. We present a network model of COVID-19 transmission accounting for different immunity and vaccination scenarios. We conduct a parameter sensitivity analysis and find the average immunity length after an infection to be one of the most critical parameters that define the spread of the disease. Furthermore, we simulate different vaccination strategies and show that vaccinating highly connected individuals first is the quickest strategy for controlling the disease.

Higher-Order Networks

Higher-order networks describe the many-body interactions of a large variety of complex systems, ranging from the the brain to collaboration networks. Simplicial complexes are generalized network structures which allow us to capture the combinatorial properties, the topology and the geometry of higher-order networks. Having been used extensively in quantum gravity to describe discrete or discretized space-time, simplicial complexes have only recently started becoming the representation of choice for capturing the underlying network topology and geometry of complex systems. This Element provides an in-depth introduction to the very hot topic of network theory, covering a wide range of subjects ranging from emergent hyperbolic geometry and topological data analysis to higher-order dynamics. This Elements aims to demonstrate that simplicial complexes provide a very general mathematical framework to reveal how higher-order dynamics depends on simplicial network topology and geometry.

The Roles of Social Networks

A substantial literature exists for both international and internal migrations, demonstrating a positive association between the likelihood an individual will migrate and the extent of any social network available to the potential migrant at destination. Several methodological limitations and alternative views on underlying mechanisms are drawn out in reviewing this literature with respect to rural-urban migration in this chapter. Fresh evidence is presented on a broad range of developing countries in light of these considerations, reaffirming a positive association though with a qualification; the causal association is much smaller than a simple correlation might suggest. An interesting branch of extant contributions has sought to disaggregate networks along various dimensions: for example, by gender, by migrant categories, by education level, and by diversity of location. New evidence is presented with respect to each of these dimensions, supporting some prior contentions, questioning others, and having implications for interpretations of mechanisms underlying network effects. Social networks at origin have been less-well examined but are also shown to be important in shaping migration propensities.

Loose Space Lexicon: Design Tactics for Facilitating Appropriation in Urban Gaps

<p>Wellington has an underlying network of ‘leftover’ (Cupers and Miessen) spaces awaiting activation. Their potential is masked by the deterministic view cast upon them by the wider architectural discipline. However, there has been a recent shift in thinking from a ‘top-down’ approach to one that realises the potential of what exists already – ‘from the ground up’ (Kahn). This thesis explores a tactical application of ‘Loose Space’ qualities in an effort to engage in and increase the appropriability of the individual gap. Ultimately, a set of tactics will be developed that have the potential to be applied to gaps within various contexts.</p>

Loose Space Lexicon: Design Tactics for Facilitating Appropriation in Urban Gaps

<p>Wellington has an underlying network of ‘leftover’ (Cupers and Miessen) spaces awaiting activation. Their potential is masked by the deterministic view cast upon them by the wider architectural discipline. However, there has been a recent shift in thinking from a ‘top-down’ approach to one that realises the potential of what exists already – ‘from the ground up’ (Kahn). This thesis explores a tactical application of ‘Loose Space’ qualities in an effort to engage in and increase the appropriability of the individual gap. Ultimately, a set of tactics will be developed that have the potential to be applied to gaps within various contexts.</p>

Content Replication and Placement Schemes for Wireless Mesh Networks

<p>Recently, Wireless Mesh Networks (WMNs) have attracted much of interest from both academia and industry, due to their potential to provide an alternative broadband wireless Internet connectivity. However, due to different reasons such as multi-hop forwarding and the dynamic wireless link characteristics, the performance of current WMNs is rather low when clients are soliciting Web contents. Due to the evolution of advanced mobile computing devices; it is anticipated that the demand for bandwidth-onerous popular content (especially multimedia content) in WMNs will dramatically increase in the coming future. Content replication is a popular approach for outsourcing content on behalf of the origin content provider. This area has been well explored in the context of the wired Internet, but has received comparatively less attention from the research community when it comes to WMNs. There are a number of replica placement algorithms that are specifically designed for the Internet. But they do not consider the special features of wireless networks such as insufficient bandwidth, low server capacity, contention to access the wireless medium, etc. This thesis studies the technical challenges encountered when transforming the traditional model of multi-hop WMNs from an access network into a content network. We advance the thesis that support from packet relaying mesh routers to act as replica servers for popular content such as media streaming, results in significant performance improvement. Such support from infrastructure mesh routers benefits from knowledge of the underlying network topology (i.e., information about the physical connections between network nodes is available at mesh routers). The utilization of cross-layer information from lower layers opens the door to developing efficient replication schemes that account for the specific features of WMNs (e.g., contention between the nodes to access the wireless medium and traffic interference). Moreover, this can benefit from the underutilized resources (e.g., storage and bandwidth) at mesh routers. This utilization enables those infrastructure nodes to participate in content distribution and play the role of replica servers. In this thesis, our main contribution is the design of two lightweight, distributed, and scalable object replication schemes for WMNs. The first scheme follows a hierarchical approach, while the second scheme follows a flat one. The challenge is to replicate content as close as possible to the requesting clients and thus, reduce the access latency per object, while minimizing the number of replicas. The two schemes aim to address the questions of where and how many replicas should be placed in the WMN. In our schemes, we consider the underlying topology joint with link-quality metrics to improve the quality of experience. We show using simulation tests that the schemes significantly enhance the performance of a WMN in terms of reducing the access cost, bandwidth consumption and computation/communication cost.</p>