31 research outputs found
Multivariate polynomial perturbations of algebraic equations
AbstractIn this note we study multivariate perturbations of algebraic equations. In general, it is not possible to represent the perturbed solution as a Puiseux-type power series in a connected neighborhood. For the case of two perturbation parameters we provide a sufficient condition that guarantees such a representation. Then, we extend this result to the case of more than two perturbation parameters. We motivate our study by the perturbation analysis of a weighted random walk on the Web Graph. In an instance of the latter the stationary distribution of the weighted random walk, the so-called Weighted PageRank, may depend on two (or more) perturbation parameters in a manner that illustrates our theoretical development
Simulation-Based Graph Similarity
We present symmetric and asymmetric similarity measures for labeled directed rooted graphs that are inspired by the simulation and bisimulation relations on labeled transition systems. Computation of the similarity measures has close connections to discounted Markov decision processes in the asymmetric case and to perfect-information stochastic games in the symmetric case. For the symmetric case, we also give a polynomial-time algorithm that approximates the similarity to any desired precision