Irreversible dynamos in tori

Flocchini, Paola; Lodi, Elena; Luccio, Fabrizio; Santoro, Nicola

doi:10.1007/bfb0057901

Cited by 15 publications

(7 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This model has been used in mathematics(Durrett and Steif 1993;Goles and Olivos 1980;Granville 1991;Holley and Liggett 1975;Moran 1994a Moran ,b, 1995Mustafa and Pekev 2004;Steif 1994), computer science(Flocchini et al 1998;Hassin and Peleg 2001;Královic 2001;Nakata et al 1999Nakata et al , 2000Peleg 1998Peleg , 2002, biology(Agur 1987;Agur et al 1988;Clifford and Sudbury 1973), and social psychology(Latané and Nowak 1997;Poljak and Sura 1983).…”

mentioning

confidence: 99%

Social structure and the effects of conformity

Zollman

2008

Synthese

View full text Add to dashboard Cite

Conformity is an often criticized feature of human belief formation. Although generally regarded as a negative influence on reliability, it has not been widely studied. This paper attempts to determine the epistemic effects of conformity by analyzing a mathematical model of this behavior. In addition to investigating the effect of conformity on the reliability of individuals and groups, this paper attempts to determine the optimal structure for conformity. That is, supposing that conformity is inevitable, what is the best way for conformity effects to occur? The paper finds that in some contexts conformity effects are reliability inducing and, more surprisingly even when it is counterproductive, not all methods for reducing its effect are helpful. These conclusions contribute to a larger discussion in social epistemology regarding the effect of social behavior on individual reliability.

show abstract

mentioning

confidence: 99%

Social structure and the effects of conformity

Zollman

2008

Synthese

View full text Add to dashboard Cite

show abstract

“…The local majority process (and some of its natural extensions) has been studied in frameworks as diverse as social influence [19,11,5,38,39,40] and neural networks [18,17,15,16]. Recently, the local majority process has reappeared (under the name polling process) in several papers motivated by certain distributed computing problems [36,2,10,9,20,21,22,27,32,33]. In fact, Peleg [35] points out several areas of distributed computing in which our model could be relevant.…”

Section: Introductionmentioning

confidence: 99%

“…Note that, according to the local majority process, once all agents are in the same state, no agent will change its state ever after. All of the recent papers dealing with the local majority process and its modifications [36,2,10,9,20,21,22,27,32,33] investigated how poorly the local majority process (and its variations) could miscalculate the initial majority (on a specific class of graphs). 2 In contrast to these results, we are interested in graphs which are immune to miscalculations in the local majority process-the focus of this paper is on m.c.c.…”

Section: Introductionmentioning

confidence: 99%

Listen to Your Neighbors: How (Not) to Reach a Consensus

Mustafa¹,

Pekec²

2004

SIAM J. Discrete Math.

View full text Add to dashboard Cite

We study the following rather generic communication/coordination/computation problem: In a finite network of agents, each initially having one of the two possible states, can the majority initial state be computed and agreed upon by means of local computation only? We study an iterative synchronous application of the local majority rule and describe the architecture of networks that are always capable of reaching the consensus on the majority initial state of its agents. In particular, we show that, for any truly local network of agents, there are instances in which the network is not capable of reaching such a consensus. Thus, every truly local computational approach that requires reaching a consensus is not failure-free.

show abstract

“…Recently, the local majority process has reappeared (under the name polling process) in several papers motivated by certain distributed computing problems [P98,B99,FLLPS98,FLLPS99,H98,HP99,HP00,LPS99,NIY99,NIY00]. In fact, Peleg [P96b] points out several areas of distributed computing in which our model could be relevant.…”

Section: Introductionmentioning

confidence: 99%

“…Note that, according to the local majority process, once all agents are in the same state, no agent will change its state everafter. All of the recent papers dealing with the local majority process and its modifications [P98,B99,FLLPS98,FLLPS99,H98,HP99,HP00,LPS99,NIY99,NIY00] investigated how badly could the local majority process (and its variations) miscalculate the initial majority (on a specific class of graphs)…”

Section: Introductionmentioning

confidence: 99%

Democratic Consensus and the Local Majority Rule

Mustafa¹,

Pekec²

2000

BRICS

View full text Add to dashboard Cite

In this paper we study a rather generic communication/ coordination/ computation problem: in a finite network of agents, each initially having one of the two possible states, can the majority initial state be computed and agreed upon (i.e., can a democratic consensus be reached) by means of iterative application of the local majority rule. We show that this task is failure-free only in the networks that are nowhere truly local. In other words, the idea of solving a truly global task (reaching consensus on majority) by means of truly local computation only (local majority rule) is doomed for failure.We also show that even well connected networks of agents that are nowhere truly local might fail to reach democratic consensus when the local majority rule is applied iteratively. Structural properties of democratic consensus computers, i.e., the networks in which iterative application of the local majority rule always yields consensus in the initial majority state, are presented.

show abstract

Irreversible dynamos in tori

Cited by 15 publications

References 10 publications

Social structure and the effects of conformity

Social structure and the effects of conformity

Listen to Your Neighbors: How (Not) to Reach a Consensus

Democratic Consensus and the Local Majority Rule

Contact Info

Product

Resources

About