Skip to main content

ETHNOS_APP

Home • Search • Journals • List 0

Cellular Automata for the Network Researcher

Bibliographic Data

ID10142667
AuthorsPhillip Bonacich (University of California, Los Angeles, corresponding author)
Year2003
Volume27
Issue4
Pages263-278
Publication date2003-10-01
Open AccessNo
TypeARTICLE
VenueJournal of Mathematical Sociology (JOURNAL)
Journal identifiersISSN: 0022-250X • E-ISSN: 1545-5874
PublisherTaylor & Francis (PUBLISHER • GB)
DOI10.1080/00222500390245349
OpenAlexW2019674042
LanguageEN
Citations received2
References cited10

Cellular automata (CA) can be used in simulations of network processes and network evolution by identifying adjacent vertices in a network with neighboring cells in a CA. However, there are restrictions on networks that can be represented by two dimensional CAs. For example, the degree of a vertex, the maximum number of unconnected neighbors, and the maximum size of a clique, are limited. Moreover, a high degree of transitivity is built into the two dimensional CA. Increasing the number of dimensions beyond two relaxes all the constraints. Moreover, the reduced transitivity of higher dimensional CAs allows us to vary in a systematic way the “localness” of the connections. Thus, we can examine the differences between strong (local and transitive) versus weak (non-transitive) ties, a difference that Granovetter and others have shown to be important. The paper offers equations describing how maximum degree, maximum clique size, maximum number of unconnected neighbors, and transitivity vary with the dimensions of the CA

Algorithm · Cellular automaton · Clique · Combinatorics · Degree (music · Discrete mathematics · Graph · Physics · Transitive relation · Vertex (graph theory · Cellular Automata and Applications · Complex Network Analysis Techniques · Computer Science · Mathematics · Opinion Dynamics and Social Influence

  • Recovering Social Networks from Individual Attributes

    Arnold Polanski, Duncan Mcvicar•Journal of Mathematical Sociology•2011

  • Network Modeling with Cellular Automata

    Gábor Péli•Journal of Mathematical Sociology•2013

  • Bonds of pluralism

    Edward O Laumann•Bonds of pluralism•1973

  • The Complexity of Cooperation: Agent-Based Models of Competition and Collaboration

    Robert Axelrod•Complexity of Cooperation•1997

  • Cellular Automata as a Modelling Tool

    Rainer Hegselmann, Andreas Flache et al.•Tools and Techniques for Social…•2000

  • Modeling Social Change with Cellular Automata

    Andrzej Nowak, Maciej Lewenstein•Modelling and Simulation in the…•1996

  • Dynamic models of segregation

    Thomas C Schelling•Journal of Mathematical Sociology•1971

  • Power Relations in Exchange Networks

    B Markovsky, D Willer et al.•American Sociological Review•1988

  • The Distribution of Power in Exchange Networks

    K S Cook, Richard M Emerson et al.•American Journal of Sociology•1983

  • The Strength of Weak Ties

    Mark Granovetter, Mark S Granovetter•American Journal of Sociology•1973

  • The Emergence of Generalized Exchange

    Nobuyuki Takahashi•American Journal of Sociology•2000

Citations per year0.13
Citation span2011 - 2013 (3)
Highly citedNo

Tools

Open DOISci-Hub
Ethnos_APP • Open Source Project • MIT License • Frontend v2.0.0 • Privacy and Cookies • API Documentation: api.ethnos.app/docs • API Source Code: GitHub • DOI: 10.5281/zenodo.17049435 • Frontend Source Code: GitHub • DOI: 10.5281/zenodo.17050053 • cruz.rio.br • Expectantes Misericordiae