correction and directed acyclic graphs are used to study both lagged and contemporaneous relations in late 19th and early 20th …

We propose a simple random process generating various types of random graphs and the scale-free random graphs among …

The authors tested whether student performance in the principles of economics course is affected by the use of graphs … in spring 1997. Students were randomly assigned to either a nographs lecture or a lecture with graphs. The main … hypothesis was that students in the lectures with graphs would show higher gain scores than those in the nograph lectures (both …

This paper surveys the field of “codes on graphs”, from its origins in the work of Gallager and Tanner, through its …

The paper analyzes stochastic optimization problems involving random fields on infinite directed graphs. The primary …

of the practically successful Brelaz heuristic. This allows to prove that almost all graphs with average degree $d$, i ….e. $G(n,p=d/n)$, are 3-colorable for $d \leq 4.03$, and that almost all 4-regular graphs are 3-colorable. This improves over …-trivial result on the colorability of random regular graphs. In fact, our methods can be used to deal with "arbitrary" sparse degree …