3 citations · 5 across the 5 of their papers we have counts for
6 papers
The 2nd Place Solution for 2023 Waymo Open Sim Agents Challenge
Cheng Qian, Di Xiu, Minghao Tian
In this technical report, we present the 2nd place solution of 2023 Waymo Open Sim Agents Challenge (WOSAC)[4]. We propose a simple yet effective autoregressive method for simulati…
On the clique number of noisy random geometric graphs
Matthew Kahle, Minghao Tian, Yusu Wang
Let be a random geometric graph, and then for we construct a "-perturbed noisy random geometric graph" where each existing edge in is…
A limit theorem for the st Betti number of layer- subgraphs in random graphs
Minghao Tian, Yusu Wang
We initiate the study of local topology of random graphs. The high level goal is to characterize local "motifs" in graphs. In this paper, we consider what we call the layer- sub…
Local cliques in ER-perturbed random geometric graphs
Matthew Kahle, Minghao Tian, Yusu Wang
Random graphs are mathematical models that have applications in a wide range of domains. We study the following model where one adds Erdős--Rényi (ER) type perturbation to a random…
A quest to unravel the metric structure behind perturbed networks
Srinivasan Parthasarathy, David Sivakoff, Minghao Tian +1
Graphs and network data are ubiquitous across a wide spectrum of scientific and application domains. Often in practice, an input graph can be considered as an observed snapshot of…
Harmonic Extension
Zuoqiang Shi, Jian Sun, Minghao Tian
In this paper, we consider the harmonic extension problem, which is widely used in many applications of machine learning. We find that the transitional method of graph Laplacian fa…