Reinforced walk on graphs and neural networks
A directed-edge-reinforced random walk on graphs is considered. Criteria for the walk to end up in a limit cycle are given. Asymptotic stability of some neural networks is shown.
A directed-edge-reinforced random walk on graphs is considered. Criteria for the walk to end up in a limit cycle are given. Asymptotic stability of some neural networks is shown.
2000 MSC: 26A33, 33E12, 33E20, 44A10, 44A35, 60G50, 60J05, 60K05.After sketching the basic principles of renewal theory we discuss the classical Poisson process and offer two other processes, namely the renewal process of Mittag-Leffler type and the renewal process of Wright type, so named by us because special functions of Mittag-Leffler and of Wright type appear in the definition of the relevant waiting times. We compare these three processes with each other, furthermore consider corresponding...
We consider multistage bidding models where two types of risky assets (shares) are traded between two agents that have different information on the liquidation prices of traded assets. These prices are random integer variables that are determined by the initial chance move according to a probability distribution p over the two-dimensional integer lattice that is known to both players. Player 1 is informed on the prices of both types of shares, but Player 2 is not. The bids may take any integer values....
Some general representation formulae for (C₀) m-parameter operator semigroups with rates of convergence are obtained by the probabilistic approach and multiplier enlargement method. These cover all known representation formulae for (C₀) one- and m-parameter operator semigroups as special cases. When we consider special semigroups we recover well-known convergence theorems for multivariate approximation operators.