The capacity of a wireless network with fractal and hierarchical social communications is studied in this paper. Specifically, we mathematically formulate the self-similarity of a fractal wireless network by a power-law degree distribution P (k), and we capture the direct social connection feature between two nodes with degree k1 and k2 by a joint probability distribution P (k1, k2). Firstly, f...

The capacity of a fractal wireless network with direct social interactions is studied in this paper. Specifically, we mathematically formulate the self-similarity of a fractal wireless network by a power-law degree distribution P(k), and we capture the connection feature between two nodes with degree k1 and k2 by a joint probability distribution P(k1, k2). It is proved that if the source node c...

Weighted automata model quantitative features of the behavior of systems and have been investigated for various structures like words, trees, traces, pictures, and nested words. In this paper, we introduce a general model of weighted automata acting on graphs, which form a quantitative version of Thomas’ unweighted model of graph acceptors. We derive a Nivat theorem for weighted graph automata ...

We investigate two classes of transformations of cosine similarity and Pearson and Spearman correlations into metric distances, utilising the simple tool of metric-preserving functions. The first class puts anti-correlated objects maximally far apart. Previously known transforms fall within this class. The second class collates correlated and anti-correlated objects. An example of such a transf...

A semantically enhanced weighted tree similarity algorithm for buyer-seller match-making is presented. First, our earlier global, structural similarity measure over (product) partonomy trees is enriched by taxonomic semantics: Inner nodes can be labeled by classes whose partial subsumption order is represented as a taxonomy tree that is used for similarity computation. In particular, the simila...

Given a graph H = (V, F ) with edge weights {we : e ∈ F}, the weighted degree of a node v in H is ∑ {wvu : vu ∈ F}. We give bicriteria approximation algorithms for problems that seek to find a minimum cost directed graph that satisfies both intersecting supermodular connectivity requirements and weighted degree constraints. The input to such problems is a directed graph G = (V,E) with edge-cost...

Link prediction has been widely used to extract missing information, identify spurious interactions, evaluate network evolving mechanisms, and so on. Wherein, similarity based algorithms have become the mainstream. However, most of them take into account the contributions of each common neighbor equally to the connection likelihood of two nodes. This paper proposes a model for link prediction, ...

In this paper, we propose an algebraic similarity measure σBS (BS stands for BitSim) for assigning semantic similarity score to concept definitions in ALCH+ an expressive fragment of Description Logics (DL). We define an algebraic interpretation function, IB, that maps a concept-definition to a unique string (ωB) (called bit-code) over an alphabet ∑ B of 11 symbols belonging to LB the language ...