1 citations · 1 across the 6 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.DS2018
Connectivity and Structure in Large Networks
András Faragó, Rupei Xu
Large real-life complex networks are often modeled by various random graph constructions and hundreds of further references therein. In many cases it is not at all clear how the mo…
cs.DS2018★ 1 cited
Utilizing Network Structure to Bound the Convergence Rate in Markov Chain Monte Carlo Algorithms
Ahmad Askarian, Rupei Xu, András Faragó
We consider the problem of estimating the measure of subsets in very large networks. A prime tool for this purpose is the Markov Chain Monte Carlo (MCMC) algorithm. This algorithm,…
cs.DS2018
A Simple Approximation for a Hard Routing Problem
Rupei Xu, András Faragó
We consider a routing problem which plays an important role in several applications, primarily in communication network planning and VLSI layout design. The original underlying gra…