Related papers: Network rewiring in the $r$-$K$ plane
In this paper, we propose a first second-order scheme based on arbitrary non-Euclidean norms, incorporated by Bregman distances. They are introduced directly in the Newton iterate with regularization parameter proportional to the square…
While new forms of attacks are developed every day to compromise essential infrastructures, service providers are also expected to develop strategies to mitigate the risk of extreme failures. In this context, tools of Network Science have…
A growing family of random graphs is called robust if it retains a giant component after percolation with arbitrary positive retention probability. We study robustness for graphs, in which new vertices are given a spatial position on the…
Undirected hyperbolic graph models have been extensively used as models of scale-free small-world networks with high clustering coefficient. Here we presented a simple directed hyperbolic model, where nodes randomly distributed on a…
In many networks such as transportation or communication networks, distance is certainly a relevant parameter. In addition, real-world examples suggest that when long-range links are existing, they usually connect to hubs-the well connected…
We analytically describe the architecture of randomly damaged uncorrelated networks as a set of successively enclosed substructures -- k-cores. The k-core is the largest subgraph where vertices have at least k interconnections. We find the…
Network rearrangement operations like SNPR (SubNet Prune and Regraft), a recent generalisation of rSPR (rooted Subtree Prune and Regraft), induce a metric on phylogenetic networks. To search the space of these networks one important…
Biased (degree-dependent) percolation was recently shown to provide new strategies for turning robust networks fragile and vice versa. Here we present more detailed results for biased edge percolation on scale-free networks. We assume a…
The "power of choice" has been shown to radically alter the behavior of a number of randomized algorithms. Here we explore the effects of choice on models of tree and network growth. In our models each new node has k randomly chosen…
Using a simple model with link removals as well as link additions, we show that an evolving network is scale free with a degree exponent in the range of (2, 4]. We then establish a relation between the network evolution and a set of…
Suppose $V$ is an $n$-element set where for each $x \in V$, the elements of $V \setminus \{x\}$ are ranked by their similarity to $x$. The $K$-nearest neighbor graph is a directed graph including an arc from each $x$ to the $K$ points of $V…
A useful property of a network that can be used to characterize many systems is the degree distribution. However, many complex networks exhibit higher--order degree correlations that must be studied through other means, such as clustering…
Let $\mathcal{Q}$ be a vertex subset problem on graphs. In a reconfiguration variant of $\mathcal{Q}$ we are given a graph $G$ and two feasible solutions $S_s, S_t\subseteq V(G)$ of $\mathcal{Q}$ with $|S_s|=|S_t|=k$. The problem is to…
Performance of standard processes over large distributed networks typically scales with the size of the network. For example, in planar topologies where nodes communicate with their natural neighbors, the scaling factor is $O(n)$, where $n$…
Degree ssortativity is the tendency for nodes of high degree (resp.low degree) in a graph to be connected to high degree nodes (resp. to low degree ones). It is sually quantified by the Pearson correlation coefficient of the degree-degree…
We investigate equilibrium properties of small world networks, in which both connectivity and spin variables are dynamic, using replicated transfer matrices within the replica symmetric approximation. Population dynamics techniques allow us…
This article discusses the properties of extremes of degree sequences calculated from network data. We introduce the notion of a normalized degree, in order to permit a comparison of degree sequences between networks with differing numbers…
Consider the network of all secondary structures of a given RNA sequence, where nodes are connected when the corresponding structures have base pair distance one. The expected degree of the network is the average number of neighbors, where…
We consider a generalised d-dimensional model for asymptotically-scale-free geographical networks. Central to many networks of this kind, when considering their growth in time, is the attachment rule, i.e. the probability that a new node is…
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…