Related papers: An Algorithm for computing the t-signature of two-…
Various networks such as cloud computing, water/gas/electricity networks, wireless sensor networks, transportation networks, and 4G/5G networks, have become an integral part of our daily lives. A binary-state network (BN) is often used to…
Many network applications are based on binary-state networks, where each component has one of two states: success or failure. Efficient algorithms to evaluate binary-state network reliability are continually being developed. Reliability…
This paper proposes a signature scheme where the signatures are generated by the cooperation of a number of people from a given group of senders and the signatures are verified by a certain number of people from the group of recipients.…
The $2$-admissibility of a graph is a promising measure to identify real-world networks which have an algorithmically favourable structure. In contrast to other related measures, like the weak/strong $2$-colouring numbers or the maximum…
It is known that the Barlow-Proschan index of a system with i.i.d. component lifetimes coincides with the Shapley value, a concept introduced earlier in cooperative game theory. Due to a result by Owen, this index can be computed…
Signed networks are graphs whose edges are labelled with either a positive or a negative sign, and can be used to capture nuances in interactions that are missed by their unsigned counterparts. The concept of balance in signed graph theory…
Network embedding is a promising way of network representation, facilitating many signed social network processing and analysis tasks such as link prediction and node classification. Recently, feature hashing has been adopted in several…
Network reliability modeling and calculation is a very important study domain in reliability engineering. It is also a popular index for validating and measuring the performance of real-world multi-state flow networks (MFNs), e.g., the…
Given a graph G = (V,E), a vertex subset S is called t-stable (or t-dependent) if the subgraph G[S] induced on S has maximum degree at most t. The t-stability number of G is the maximum order of a t-stable set in G. We investigate the…
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…
Distributed quantum information in networks is paramount for global secure quantum communication. Moreover, it finds applications as a resource for relevant tasks, such as clock synchronization, magnetic field sensing, and blind quantum…
Various real-life applications, for example, Internet of Things, wireless sensor networks, smart grids, transportation networks, communication networks, social networks, and computer grid systems, are always modeled as network structures.…
Network reliability is an important metric to evaluate the connectivity among given vertices in uncertain graphs. Since the network reliability problem is known as #P-complete, existing studies have used approximation techniques. In this…
The frustration index is a key measure for analysing signed networks, which has been underused due to its computational complexity. We use an exact optimisation-based method to analyse frustration as a global structural property of signed…
Signatures are primarily used as a mark of authenticity, to demonstrate that the sender of a message is who they claim to be. In the current digital age, signatures underpin trust in the vast majority of information that we exchange,…
For successful estimation, the usual network tomography algorithms crucially require i) end-to-end data generated using multicast probe packets, real or emulated, and ii) the network to be a tree rooted at a single sender with destinations…
Testing a graph on 2-vertex- and 2-edge-connectivity are two fundamental algorithmic graph problems. For both problems, different linear-time algorithms with simple implementations are known. Here, an even simpler linear-time algorithm is…
Signed networks appear naturally in contexts where conflict or animosity is apparent. In this book chapter we review some of the literature on signed networks, especially in the context of partitioning. Most of the work is founded in what…
In this paper, a new contract signing protocol is proposed based on the RSA signature scheme. The protocol will allow two parties to sign the same contract and then exchange their digital signatures. The protocol ensures fairness in that it…
Within network analysis, the analytical maximum entropy framework has been very successful for different tasks as network reconstruction and filtering. In a recent paper, the same framework was used for link-prediction for monopartite…