Inscriere cercetatori

Daca aveti cont Ad Astra si de Facebook, intrati pe pagina de profil pentru a da dreptul sa va logati pe site doar cu acest buton.

Site nou !

Daca nu va puteti recupera parola (sau aveti alte probleme), scrieti-ne la pagina de contact. Situl vechi se gaseste la adresa


Gambler’s ruin problem on Erdos-Renyi graphs

Autori: Zoltan Neda, Larissa Davidova, Szerena Ujvari, Gabriel Istrate

Editorial: Elsevier, Physica A: Statistical Mechanics and its Applications, 468, p.147-157, 2017.


Want create site? Find Free WordPress Themes and plugins.

A simple ruin-game is studied on Erdos-Renyi type graphs. Initially the players have the same wealth. At each time step a monopolist game is played on all active links (links that connects nodes with nonzero wealth). In such a game each player puts a unit wealth in the pot and the pot is won with equal probability by one of the players. The game ends when there are no connected players such that both of them have non-zero wealth. In order to characterize the final state a compact formula is given for the expected number of the remaining players with non-zero wealth and the wealth distribution among these players. Theoretical predictions are given for the expected duration of the ruin game. The dynamics of the number of active players is also investigated.

Validity of the theoretical predictions is investigated by Monte Carlo experiments.

Did you find apk for android? You can find new Free Android Games and apps.