Searcharxiv⌕ Search

arXiv subjects

B. Kaan Karamete

Publications and source records attributed to B. Kaan Karamete.

4 recordsLinked to original sources

MarketRank: ranking stocks by the stationary probabilities of a Markov chain over estimated money flows, with a topological landscape view

Every trading day, money leaves some stocks and moves into others. MarketRank asks where that money concentrates and how the concentration shifts over time. It treats the market as a Markov chain whose states are stocks. The chance of moving from one stock to another is the share of the first stock's outgoing dollars that goes to the second, and a stock's MarketRank score is its long run (stationary) probability in that chain, computed by damped power iteration on a sparse transition matrix. PageRank ranks web pages with the same idea, using links instead of dollars. Who sold what to buy what is not public, so the flows are estimated from daily prices and volumes with a correlation tilted gravity model, in a deterministic parallel C++ engine. On a universe of 10K US stocks and ETFs, the ranking is led by the large semiconductor and technology names, and estimated flows stay within a sector more often than chance. The level of the score, however, does not predict next day returns: it shows where money sits, not where prices go next. A 3D landscape view, Fluxscape, turns the ranking into terrain: Louvain communities of the recent flow graph, reclustered on every bar, become territories, ordered by recursive spectral bisection along a generalized Hilbert curve, interpolated by inverse distance weighting, smoothed by a centroidal Voronoi style relaxation with portfolio holdings pinned to their exact values, and rendered as a Gouraud shaded mesh. The surface is for reading trends; the exact ranked table remains the reference. The practical question is whether MarketRank can improve real portfolio moves, and we answer it with tests fixed in this study.

cs.CE↗

An Ad-hoc graph node vector embedding algorithm for general knowledge graphs using Kinetica-Graph

This paper discusses how to generate general graph node embeddings from knowledge graph representations. The embedded space is composed of a number of sub-features to mimic both local affinity and remote structural relevance. These sub-feature dimensions are defined by several indicators that we speculate to catch nodal similarities, such as hop-based topological patterns, the number of overlapping labels, the transitional probabilities (markov-chain probabilities), and the cluster indices computed by our recursive spectral bisection (RSB) algorithm. These measures are flattened over the one dimensional vector space into their respective sub-component ranges such that the entire set of vector similarity functions could be used for finding similar nodes. The error is defined by the sum of pairwise square differences across a randomly selected sample of graph nodes between the assumed embeddings and the ground truth estimates as our novel loss function. The ground truth is estimated to be a combination of pairwise Jaccard similarity and the number of overlapping labels. Finally, we demonstrate a multi-variate stochastic gradient descent (SGD) algorithm to compute the weighing factors among sub-vector spaces to minimize the average error using a random sampling logic.

cs.LG↗

Optimal routing algorithm for trips involving thousands of ev-charging stations using Kinetica-Graph

This paper discusses a graph based route solving algorithm to find the optimal path for an electric vehicle picking the best charging locations among thousands to minimize the total cumulative driving distance between the end points of the trip. To this end, we have devised a combinatorial optimization algorithm and a fixed storage graph topology construction for the graph road network of the continental USA. We have also re-purposed our existing Dijkstra solver to reduce the computational cost of many shortest path solves involved in the algorithm. An adaptive and light weight spatial search structure is also devised for finding a set of prospective stations at each charging location using uniform bins and double link associations. The entire algorithm is implemented as yet another multi-threaded at-scale graph solver within the suite of Kinetica-Graph analytics, exposed as a restful API endpoint and operable within SQL. Several example trips are solved and the results are demonstrated within the context.

cs.DC↗

A fixed storage distributed graph database hybrid with at-scale OLAP expression and I/O support of a relational DB: Kinetica-Graph

A distributed graph database architecture that co-exists with the distributed relational DB for I/O and at-scale OLAP expression support with hundreds of PostGIS compatible geometry functions will be discussed in this article. The uniqueness of this implementation stems mainly from its double link topology structure for its fixed storage characteristics independent from the variance in node-to-edge connections. Another note-worthy contribution of this implementation is its non-blocking client-server communication architecture among its distributed graph servers. A non-bottlenecking partitioning scheme based on duplication of nodes is also implemented ensuring minimal communications using distributed filtering on geo-spatial, random and explicit sharding choices. Finally, an efficient re-balancing algorithm followed by a distributed shortest path solver will be demonstrated with examples from both geo-spatial and social networks.

cs.DB↗