A Ford-Fulkerson type theorem concerning vector-valued flows in infinite networks
Mathematics Subject Classification: 26A33, 30B10, 33B15, 44A10, 47N70, 94C05We suggest a fractional differential equation that combines the simple harmonic oscillations of an LC circuit with the discharging of an RC circuit. A series solution is obtained for the suggested fractional differential equation. When the fractional order α = 0, we get the solution for the RC circuit, and when α = 1, we get the solution for the LC circuit. For arbitrary α we get a general solution which shows how the...
Distance metrics are at the core of many processing and machine learning algorithms. In many contexts, it is useful to compute the distance between data using multiple criteria. This naturally leads to consider vector-valued metrics, in which the distance is no longer a real positive number but a vector. In this paper, we propose a principled way to combine several metrics into either a scalar-valued or vector-valued metric. We illustrate our framework by reformulating the popular structural similarity...
To study the asymptotic properties of entropy estimates, we use a unified expression, called the -entropy. Asymptotic distributions for these statistics are given in several cases when maximum likelihood estimators are considered, so they can be used to construct confidence intervals and to test statistical hypotheses based on one or more samples. These results can also be applied to multinomial populations.
In order to describe the interconnection among agents with multi-dimensional states, we generalize the notion of a graph Laplacian by extending the adjacency weights (or weighted interconnection coefficients) from scalars to matrices. More precisely, we use positive definite matrices to denote full multi-dimensional interconnections, while using nonnegative definite matrices to denote partial multi-dimensional interconnections. We prove that the generalized graph Laplacian inherits the spectral...
In this note we provide a natural way of defining exponential coordinates on the class of probabilities on the set Ω = [1,n] or on P = {p = (p1, ..., pn) ∈ Rn| pi > 0; Σi=1n pi = 1}. For that we have to regard P as a projective space and the exponential coordinates will be related to geodesic flows in Cn.
In this note we continue a theme taken up in part I, see [Gzyl and Recht: The geometry on the class of probabilities (I). The finite dimensional case. Rev. Mat. Iberoamericana 22 (2006), 545-558], namely to provide a geometric interpretation of exponential families as end points of geodesics of a non-metric connection in a function space. For that we characterize the space of probability densities as a projective space in the class of strictly positive functions, and these will be regarded as a...