
Souvik RoyAhmedabad University · School of Engineering and Applied Science
Souvik Roy
Doctor of Philosophy
About
27
Publications
5,037
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
226
Citations
Introduction
Souvik Roy currently works at the Department of Information Technology, Indian Institute of Engineering Science and Technology, Shibpur. Souvik does research in Cellular Automata, Distributed Computing and Applied Mathematics. Their current project is 'Cellular Automata.'
Skills and Expertise
Publications
Publications (27)
Reversibility is a well-studied property for deterministic cellular automata but it is only partially explored when randomness appears in the update or in the transitions. Here, we present a detailed study of 21 finite-size elementary cellular automata with a fully asynchronous updating and periodic boundary conditions. We estimate their degree of...
This paper reports a special class of cellular automata machines that can solve graph theoretic problems, such as spanning tree problem and single source shortest path problem. The machine deals with planar graphs only. We first develop two-dimensional cellular automata to solve the graph theoretic problems for planar graphs. Next, we design the ha...
This paper introduces a new model of cellular automata where two rules (say, f and g) are applied temporally on the cells with some probability. The rule f is called default rule and g is the noise which is applied with probability \(\tau \) (noise rate). This new class of automata is named as Temporally Stochastic Cellular Automata (TSCAs). The dy...
This work explores randomness enhancing capability of asynchronous cellular automata. This paper first reports theoretical results to identify elementary cellular automata under fully asynchronous updating scheme with large cycle of length 2n or 2n − 1. To predict the randomness enhancing capability, we classify these large cycle asynchronous cellu...
This paper studies the basins of attraction of fully asynchronous cellular automata (ACAs) that converge to point attractor. Unlike traditional (synchronous) cellular automata (CAs), an ACA may approach to different point attractors from the same initial condition for different runs. In this direction, this paper introduces the notion of cloud beha...
The generic fluidity observed in the nature of political protest movements across the world during the last decade weigh heavily with the presence of social media. As such, there is a possibility to study the contemporary movements with an interdisciplinary approach combining computational analytics with social science perspectives. The present stu...
This paper explores the potential of elementary cellular automata to model the dynamics of riot. Here, to model such dynamics, we introduce probabilistic loss of information and delay perturbation in the updating scheme of automata to capture sociological parameters—presence of anti-riot population and organizational presence of communal forces in...
This article introduces temporally stochastic cellular automata where a cell of the cellular system can be updated using one of the two elementary cellular automata rules, say f and g. The f is the default rule and g is temporally applied to the overall system with some probability that acts as noise to the system. As the mathematical analysis of s...
This book brings together the impact of Prof. John Horton Conway, the playful and legendary mathematician's wide range of contributions in science which includes research areas—Game of Life in cellular automata, theory of finite groups, knot theory, number theory, combinatorial game theory, and coding theory. It contains transcripts where some emin...
This work explores randomness enhancing capability of asynchronous cellular automata. This paper first reports theoretical results to identify elementary cellular automata under fully asynchronous updating scheme with large cycle of length \(2^n\) or \(2^n - 1\). To predict the pseudo-random number generation capability, we classify these large cyc...
This thesis studies the potential of solving distributed systems problems by cellular automata (CAs). A cellular automaton (CA) is defined over a regular grid, each cell of which consists of a finite automaton that interacts with its neighbours to go to its next state. Since their inception, CAs have remained a natural choice of modelling distribut...
The generic fluidity observed in the nature of political protest movements across the world during the last decade weigh heavily with the presence of social media. As such, there is a possibility to study the contemporary movements with an interdisciplinary approach combining computational analytics with social science perspectives. The present stu...
In the light of recent developments in the theory of reversibility for asynchronous cellular automata, we attempt to explore the dynamics of recurrent rules under fully asynchronous updating scheme. Depending on the reachability of the configurations for a communication class during the evolution of the system, we classify the recurrent rules into...
Cellular automata (CAs) are dynamical systems that exhibit complex global behavior from simple local interaction and computation. Since the inception of CA by von Neumann in $1950s$, it has attracted the attention of several researchers over various backgrounds and fields for modeling different physical, natural as well as real-life phenomena. Clas...
This is the outcome of a real-time travel through the beautiful landscape of logic revealed in the morphology of informatics. A group of researchers of Department of Information Technology of IIEST, Shibpur and their teachers took a journey along with one Professor
of logic who had experienced this walk several times before. But the togetherness, u...
Classically, in cellular automata, no delay in information sharing among the neighbouring cells is considered. However, this assumption is not generally true for natural complex systems (such as physical, biological, social systems) and distributed systems where information sharing (non-uniform) delay cannot generally be ignored. Moreover, sometime...
This paper studies convergence of elementary cellular automata to a fixed point under fully asynchronous update. We study four possible cases– convergence of automata for any size and for the sizes that are multiple of 2, multiple of 3 and multiple of 4 only. We identify 146 cellular automata rules that converge for any size. Further, we also ident...
This work introduces the distributed spanning tree problem in the domain of cellular automata. We present a cellular automaton that computes a spanning tree of a given (grid) graph. The time required for this computation is $\mathcal{O}(n\log{}n)$, where $n$ is the number of nodes of the graph.
This work introduces the mutual exclusion problem in the domain of cellular automata (CAs). We show that it is impossible to solve this problem by a 1-D CA under periodic boundary condition for all possible initial configurations. We, then, classify the valid initial configurations of 1-D CAs into six classes, and show that for some classes of init...
This paper designs an efficient two-class pattern classifier utilizing
asynchronous cellular automata (ACAs). The two-state three-neighborhood
one-dimensional ACAs that converge to fixed points from arbitrary seeds are
used here for pattern classification. To design the classifier, we first
identify a set of ACAs that always converge to fixed point...
Cellular automata (CAs) are dynamical systems which exhibit complex global behavior from simple local interaction and computation. Since the inception of cellular automaton (CA) by von Neumann in 1950s, it has attracted the attention of several researchers over various backgrounds and fields for modelling different physical, natural as well as real...