Elements of a theory of computer simulation. I
From MaRDI portal
Publication:1294327
DOI10.1016/S0096-3003(97)10166-7zbMATH Open0927.68114OpenAlexW1981097681WikidataQ56268249 ScholiaQ56268249MaRDI QIDQ1294327FDOQ1294327
Authors: Christopher L. Barrett, Christian M. Reidys 
Publication date: 29 November 1999
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0096-3003(97)10166-7
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph Theory and Probability
- Title not available (Why is that?)
- Acyclic orientations of graphs
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Combinatorics on traces
- Combinatorial problems of commutation and rearrangements
- Limit distribution for the existence of Hamiltonian cycles in a random graph
- Computation theory of cellular automata
- Title not available (Why is that?)
- Generic properties of combinatory maps: Neutral networks of RNA secondary structures
- Title not available (Why is that?)
- The enumeration of Coxeter elements
- Title not available (Why is that?)
- Almost all regular graphs are Hamiltonian
- A unifying framework for distributed simulation
- The firing squad synchronization problem on Cayley graphs
Cited In (46)
- Indiscernibility structures induced from function sets: graph and digraph case
- Dynamical attraction in parallel network models
- D-chain tomography of networks: a new structure spectrum and an application to the SIR process
- On the dynamics of semilattice networks
- The adjacency matrix of a graph as a data table: a geometric perspective
- Updating method for the computation of orbits in parallel and sequential dynamical systems
- A new discrete dynamical system of signed integer partitions
- Computation of functions on \(n\) bits by asynchronous clocking of cellular automata
- Friends and strangers walking on graphs
- Acyclic orientations of random graphs
- Fixed points in generalized parallel and sequential dynamical systems induced by a minterm or maxterm Boolean functions
- Agent-based modeling, mathematical formalism for
- Synchronous and asynchronous evaluation of dynamic neural fields
- Equivalence relations on finite dynamical systems
- Flexible toggles and symmetric invertible asynchronous elementary cellular automata
- Sequential dynamical systems over words
- Existence, coexistence and uniqueness of fixed points in parallel and sequential dynamical systems over directed graphs
- Predecessors and Garden-of-Eden configurations in parallel dynamical systems on maxterm and minterm Boolean functions
- Threshold agent networks: An approach to modelling and simulation
- Dependency and accuracy measures for directed graphs
- Causal graph dynamics
- ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHS
- Elements of a theory of simulation. II: Sequential dynamical systems.
- The domination numbers of cylindrical grid graphs
- Matrix method for linear sequential dynamical systems on digraphs
- Parallel and sequential dynamics of two discrete models of signed integer partitions
- Linear sequential dynamical systems, incidence algebras, and Möbius functions
- On the diameters of friends-and-strangers graphs
- Elements of a theory of simulation. III: Equivalence of SDS.
- ETS IV: Sequential dynamical systems: fixed points, invertibility and equivalence
- Discrete dynamical systems on graphs and Boolean functions
- Parallel discrete dynamical systems on maxterm and minterm Boolean functions
- On acyclic orientations and sequential dynamical systems
- On periods and equilibria of computational sequential systems
- Parallel dynamical systems over graphs and related topics: a survey
- Parallel dynamical systems over directed dependency graphs
- Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems
- Update schedules of sequential dynamical systems
- A graph-dynamical interpretation of Kiselman's semigroups
- Complexity of reachability problems for finite discrete dynamical systems
- Enumerating periodic orbits in sequential dynamical systems over graphs
- Attractors and transient in sequential dynamical systems
- Dichotomy results for fixed point counting in Boolean dynamical systems
- Parallel dynamical systems over special digraph classes
- Decomposition and simulation of sequential dynamical systems
- Lipschitz continuity under toric equivalence for asynchronous Boolean networks
This page was built for publication: Elements of a theory of computer simulation. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1294327)
