21 citations · 33 across the 6 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
cs.SI2012★ 1 cited
A stopping criterion for Markov chains when generating independent random graphs
J. Ray, A. Pinar, C. Seshadhri
Markov chains are convenient means of generating realizations of networks with a given (joint or otherwise) degree distribution, since they simply require a procedure for rewiring…
math.NA2012★ 1 cited
Decreasing the temporal complexity for nonlinear, implicit reduced-order models by forecasting
Kevin Carlberg, Jaideep Ray, Bart van Bloemen Waanders
Implicit numerical integration of nonlinear ODEs requires solving a system of nonlinear algebraic equations at each time step. Each of these systems is often solved by a Newton-lik…
cs.SI2012★ 5 cited
Are we there yet? When to stop a Markov chain while generating random graphs
Jaideep Ray, Ali Pinar, C. Seshadhri
Markov chains are a convenient means of generating realizations of networks, since they require little more than a procedure for rewiring edges. If a rewiring procedure exists for…