Results 51 to 60 of about 3,332 (64)
A Note on the Transience of Critical Branching Random Walks on the Line [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Gantert and Müller (2006) proved that a critical branching random walk (BRW) on the integer lattice is transient by analyzing this problem within the more general framework of branching Markov chains and making use of Lyapunov functions. The main purpose
Gerold Alsmeyer, Matthias Meiners
doaj +1 more source
The structure of communication problems in cellular automata [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Studying cellular automata with methods from communication complexity appears to be a promising approach. In the past, interesting connections between communication complexity and intrinsic universality in cellular automata were shown.
Raimundo Briceño +1 more
doaj +1 more source
Corners over quasirandom groups
, 2016 Let $G$ be a finite $D$-quasirandom group and $A \subset G^{k}$ a $\delta$-dense subset. Then the density of the set of side lengths $g$ of corners \[ \{(a_{1},\dots,a_{k}),(ga_{1},a_{2},\dots,a_{k}),\dots,(ga_{1},\dots,ga_{k})\} \subset A \] converges ...
Zorin-Kranich, Pavel
core +1 more source
A functional limit law for the profile of plane-oriented recursive trees. [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We give a functional limit law for the normalized profile of random plane-oriented recursive trees. The proof uses martingale convergence theorems in discrete and continuous-time. This complements results of Hwang (2007).
Henning Sulzbach
doaj +1 more source
NOCAS : A Nonlinear Cellular Automata Based Stream Cipher [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 LFSR and NFSR are the basic building blocks in almost all the state of the art stream ciphers like Trivium and Grain-128. However, a number of attacks are mounted on these type of ciphers.
Sandip Karmakar, Dipanwita Roy Chowdhury
doaj +1 more source
, 2015 We consider partitioned graphs, by which we mean finite strongly connected directed graphs with a partitioned edge set $ {\mathcal E} ={\mathcal E}^- \cup{\mathcal E}^+$. With additionally given a relation $\mathcal R$ between the edges in ${\mathcal E}^-
Béal +9 more
core +1 more source
Conservation Laws and Invariant Measures in Surjective Cellular Automata [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 We discuss a close link between two seemingly different topics studied in the cellular automata literature: additive conservation laws and invariant probability measures.
Jarkko Kari, Siamak Taati
doaj +1 more source
Fractal diffusion coefficient from dynamical zeta functions
, 2005 Dynamical zeta functions provide a powerful method to analyze low dimensional dynamical systems when the underlying symbolic dynamics is under control.
Artuso R +11 more
core +1 more source
Projective subdynamics and universal shifts [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 We study the projective subdynamics of two-dimensional shifts of finite type, which is the set of one-dimensional configurations that appear as columns in them.
Pierre Guillon
doaj +1 more source
Selfsimilarity, Simulation and Spacetime Symmetries [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 We study intrinsic simulations between cellular automata and introduce a new necessary condition for a CA to simulate another one. Although expressed for general CA, this condition is targeted towards surjective CA and especially linear ones.
Vincent Nesme, Guillaume Theyssier
doaj +1 more source