RoleSim*: Scaling axiomatic role-based similarity ranking on large graphs

RoleSim and SimRank are among the popular graph-theoretic similarity measures with many applications in, e.g., web search, collaborative filtering, and sociometry. While RoleSim addresses the automorphic (role) equivalence of pairwise similarity which SimRank lacks, it ignores the neighboring similarity information out of the automorphically equivalent set. Consequently, two pairs of nodes, which are not automorphically equivalent by nature, cannot be well distinguished by RoleSim if the averages of their neighboring similarities over the automorphically equivalent set are the same. To alleviate this problem: 1) We propose a novel similarity model, namely RoleSim*, which accurately evaluates pairwise role similarities in a more comprehensive manner. RoleSim* not only guarantees the automorphic equivalence that SimRank lacks, but also takes into account the neighboring similarity information outside the automorphically equivalent sets that are overlooked by RoleSim. 2) We prove the existence and uniqueness of the RoleSim* solution, and show its three axiomatic properties (i.e., symmetry, boundedness, and non-increasing monotonicity). 3) We provide a concise bound for iteratively computing RoleSim* formula, and estimate the number of iterations required to attain a desired accuracy. 4) We induce a distance metric based on RoleSim* similarity, and show that the RoleSim* metric fulfills the triangular inequality, which implies the sum-transitivity of its similarity scores. 5) We present a threshold-based RoleSim* model that reduces the computational time further with provable accuracy guarantee. 6) We propose a single-source RoleSim* model, which scales well for sizable graphs. 7) We also devise methods to scale RoleSim* based search by incorporating its triangular inequality property with partitioning techniques. Our experimental results on real datasets demonstrate that RoleSim* achieves higher accuracy than its competitors while scaling well on sizable graphs with billions of edges.

Fuzzy double controlled metric spaces and related results

In this paper, we introduce the concept of fuzzy double controlled metric space that can be regarded as the generalization of fuzzy b-metric space, extended fuzzy b-metric space and controlled fuzzy metric space. We use two non-comparable functions α and β in the triangular inequality as: M q ( x , z , t α ( x , y ) + s β ( y , z ) ) ≥ M q ( x , y , t ) ∗ M q ( y , z , s ) . We prove Banach contraction principle in fuzzy double controlled metric space and generalize the Banach contraction principle in aforementioned spaces. We give some examples to support our main results. An application to existence and uniqueness of solution for an integral equation is also presented in this work.

On Fixed Point Results in Partial b -Metric Spaces

Partial b -metric spaces are characterised by a modified triangular inequality and that the self-distance of any point of space may not be zero and the symmetry is preserved. The spaces with a symmetric property have interesting topological properties. This manuscript paper deals with the existence and uniqueness of fixed point points for contraction mappings using triangular weak α -admissibility with regard to η and C -class functions in the class of partial b -metric spaces. We also introduce an example to demonstrate the obtained results.

Improved RRT-Connect Algorithm Based on Triangular Inequality for Robot Path Planning

This paper proposed a triangular inequality-based rewiring method for the rapidly exploring random tree (RRT)-Connect robot path-planning algorithm that guarantees the planning time compared to the RRT algorithm, to bring it closer to the optimum. To check the proposed algorithm’s performance, this paper compared the RRT and RRT-Connect algorithms in various environments through simulation. From these experimental results, the proposed algorithm shows both quicker planning time and shorter path length than the RRT algorithm and shorter path length than the RRT-Connect algorithm with a similar number of samples and planning time.

Improved RRT-Connect Algorithm Based on Triangular Inequality for Robot Path Planning

This paper proposed a triangular inequality-based rewiring method for the Rapidly exploring Random Tree (RRT)-Connect robot path-planning algorithm that guarantees the planning time compared to the RRT algorithm, to bring it closer to the optimum. To check the proposed algorithm’s performance, this paper compared the RRT and RRT-Connect algorithms in various environments through simulation. From these experimental results, the proposed algorithm shows both quicker planning time and shorter path length than the RRT algorithm and shorter path length than the RRT-Connect algorithm with a similar number of samples and planning time.

Improved RRT-Connect Algorithm Based on Triangular Inequality for Robot Path Planning

This paper proposed a triangular inequality-based rewiring method for the Rapidly exploring Random Tree (RRT)-Connect robot path-planning algorithm that guarantees the planning time compared to the RRT algorithm, to bring it closer to the optimum. To check the proposed algorithm’s performance, this paper compared the RRT and RRT-Connect algorithms in various environments through simulation. From these experimental results, the proposed algorithm shows both quicker planning time and shorter path length than the RRT algorithm and shorter path length than the RRT-Connect algorithm with a similar number of samples and planning time.

On the Enhancement of Optimality in the RRT-Connect Robot Path Planning Algorithm

This paper proposed a Triangular Inequality based rewiring method for the RRT(Rapidly exploring Random Tree)-Connect robot path planning algorithm that guarantees the convergence time than the RRT algorithm, to enhance the optimality. To check the performance of the proposed algorithm, this paper compared with the RRT and RRT-Connect algorithms in various environments through simulation. From these experimental results, the proposed algorithm shows both quick convergence time and better optimality than the RRT algorithm, and more optimal than RRT-Connect algorithm with the similar number of sampling and convergence time.

Scrutiny of some fixed point results by S-operators without triangular inequality

In this work, the discussion centers on introducing non-triangular metric as a generalization of JS-metric, which may lessen the frantic pace of working on generalizing the triangle inequality by omitting it from the original ordinary metric’s definition. Then, we present S-operators as a new sort of mappings included some properties in order to characterize some known contractions. After that, we graft non-triangular metric onto S-operators in order to make the worthwhile fixed point results facile to prove and conceive.