@article{oai:muroran-it.repo.nii.ac.jp:00008184,
 author = {YAMAGUCHI, Tadashi and 山口, 忠},
 journal = {室蘭工業大学研究報告. 理工編, Memoirs of the Muroran Institute of Technology. Science and engineering},
 month = {Nov},
 note = {application/pdf, The graph Gt+1 is defined recursively from Gt by some stochastic rules. We call this sequence {Gt} a graph stochastic process. The rules are described in the following two cases: (1)an edge is chosen at random，and then its destination is changed at random, (2)some edges are cut with a probability and some edges occur between some vertices pairs with the same probability. In both cases，the processes are characterized by finite Markov chains. In this paper，the way of deriving these transition matrices is reported.},
 pages = {95--101},
 title = {グラフの変化過程},
 volume = {42},
 year = {1992},
 yomi = {ヤマグチ, タダシ}
}