A new local-world model is proposed in this paper to improve and extend the descriptive ability of the first geometrical local-world network model, i.e., the Gardeñes–Moreno (GM) model. A concept of correlation degree between nodes is introduced into the proposed model to build a local world...

Homogeneous entangled networks characterized by small world, large girths, and no community structure have attracted much attention due to some of their favorable performances. However, the optimization algorithm proposed by Donetti et al. is very time-consuming and will lose its efficiency...

A large number of networks in the real world have a scale-free structure, and the parameters of the networks change stochastically with time. Searching for the shortest paths in a scale-free dynamic and stochastic network is not only necessary for the estimation of the statistical...

LetM <Subscript>1</Subscript> andM <Subscript>2</Subscript> be matroids onS,B be theirk-element common independent set, andw a weight function onS. Given two functionsb ≥ 0 andc ≥ 0 onS, the Inverse Matroid Intersection Problem (IMIP) is to determine a modified weight functionw′ such that (a)B becomes a maximum weight common...</subscript></subscript>

We consider a repairable product with known market entry and departure times. A warranty policy is offered with product purchase, under which a customer can have a failed item repaired free of charge in the warranty period. It is assumed that customers are heterogeneous in their risk attitudes...

The problem of improving the consensus and synchronizability for weighted networks of dynamic systems via adding links among them is investigated in this paper. A weighted network entropy is introduced to measure the homogeneity of the weighted networks. The relationship between the homogeneity...