搜索结果: 1-15 共查到“理学 Graphs”相关记录299条 . 查询时间(0.103 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Nonlinear Schrodinger equations on metric graphs
度量图 非线性 薛定谔方程
2023/5/12
This talk will introduce some topics related to the study of nonlinear Schr?dinger equation on metric graphs, and then show the existence result of concentrated solutions to NLS equations on compact g...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：On the Turán number of theta graphs
θ图 图兰数 图论
2023/4/26
Turán-type problem may be one of central problems in extremal graph theory. Particularly, the Turán number of a cycle attracts much attention. In this talk, we introduce a terminology, that is, theta ...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Symmetry in Cayley graphs
凯莱图 对称性 图论
2023/4/27
Cayley graphs form an important class of vertex-transitive graphs, which have been the object of study for many decades. These graphs admit a group of automorphisms that acts regularly (sharply-transi...
Workshop on Colored Notions of Connectivity in Graphs
Workshop Colored Notions of Connectivity in Graphs
2017/1/11
Nowadays "colored notions of connectivity in graphs" becomes a new and active subject in graph theory. Starting from rainbow connection, monochromatic connection and proper connection appeared later. ...
三亚国际数学论坛：Curvatures of Graphs,Simplicial Complexes and Metric Spaces（Curvatures of Graphs,Simplicial Complexes and Metric Spaces ）
三亚国际数学论坛 Curvatures of Graphs Simplicial Complexes Metric Spaces
2017/1/10
Curvature is a notion originally developed in differential and Riemannian geometry. It was then discovered that curvature inequalities in Riemannian manifolds are equivalent to other geometric propert...
Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs
Sparse graphical model Reversible Markov chain Markov equivalence class
2016/1/20
Graphical models are popular statistical tools which are used to represent dependent or causal complex systems. Statistically equivalent causal or directed graphical models are said to belong to a Mar...
TOPOLOGICAL SYMMETRY GROUPS OF COMPLETE GRAPHS IN THE 3-SPHERE
TOPOLOGICAL SYMMETRY THE 3-SPHERE
2015/12/17
The orientation preserving topological symmetry group of
a graph embedded in the 3-sphere is the subgroup of the automorphism
group of the graph consisting of those automorphisms which can be
induc...
TOPOLOGICAL SYMMETRY GROUPS OF GRAPHS IN 3-MANIFOLDS
GRAPHS IN 3-MANIFOLDS SYMMETRY GROUPS
2015/12/17
We prove that for every closed, connected, orientable, irreducible 3-manifold, there exists an alternating group An which is not
the topological symmetry group of any graph embedded in the manifold.
...
AFEM for the Laplace-Beltrami Operator on Graphs: Design and Conditional Contraction Property
Laplace-Beltrami operator graphs adaptive fi nite element method
2015/12/11
We present an adaptive finite element method (AFEM) of any polynomial degree for the
Laplace-Beltrami operator on C
1
graphs Γ in R
d
(d ≥ 2). We first derive residual-type a
posteri...
WEAK UNCERTAINTY PRINCIPLE FOR FRACTALS,GRAPHS AND METRIC MEASURE SPACES
Uncertainty principle p.c.f. fractal Heisenberg’s inequality measure metric spaces Poincar′ e inequality self-similar graphs Sierpinski ′ gasket uniform finitely ramified graphs
2015/12/10
We develop a new approach to formulate and prove the weak uncertainty inequality which was recently introduced by Okoudjou and Strichartz.We assume either an appropriate measure growth condition with ...
Given a sequence {αn} in (0, 1) converging to a rational, we examine
the model theoretic properties of structures obtained as limits of ShelahSpencer
graphs G(m, m−αn ). We show that in most c...
The absence of efficient dual pairs of spanning trees in planar graphs
planar graphs cells
2015/8/26
A spanning tree T in a finite planar connected graph G determines a dual spanning tree T* in the dual graph G* such that T and T* do not intersect. We show that it is not always possible to find T in ...
We show that for integers k > 1 and n > 2, the diameter of the Cayley graph of SLn(Z/kZ) with respect to a standard two-element generating set, is at most a constant times n2 ln k. This answers a ques...
We give a non-deterministic algorithm that expresses elements of SLN(Z), for N>2, as words in a finite set of generators, with the length of these words at most a constant times the word metric. We sh...
Some duality conjectures for finite graphs and their group theoretic consequences
finite graphs group theoretic consequences
2015/8/26
We pose some graph theoretic conjectures about duality and the diameter of maximal trees in planar graphs, and we describe innovations in the following two topics in Geometric Group Theory, where the ...