39 citations · 55 across the 5 of their papers we have counts for
Showing cs.SIShow all
2 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…
cs.SI2012★ 39 cited
Degree Relations of Triangles in Real-world Networks and Models
Nurcan Durak, Ali Pinar, Tamara G. Kolda +1
Triangles are an important building block and distinguishing feature of real-world networks, but their structure is still poorly understood. Despite numerous reports on the abundan…