论文信息 - On pre-periods of discrete influence systems

On pre-periods of discrete influence systems

Abstract We investigate mappings of the form g = ƒA where ƒ is a cyclically monotonous mapping of finite range and A is a linear mapping given by a symmetric matrix. We give some upper bounds on the pre-period of g, i.e. the maximum q for which all g(x),g2(x),…,gq(x) are distinct.

Svatopluk Poljak | Daniel Turzík

[1] Eric Goles Ch.,et al. Decreasing energy functions as a tool for studying threshold networks , 1985, Discret. Appl. Math..

[2] J. French. A formal theory of social power. , 1956, Psychology Review.

[3] Svatopluk Poljak,et al. On an application of convexity to discrete systems , 1986, Discret. Appl. Math..

[4] Eric Goles Ch.,et al. Comportement itératif des fonctions à multiseuil , 1980, Inf. Control..

[5] Eric Goles Ch.,et al. Transient length in sequential iteration of threshold functions , 1983, Discret. Appl. Math..

[6] Daniel Turzík,et al. Social influence models with ranking alternatives and local election rules , 1985 .

[7] Eric Goles Ch.,et al. Comportement periodique des fonctions a seuil binaires et applications , 1981, Discret. Appl. Math..

[8] Svatopluk Poljak,et al. On periodical behaviour in societies with symmetric influences , 1983, Comb..

[9] Eric Goles Ch.,et al. Dynamics of Positive Automata Networks , 1985, Theor. Comput. Sci..

[10] F. Roberts. Discrete Mathematical Models with Applications to Social, Biological, and Environmental Problems. , 1976 .