相关论文: Statistical analysis of articulation points in con…

Joint allocation of spectrum and user association is considered for a large cellular network. The objective is to optimize a network utility function such as average delay given traffic statistics collected over a slow timescale. A key…

Probabilistic conditioning is concerned with the identification of a distribution of a random variable $X$ given a random variable $Y$. It is a cornerstone of scientific and engineering applications where modeling uncertainty is key. This…

Complex networks are ubiquitous: a cell, the human brain, a group of people and the Internet are all examples of interconnected many-body systems characterized by macroscopic properties that cannot be trivially deduced from those of their…

The entropy of network ensembles characterizes the amount of information encoded in the network structure, and can be used to quantify network complexity, and the relevance of given structural properties observed in real network datasets…

Network reliability is the probability that a dynamical system composed of discrete elements interacting on a network will be found in a configuration that satisfies a particular property. We introduce a new reliability property, Ising…

Network reliability is a well-studied problem that requires to measure the probability that a target node is reachable from a source node in a probabilistic (or uncertain) graph, i.e., a graph where every edge is assigned a probability of…

Many real world networks, such as social networks, are primarily formed through local interactions between agents. Additionally, in contrast with common network models, social and biological networks exhibit a high degree of clustering.…

It is often claimed that the entropy of a network's degree distribution is a proxy for its robustness. Here, we clarify the link between degree distribution entropy and giant component robustness to node removal by showing that the former…

The Internet topology is of high importance in designing networks and architectures, evaluating performance, and economics. Interconnections between domains (ASes), routers, and points of presence (PoPs), have been measured, analyzed, and…

We introduce a collection of complex networks generated by a combination of preferential attachment and a previously unexamined process of "splitting" nodes of degree $k$ into $k$ nodes of degree 1. Four networks are considered, each…

In interdependent networks, it is usually assumed, based on percolation theory, that nodes become nonfunctional if they lose connection to the network giant component. However, in reality, some nodes, equipped with alternative resources,…

This paper tackles the problem of active planning to achieve cooperative localization for multi-robot systems (MRS) under measurement uncertainty in GNSS-limited scenarios. Specifically, we address the issue of accurately predicting the…

A scalable framework is developed to allocate radio resources across a large number of densely deployed small cells with given traffic statistics on a slow timescale. Joint user association and spectrum allocation is first formulated as a…

We analyze complexity in spatial network ensembles through the lens of graph entropy. Mathematically, we model a spatial network as a soft random geometric graph, i.e., a graph with two sources of randomness, namely nodes located randomly…

This work presents exact expressions for size distributions of weak/multilayer connected components in two generalisations of the configuration model: networks with directed edges and multiplex networks with arbitrary number of layers. The…

A certain degree of inhibition is a common trait of dynamical networks in nature, ranging from neuronal and biochemical networks, to social and technological networks. We study here the role of inhibition in a representative dynamical…

This article investigates emergence and complexity in complex systems that can share information on a network. To this end, we use a theoretical approach from information theory, computability theory, and complex networks. One key studied…

One important factor determining the computational complexity of evaluating a probabilistic network is the cardinality of the state spaces of the nodes. By varying the granularity of the state spaces, one can trade off accuracy in the…

In this paper we introduce a model of spatial network growth in which nodes are placed at randomly selected locations on a unit square in $\mathbb{R}^2$, forming new connections to old nodes subject to the constraint that edges do not…

Connectivity is one of the most fundamental properties of wireless multi-hop networks. A network is said to be connected if there is a path between any pair of nodes. A convenient way to study the connectivity of a random network is by…