𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Majority-vote on directed Erdős–Rényi random graphs

✍ Scribed by F.W.S. Lima; A.O. Sousa; M.A. Sumuor

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
551 KB
Volume
387
Category
Article
ISSN
0378-4371

No coin nor oath required. For personal study only.

✦ Synopsis

Through Monte Carlo Simulation, the well-known majority-vote model has been studied with noise on directed random graphs. In order to characterize completely the observed order-disorder phase transition, the critical noise parameter q c , as well as the critical exponents β/ν, γ /ν and 1/ν have been calculated as a function of the connectivity z of the random graph.

📜 SIMILAR VOLUMES

Trapping of continuous-time quantum walk
Trapping of continuous-time quantum walks on Erdös–Rényi graphs
✍ E. Agliari 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 376 KB

We consider the coherent exciton transport, modeled by continuous-time quantum walks, on Erdös-Rény graphs in the presence of a random distribution of traps. The role of trap concentration and of the substrate dilution is deepened showing that, at long times and for intermediate degree of dilution,

On the independence number of the Erdős-
On the independence number of the Erdős-Rényi and projective norm graphs and a related hypergraph
✍ Dhruv Mubayi; Jason Williford 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB

## Abstract The Erdős‐Rényi and Projective Norm graphs are algebraically defined graphs that have proved useful in supplying constructions in extremal graph theory and Ramsey theory. Their eigenvalues have been computed and this yields an upper bound on their independence number. Here we show that

A probabilistic local majority polling g
A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem
✍ Toshio Nakata; Hiroshi Imahayashi; Masafumi Yamashita 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 123 KB 👁 1 views

In this paper, we investigate a probabilistic local majority polling game on weighted directed graphs, keeping an application to the distributed agreement problem in mind. We formulate the game as a Markov chain, where an absorbing state corresponds to a system configuration that an agreement is ach