#### Filter Results:

- Full text PDF available (24)

#### Publication Year

1997

2017

- This year (1)
- Last 5 years (7)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Nino Boccara, Henryk Fuks
- Fundam. Inform.
- 2002

A necessary and sufficient condition for a one-dimensional q-state n-input cellular automaton rule to be number-conserving is established. Two different forms of simpler and more visual representations of these rules are given, and their flow diagrams are determined. Various examples are presented and applications to car traffic are indicated. Two… (More)

- Henryk Fuks, Anna T. Lawniczak
- ArXiv
- 1999

We investigate simplified models of computer data networks and examine how the introduction of additional random links influences the performance of these networks. In general, the impact of additional random links on the performance of the network strongly depends on the routing algorithm used in the network. Significant performance gains can be achieved… (More)

We present a lattice gas cellular automaton (LGCA) to study spatial and temporal dynamics of an epidemic of SIR (susceptible-infected-removed) type. The automaton is fully discrete, i.e. space, time and number of individuals are discrete variables. The automaton can be applied to study spread of epidemics in both human and animal populations. We investigate… (More)

- H Fukś
- Physical review. E, Statistical physics, plasmas…
- 1999

We present a rigorous derivation of the flow at arbitrary time in a deterministic cellular automaton model of traffic flow. The derivation employs regularities in preimages of blocks of zeros, reducing the problem of preimage enumeration to a well-known lattice path counting problem. Assuming infinite lattice size and random initial configuration, the flow… (More)

- Henryk Fukś
- Physical review. E, Statistical, nonlinear, and…
- 2002

We present a probabilistic cellular automaton (CA) with two absorbing states which performs classification of binary strings in a nondeterministic sense. In a system evolving under this CA rule, empty sites become occupied with a probability proportional to the number of occupied sites in the neighborhood, while occupied sites become empty with a… (More)

- Henryk Fukś
- 2003

We demonstrate that the concept of a conservation law can be naturally extended from deterministic to probabilistic cellular automata (PCA) rules. The local function for conservative PCA must satisfy conditions analogous to conservation conditions for deterministic cellular automata. Conservation condition for PCA can also be written in the form of a… (More)

- Henryk Fuks, Anna T. Lawniczak, Stanislav Volkov
- ACM Trans. Model. Comput. Simul.
- 2001

We investigate individual packet delay in a model of data networks with table-free, partial table and full table routing. We present analytical estimation for the average packet delay in a network with small partial routing table. Dependence of the delay on the size of the network and on the size of the partial routing table is examined numerically.… (More)

- Henryk Fuks, Andrew Skelton
- IJNCR
- 2010

We conjecture that for a wide class of interacting particle systems evolving in discrete time, namely, conservative cellular automata with piecewise linear flow diagrams, relaxation to the limit set follows the same power law at critical points. We further describe the structure of the limit sets of such systems as unions of shifts of finite type.… (More)

- Nino Boccara, Henryk Fuks
- 1997

We present a family of one-dimensional cellular automata mod-eling the diffusion of an innovation in a population. Starting from simple deterministic rules, we construct models parameterized by the interaction range and exhibiting a second-order phase transition. We show that the number of individuals who eventually keep adopting the innovation strongly… (More)