搜索结果: 1-15 共查到“数学 Graph”相关记录109条 . 查询时间(0.062 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars:A diffusion scheme based on the foliation graph stripe for optimizing discrete harmonic foliation energy
叶子图条带 优化 离散谐波 叶能量 扩散方案
font style='font-size:12px;'>
2023/4/28
![](http://www.firstlight.cn/upload/imgfile/20236/7/20236710158237.jpg)
Generating new molecules with graph grammar(图)
图语法 新分子 机器学习 单体 聚合物
font style='font-size:12px;'>
2023/6/7
鲁东大学运筹学课件 Lecture-Graph Theory
鲁东大学 运筹学 课件 Lecture-Graph Theory
font style='font-size:12px;'>
2019/5/31
鲁东大学运筹学课件 Lecture-Graph Theory。
三亚国际数学论坛:图与网络对称性(International Workshop on Symmetries of Graph and Networks)
三亚国际数学论坛 图与网络对称性
font style='font-size:12px;'>
2018/1/11
Nowadays, graph symmetries are becoming a very important and rapidly growing area of study, and often looked at closely by computer scientists and other network designers. One significant instance of ...
三亚国际数学论坛:Symmetries of Graph and Networks
三亚国际数学论坛 Symmetries Graph Networks
font style='font-size:12px;'>
2017/11/24
Nowadays, graph symmetries are becoming a very important and rapidly growing area of study, and often looked at closely by computer scientists and other network designers. One significant instance of ...
三亚国际数学论坛:Structural Graph Theory and Discrete Optimization
三亚国际数学论坛 Structural Graph Theory Discrete Optimization
font style='font-size:12px;'>
2017/1/11
Graph theory and discrete optimization are fundamental subjects in the fields of information theory, data analysis, network study and communication, and they have been applied widely in information te...
PARALLEL CHIP-FIRING ON THE COMPLETE GRAPH;DEVIL’S STAIRCASE AND POINCARE ROTATION NUMBER
PARALLEL CHIP-FIRING COMPLETE GRAPH DEVIL’S STAIRCASE POINCARE ROTATION NUMBER
font style='font-size:12px;'>
2015/8/14
We study how parallel chip-firing on the complete graph Kn changes behavior as we vary the total number of chips. Surprisingly,the activity of the system, defined as the average number of firings per ...
Fastest mixing Markov chain on a graph
Markov chains second largest eigenvalue modulus fast mixing semidefinite programming subgradient method
font style='font-size:12px;'>
2015/8/11
We consider a symmetric random walk on a connected graph, where each edge is labeled with the probability of transition between the two adjacent vertices. The associated Markov chain has a uniform equ...
Convex optimization of graph Laplacian eigenvalues
Graph theory Laplacian matrix Convex optimization Semidefinite pro-gramming Markov chain Distributed averaging Effective resistance
font style='font-size:12px;'>
2015/8/10
We consider the problem of choosing the edge weights of an undirected graph so as to maximize or minimize some function of the eigenvalues of the associated Laplacian matrix, subject to some constrain...
Graph implementations for nonsmooth convex programs
Convex optimization nonsmooth optimization disciplined convex pro- gramming optimization modeling languages semidefinite programming second-order cone programming conic optimization nondifferentiable functions.
font style='font-size:12px;'>
2015/8/10
We describe graph implementations, a generic method for representing a convex function via its epigraph, described in a disciplined convex programming framework. This simple and natural idea allows a ...
TRACTABLE AND CONSISTENT RANDOM GRAPH MODELS
RANDOM GRAPH MODELS TRACTABLE
font style='font-size:12px;'>
2015/7/15
This paper studies the formation of risk-sharing networks through costly social
investments, identifying endogenous inequality and a misallocation of resources as possible
downsides to such agreemen...
GENUS 0 AND 1 HURWITZ NUMBERS: RECURSIONS, FORMULAS, AND GRAPH-THEORETIC INTERPRETATIONS
RECURSIONS FORMULAS GRAPH-THEORETIC
font style='font-size:12px;'>
2015/7/14
We derive a closed-form expression for all genus 1 Hurwitz numbers, and give a
simple new graph-theoretic interpretation of Hurwitz numbers in genus 0 and 1. (Hurwitz
numbers essentially count irred...
Fastest Mixing Markov Chain on a Graph
Mix markov chain figure
font style='font-size:12px;'>
2015/7/8
Fastest Mixing Markov Chain on a Graph。
The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem
Markov connected graph edge tags transition rates
font style='font-size:12px;'>
2015/7/8
We consider a Markov process on a connected graph, with edges labeled with transition rates between the adjacent vertices. The distribution of the Markov process converges to the uniform distribution ...
GRAPH LIMITS AND EXCHANGEABLE RANDOM GRAPHS
Figure restrictions and can exchange random graph
font style='font-size:12px;'>
2015/7/8
GRAPH LIMITS AND EXCHANGEABLE RANDOM GRAPHS。