搜索结果: 1-7 共查到“知识库 计算数学 graphs”相关记录7条 . 查询时间(0.103 秒)
Reconstruction for models on random graphs
Random variables algorithms the random sequence diagram
2015/8/21
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given ‘far away’ observations. Several theoretical results (a...
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Check (LDPC) codes. ...
SANDPILE GROUPS AND SPANNING TREES OF DIRECTED LINE GRAPHS
SANDPILE GROUPS SPANNING TREES DIRECTED LINE GRAPHS
2015/8/14
We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associated to a directed graph, whose...
Fastest mixing Markov chain on graphs with symmetries
Markov chains fast mixing eigenvalue optimization semidefi nite programming graph automorphism group representation
2015/8/10
We show how to exploit symmetries of a graph to efficiently compute the fastest mixing Markov chain on the graph (i.e., find the transition probabilities on the edges to minimize the second-largest ei...
Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs
Hardness approximability exact algorithms vector domination total vector domination
2011/3/2
We consider two graph optimization problems called vector domination and total vector domination. In vector domination one seeks a small subset S of vertices of a graph such that any vertex outside S ...
Constructing graphs over $R^n$ with small prescribed mean-curvature
$R^n$ with small prescribed mean-curvature
2010/12/1
In this paper a convergent series expansion is constructed to solve the prescribed mean curvature equation ±∇·(∇u/p1 ± |∇u|2) = nH for n-dimensional hypersurfaces in Rn+1 (+ sign) an...
Orderly Algorithm to Enumerate Central Groupoids and Their Graphs
orderly algorithms paths in directed graphs enumeration
2007/12/11
A graph has the unique path property $\rm UPP_n$ if there is a unique path of length $n$ between any ordered pair of nodes. This paper reiterates Royle and MacKay's technique for constructing orderly ...