no code implementations • 10 Oct 2020 • Arun V. Sathanur, Nathan A. Baker
In this work, we developed an efficient approach to compute ensemble averages in systems with pairwise-additive energetic interactions between the entities.
no code implementations • 13 Jan 2020 • Kelsey Maass, Arun V. Sathanur, Arif Khan, Robert Rallo
Our proposed methodology uses a graph representation of the road network and combines several techniques such as graph-based routing, trip sampling, graph sparsification, and least-squares optimization to estimate the street-level travel times.
1 code implementation • 5 Oct 2018 • Arun V. Sathanur
Often times, in many design problems, there is a need to select a small set of informative or representative elements from a large ground set of entities in an optimal fashion.
1 code implementation • 7 Sep 2017 • Arun V. Sathanur, Sutanay Choudhury, Cliff Joslyn, Sumit Purohit
In this work we tackle the problem of capturing the statistical dependence of the edge connectivity on the vertex labels and using the same distribution to regenerate property graphs of the same or expanded size in a scalable manner.
Social and Information Networks