Empirical studies report frequent occurrences of path failure in the Internet. In providing resilience to such failures, we propose the computation of alternate backup end-to-end path that is disjoint to the default IP path. This disjoint path is created using transit hubs that can be located at diverse points in the Internet. Transit hubs provide better utilization of network resources. Assumi...

In this paper we consider finding a geometric minimum-sum dipolar spanning tree in R, and present an algorithm that takes O(n log n) time using O(n) space, thus almost matching the best known results for the planar case. Our solution uses an interesting result related to the complexity of the common intersection of n balls in R, of possible different radii, that are all tangent to a given point...

A network model of epidemic spread accounting for inhomogeneous population district division is investigated. Motivated by the COVID-19 pandemic, we analyze effects infection development in area, example, a city divided into several districts. The districts are characterized certain intensity contact inside and with inter-district communication that can be generally controlled authorities. Spec...

The topic of finding an effective strategy to halt virus in a complex network is of current interest. We propose an immunization strategy for seasonal epidemics that occur periodically. Based on the local information of the infection status from the previous epidemic season, the selection of vaccinated nodes is optimized gradually. The evolution of vaccinated nodes during iterations demonstrate...

We develop a new approach to the study of the dynamics of link utilization in complex networks using records of communication in a large social network. Counter to the perspective that nodes have particular roles, we find roles change dramatically from day to day. “Local hubs” have a power law degree distribution over time, with no characteristic degree value. Our results imply a significant re...

Recent developments in complex networks have paved the way to a series of important biological insights, such as the fact that many of the essential proteins of S. cerevisae corresponds to the so-called hubs of the respective protein-protein interaction networks. Despite the special importance of hubs, other types of nodes such as those corresponding to the network border, as well as the innerm...

The result is termed the structural interaction network (SIN), which consists of 873 proteins and1269 interactions, 438 which were found to be mutually exclusive. In initial analyses of the SIN, notable properties include a maximum of 14 interaction partners per “hub” protein, in contrast to earlier interactome studies reporting much higher ranges. The approach also distinguishes between “multi...

A simple model for competition-induced speciation is presented and analyzed. Logistic growth with nonlocal interaction is studied on regular and random networks, and the large scale structure of the emerging genomic frequencies is examined. The neutrality assumption is violated if the network is random and the competition is nonlocal. Instead, "hubs" in the sequence space are suppressed by the ...

This paper presents a study on reliable single and multiple allocation hub-and-spoke network design problems where disruptions at hubs and the resulting hub unavailability can be mitigated by backup hubs and alternative routes. It builds nonlinear mixed integer programming models and presents linearized formulas. To solve those difficult problems, Lagrangian relaxation and Branch-and-Bound meth...