Continued Fractions and Unique Factorization on Digraphs
We show that the characteristic series of walks (paths) between any two vertices of any finite digraph or weighted digraph G is given by a universal continued fraction of finite depth involving the simple paths and simple cycles of G. A simple path is a walk forbidden to visit any vertex more than o...
Príomhchruthaitheoirí: | Giscard, P, Thwaite, S, Jaksch, D |
---|---|
Formáid: | Journal article |
Foilsithe / Cruthaithe: |
2012
|
Míreanna comhchosúla
Míreanna comhchosúla
-
Digraphs with unique annihilating polynomial : ladder digraphs /
de réir: 185867 Lam, Kah-Seng, et al.
Foilsithe / Cruthaithe: ([198) -
Evaluating Matrix Functions by Resummations on Graphs: the Method of
Path-Sums
de réir: Giscard, P, et al.
Foilsithe / Cruthaithe: (2011) -
On digraphs with unique annihilating polynomials /
de réir: 185867 Lam, Kah-Seng, et al.
Foilsithe / Cruthaithe: ([198) -
Exact Inference on Gaussian Graphical Models of Arbitrary Topology using
Path-Sums
de réir: Giscard, P, et al.
Foilsithe / Cruthaithe: (2014) -
An Exact Formulation of the Time-Ordered Exponential using Path-Sums
de réir: Giscard, P, et al.
Foilsithe / Cruthaithe: (2014)