Random Graphs and Complex Networks

来源 :第八届工业与应用数学国际大会 | 被引量 : 0次 | 上传用户:liutaostdio
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  We focus on the following questions of random graph and complex networks.How to classify the structure of different random growing networks? How do the dynamical processes taking place on a random network shape the network topology?
其他文献
  The complexity of modern photolithography makes extensive simulations indispensable.In this talk,based on the parallel adaptive finite element toolbox PHG,a
会议
  In this paper,we present study on some EM solvers in time domain and frequency domain using different numerical methods.The numerical methods and their para
会议
  This talk is devoted to time domain numerical solutions of twodimensional(2D)material interface problems governed Maxwell's equations with discontinuous ele
会议
  Vlasov-Poisson and Wigner equations are fundamental equations in Plasma and Semiconductor respectively.We focus on numerically solving these two equations u
会议
  In Grad's moment method,the distribution function is expanded into a series in a weighted L2 space.However,in some problems like heat transfer between two p
会议
  The stationary solution of Boltzmann equation has a special significance in various modern kinetic fields.While the steady state is unavailable in general v
会议
  This work is devoted to the derivation of an asymptotic-preserving scheme for the electronic M1 model in the diffusive regime.A Godunov type scheme,based on
会议
  The Laplacian eigenvalue of a graph plays an important role in controlling other graph parameters.It is closed related to random walks.In this talk,we intro
会议
  Let's consider the supercritical Poisson continuous percolation on d-dimensional torus Tdn with volume nd.By adding "long edges " randomly to the largest pe
会议
  Discrete nodal domain theory is used to provide a criterion to determine how many communities a network has and how to partition these communities by means
会议