Existing random graph models introduce unwanted features such as multiple edges and directed cycles when randomizing directed acyclic networks. This paper proposes a new random graph model for ...

We prove a quantitative Russo-Seymour-Welsh (RSW) type result for random walks on two natural examples of random planar graphs: the supercritical percolation cluster in the square lattice and the ...

MARC NOY, VLADY RAVELOMANANA, JUANJO RUÉ, ON THE PROBABILITY OF PLANARITY OF A RANDOM GRAPH NEAR THE CRITICAL POINT, Proceedings of the American Mathematical Society, Vol. 143, No. 3 (MARCH 2015), pp.

Statistical inference for exponential-family models of random graphs with dependent edges is challenging. We stress the importance of additional structure and show that additional structure ...

Node classification, as a central task in the graph data analysis, has been studied extensively with network embedding technique for single-layer graph network. However, there are some obstacles when ...