搜索结果: 136-150 共查到“知识库 数学 graphs”相关记录252条 . 查询时间(0.062 秒)
Image denoising by regularization on characteristic graphs
Image Restoration Denoising, Graph Regularization
2010/9/27
This paper introduces improvements to a now classical family of image denoising methods through rather minimal changes to the way derivatives are computed. In particular, we ask, and answer, the quest...
Small (2,s)-colorable graphs without 1-obstacle representations
Small (2,s)-colorable graphs 1-obstacle representations
2011/3/4
An obstacle representation of a graph G is a set of points on the plane together with a set of polygonal obstacles that determine a visibility graph isomorphic to G. The obstacle number of G is the mi...
Hitting distributions of simple random walks on Sierpinski graphs
In [Ka] Kaimanovich de ned an augmented rooted tree X for the
2011/2/25
In [Ka], Kaimanovich de ned an augmented rooted tree X for the d-dimensional Sierpinski gasket K. Let fZtg be the simple random walk on X,starting at the root ;.
Generalized Delaunay Graphs with respect to any Convex Set are Plane Graphs
Generalized Delaunay Graphs Convex Set Plane Graphs
2011/3/3
We consider two types of geometric graphs on point sets on the plane based on a plane set C: one obtained by translates of C, another by positively scaled translates (homothets) of C. For compact and ...
We present the program boundary, whose source les are available at http://people.sissa.it/~maggiolo/boundary/. Given two natural num-bers g and n satisfying 2g + n 2 > 0, the program gener...
Horizontal visibility graphs transformed from fractional Brownian motions: Topological properties versus Hurst index
Horizontal visibility graphs transformed fractional Brownian motions Topological properties versus Hurst index
2010/12/28
Nonlinear time series analysis aims at understanding the dynamics of stochastic or chaotic processes.In recent years, quite a few methods have been proposed to transform a single time series to a comp...
Uncoverings on graphs and network reliability
uncovering spanning tree network reliability
2011/1/21
We propose a network protocol similar to the k-tree protocol of Itai and Rodeh [Inform. and Comput. 79 (1988), 43–59]. To do this, we define an uncovering-bybases for a connected graph G to be a colle...
In this paper we study zero-divisor graphs of semirings. We show that all zero-divisor graphs of (possibly noncommutative) semirings are connected and have diameter less than or equal to 3. We charact...
There are only finitely many distance-regular graphs with valency k at least three, fixed ratio k2/k and large diameter
distance-regular graphs Bannai-Ito Conjecture
2011/1/21
In this paper, we show that for given positive integer C, there are only finitely many distance-regular graphs with valency k at least three, diameter D at least six and k2
k ≤ C. This extends a conj...
A path in an edge-colored graph is called a rainbow path if all edges on it have pairwise
distinct colors. For k ≥ 1, the rainbow-k-connectivity of a graph G, denoted rck(G), is the
minimum number o...
Abelian JSJ decomposition of graphs of free abelian groups
Abelian JSJ decomposition graphs of free abelian groups
2011/1/19
A group G is a vGBS group if it admits a decomposition as a fi-nite graph of groups with all edge and vertex groups finitely generated and free abelian. We construct the JSJ decomposition of a vGBS gr...
Brownian Motions on Metric Graphs III - Construction: General Metric Graphs
Brownian motion metric graph Wentzell boundary condition
2011/1/18
Consider a metric graph G with set of vertices V . Assume that for every vertex in V one is given a Wentzell boundary condition. It is shown how one can construct the paths of a Brownian motion on G s...
Brownian Motions on Metric Graphs II - Construction of Brownian Motions on Single Vertex Graphs
Brownian motion Feller Brownian motion metric graphs
2011/1/18
Pathwise constructions of Brownian motions which satisfy all possible boundary conditions at the vertex of single vertex graphs are given.
Brownian Motions on Metric Graphs I - Definition, Feller Property, and Generators
Metric graphs Brownian motion Feller processes Feller’s theorem
2011/1/18
Brownian motions on a metric graph are defined, their Feller property is proved, and their generators are characterized. This yields a version of Feller’s theorem for metric graphs.
Chip-Firing and Riemann-Roch Theory for Directed Graphs
Chip-Firing Riemann-Roch Theory Directed Graphs
2011/1/17
We investigate Riemann-Roch theory for directed graphs. The Riemann-Roch criteria of Amini and
Manjunath is generalized to all integer lattices orthogonal to some positive vector. Using a generalized...