2012网络传播动力学研讨会Enumeration_problems_of_networks.pptVIP

Thank You! * * * 图2-26给出的是一个包含5个顶点的连通图的4个生成树。 * 图2-26给出的是一个包含5个顶点的连通图的4个生成树。 * * * * * * * 复旦大学 复旦大学 复旦大学 复旦大学 复旦大学 复旦大学 复旦大学 复旦大学 复旦大学 Enumeration problems of networks  2012网络传播动力学研讨会 * Main contents Introduction to enumeration problems 1 Our works 2 Spanning trees: theory and applications Matching (monomer and dimer) Perfect matching (dimers) Spanning trees on networks Matching and perfect matching on scale-free networks Various enumeration problems */45 * Spanning trees Matchings Perfect matching Spanning forests Spanning connected subgraphs Independent sets Acyclic orientations ??????? Definition of spanning tree A spanning tree of any connected network is defined as a minimal set of edges that connect every node. * Applications and relevance of spanning trees A measure of reliability Loop-erased random walks q-state Potts model Sandpile model Electrical networks Isotropic random walks * Relevance to sandpile model The number of spanning trees equals the number of recurrent configurations. The Electronic Journal of Combinatorics. 2008,15, #R109. * Connections with electrical networks Every edge – a resistor of 1 ohm. Voltage difference of 1 volt between u and v. R(u,v) – inverse of electrical current from u to v. _ u v + C(u,v) = F(s,t) + F(t,s) =2mR(u,v), R(u,v)= C(u,v)/ (2m) dz is degree of z, m is the number of edges Counting spanning trees * Adjacency matrix A Diagonal degree matrix D Laplacian matrix L=D-A Probability transition matrix Normalized adjacency matrix Normalized Laplacian matrix Definition of matching Given a graph G = (V,E), a matching M in G is a set of pairwise non-adjacent edges; that is, no two edges share a common vertex. Maximal matching Maximum matching Perfect matching Our works * Enumerating spanning in various networks Scale-free networks: Pseudofractal scale-free web, Apollonian networks, Koch networks Fractal networks: Scale-free lattice, Hanoi graphs Small-wor