14 citations · 28 across the 7 of their papers we have counts for
5 papers · 1 filter
Motif enrichment as a driver of scale-free behavior in rewired random regular graphs
Pawat Akara-pipattana, Sergei Nechaev
We study the statistics of rewired random regular graphs (RRGs) in a mixed ensemble, where the average number of triangles is controlled by the fugacity , while the number of ve…
Hammerstein equations for sparse random matrices
Pawat Akara-pipattana, Oleg Evnin
Finding eigenvalue distributions for a number of sparse random matrix ensembles can be reduced to solving nonlinear integral equations of the Hammerstein type. While a systematic m…
Random matrices with row constraints and eigenvalue distributions of graph Laplacians
Pawat Akara-pipattana, Oleg Evnin
Symmetric matrices with zero row sums occur in many theoretical settings and in real-life applications. When the offdiagonal elements of such matrices are i.i.d. random variables a…
Resistance distance distribution in large sparse random graphs
Pawat Akara-pipattana, Thiparat Chotibut, Oleg Evnin
We consider an Erdos-Renyi random graph consisting of N vertices connected by randomly and independently drawing an edge between every pair of them with probability c/N so that at…
The birth of geometry in exponential random graphs
Pawat Akara-pipattana, Thiparat Chotibut, Oleg Evnin
Inspired by the prospect of having discretized spaces emerge from random graphs, we construct a collection of simple and explicit exponential random graph models that enjoy, in an…