Related papers: Maximizing Algebraic Connectivity in Interconnecte…
The Augmented Lagrangian Alternating Direction Inexact Newton (ALADIN) method is a cutting-edge distributed optimization algorithm known for its superior numerical performance. It relies on each agent transmitting information to a central…
Achieving consensus via nearest neighbor rules is an important prerequisite for multi-agent networks to accomplish collective tasks. A common assumption in consensus setup is that each agent interacts with all its neighbors. This paper…
Networked structures arise in a wide array of different contexts such as technological and transportation infrastructures, social phenomena, and biological systems. These highly interconnected systems have recently been the focus of a great…
Mathematical network models are extremely useful to capture complex propagation processes between different regions (nodes), for example the spread of an infectious agent between different countries, or the transport and replication of…
A family of graphs optimized as the topologies for supercomputer interconnection networks is proposed. The special needs of such network topologies, minimal diameter and mean path length, are met by special constructions of the weight…
In this paper we generalise the results on eigenvalues and eigenvectors of unnormalized (combinatorial) Laplacian of two-dimensional grid presented by Edwards:2013 first to a grid graph of any dimension, and second also to other types of…
An overarching issue in resource management of wireless networks is assessing their capacity: How much communication can be achieved in a network, utilizing all the tools available: power control, scheduling, routing, channel assignment and…
This work poses a distributed multi-resource allocation scheme for minimizing the weighted sum of latency and energy consumption in the on-device distributed federated learning (FL) system. Each mobile device in the system engages the model…
Teaming is the process of establishing connections among agents within a system to enable collaboration toward achieving a collective goal. This paper examines teaming in the context of a network of agents learning to coordinate with…
" How well connected is the network? " This is one of the most fundamental questions one would ask when facing the challenge of designing a communication network. Three major notions of connectivity have been considered in the literature,…
In this paper, the distributed resource allocation problem on strongly connected and weight-balanced digraphs is investigated, where the decisions of each agent are restricted to satisfy the coupled network resource constraints and…
We analyze the asymptotic properties of a Euclidean optimization problem on the plane. Specifically, we consider a network with three bins and $n$ objects spatially uniformly distributed, each object being allocated to a bin at a cost…
In multi-agent systems, strong connectivity of the communication network is often crucial for establishing consensus protocols, which underpin numerous applications in decision-making and distributed optimization. However, this connectivity…
We present a novel approach for computing a variant of eigenvector centrality for multilayer networks with inter-layer constraints on node importance. Specifically, we consider a multilayer network defined by multiple edge-weighted,…
Many real-world network are multilayer, with nontrivial correlations across layers. Here we show that these correlations amplify geometry in networks. We focus on mutual clustering--a measure of the amount of triangles that are present in…
Networks with a given degree distribution may be very resilient to one type of failure or attack but not to another. The goal of this work is to determine network design guidelines which maximize the robustness of networks to both random…
Real-world complex systems exhibit intricate interconnections and dependencies, especially social networks, technological infrastructures, and communication networks. These networks are prone to disconnection due to random failures or…
We propose a distributed algorithm based on Alternating Direction Method of Multipliers (ADMM) to minimize the sum of locally known convex functions using communication over a network. This optimization problem emerges in many applications…
This paper concerns sub-channel allocation in multi-user wireless networks with a view to increasing the network throughput. It is assumed there are some sub-channels to be equally divided among active links, such that the total sum rate…
We investigate certain structural properties of random interdependent networks. We start by studying a property known as $r$-robustness, which is a strong indicator of the ability of a network to tolerate structural perturbations and…