相关论文: Identification of Additive Link Metrics: Proof of …

This is a technical report, containing all the lemma and proposition proofs in paper "Topological Constraints on Identifying Additive Link Metrics via End-to-end Paths Measurements" by Liang Ma, Ting He, Kin K. Leung, Don Towsley, and…

This is a technical report, containing all the theorem proofs and additional evaluations in paper "Efficient Identification of Additive Link Metrics via Network Tomography" by Liang Ma, Ting He, Kin K. Leung, Don Towsley, and Ananthram…

This is a technical report, containing all the theorem proofs in paper "Link Identifiability in Communication Networks with Two Monitors" by Liang Ma, Ting He, Kin K. Leung, Ananthram Swami, and Don Towsley, published in IEEE Globecom,…

This is a technical report, containing all the theorem proofs and additional evaluations in paper "Network Capability in Localizing Node Failures via End-to-end Path Measurements" by Liang Ma, Ting He, Ananthram Swami, Don Towsley, and Kin…

This is a technical report, containing all the theorem proofs and additional evaluations in paper "Monitor Placement for Maximal Identifiability in Network Tomography" by Liang Ma, Ting He, Kin K. Leung, Ananthram Swami, Don Towsley,…

This is a technical report, containing all the theorem proofs in paper "On Optimal Monitor Placement for Localizing Node Failures via Network Tomography" by Liang Ma, Ting He, Ananthram Swami, Don Towsley, and Kin K. Leung, published in…

This is a technical report, containing all the theorem proofs in paper "Node Failure Localization in Communication Networks via Network Tomography" by Liang Ma, Ting He, Ananthram Swami, Don Towsley, Kin K. Leung, and Jessica Lowe,…

Inference of the network structure (e.g., routing topology) and dynamics (e.g., link performance) is an essential component in many network design and management tasks. In this paper we propose a new, general framework for analyzing and…

Information entropy has been proved to be an effective tool to quantify the structural importance of complex networks. In the previous work (Xu et al, 2016 \cite{xu2016}), we measure the contribution of a path in link prediction with…

In this paper we shall show that the metrics are equivalent which obtained by Feng and Mao in [[1], Y. Feng and W. Mao, Equivalence of Cone Metric spaces and Metric Spaces, Fixed Point Theory, 11(2)(2010), 259-264.] and Du in [[2], Wei-Shih…

Link prediction is a paradigmatic and challenging problem in network science, which aims to predict missing links, future links and temporal links based on known topology. Along with the increasing number of link prediction algorithms, a…

Information theory has been taken as a prospective tool for quantifying the complexity of complex networks. In this paper, we first study the information entropy or uncertainty of a path using the information theory. Then we apply the path…

Network service providers and customers are often concerned with aggregate performance measures that span multiple network paths. Unfortunately, forming such network-wide measures can be difficult, due to the issues of scale involved. In…

Complex networks are at the core of an intense research activity. However, in most cases, intricate and costly measurement procedures are needed to explore their structure. In some cases, these measurements rely on link queries: given two…

Link prediction in complex networks has attracted increasing attention from both physical and computer science communities. The algorithms can be used to extract missing information, identify spurious interactions, evaluate network evolving…

The task of predicting future relationships in a social network, known as link prediction, has been studied extensively in the literature. Many link prediction methods have been proposed, ranging from common neighbors to probabilistic…

We use an action, of 2l-component string links on l-component string links, defined by the first author and Xiao-Song Lin, to lift the indeterminacy of finite type link invariants. The set of links up to this new indeterminacy is in…

Link prediction is a paradigmatic problem in network science, which aims at estimating the existence likelihoods of nonobserved links, based on known topology. After a brief introduction of the standard problem and metrics of link…

In recent years, there has been a strong interest in measuring the available bandwidth of network paths. Several methods and techniques have been proposed and various measurement tools have been developed and evaluated. However, there have…

Objective: Modelling the associations from high-throughput experimental molecular data has provided unprecedented insights into biological pathways and signalling mechanisms. Graphical models and networks have especially proven to be useful…