Related papers: A Three-Regime Theorem for Flow-Firing
In this paper, we consider a reaction-diffusion system describing the propagation of flames under the assumption of ignition-temperature kinetics and fractional reaction order. It was shown in [3] that this system admits a traveling front…
In non-linear systems, where explicit analytic solutions usually can't be found, visualisation is a powerful approach which can give insights into the dynamical behaviour of models; it is also crucial for teaching this area of mathematics.…
The $k$-cap (or $k$-winners-take-all) process on a graph works as follows: in each iteration, exactly $k$ vertices of the graph are in the cap (i.e., winners); the next round winners are the vertices that have the highest total degree to…
Graph processing has become an important part of various areas of computing, including machine learning, medical applications, social network analysis, computational sciences, and others. A growing amount of the associated graph processing…
Graphics Processing Unit, or GPUs, have been successfully adopted both for graphic computation in 3D applications, and for general purpose application (GP-GPUs), thank to their tremendous performance-per-watt. Recently, there is a big…
This article deals with stabilizing discrete-time switched linear systems. Our contributions are threefold: Firstly, given a family of linear systems possibly containing unstable dynamics, we propose a large class of switching signals that…
The main purpose of this paper is mathematical analysis on time-periodic flows of electrons and holes in semiconductors. The flows appear in a situation that alternating-current voltages are applied to devices. In this paper, we study the…
A collection of arbitrarily-shaped solid objects, each moving at a constant speed, can be used to mix or stir ideal fluid, and can give rise to interesting flow patterns. Assuming these systems of fluid stirrers are two-dimensional, the…
Irregular computations on unstructured data are an important class of problems for parallel programming. Graph coloring is often an important preprocessing step, e.g. as a way to perform dependency analysis for safe parallel execution. The…
The present paper is concerned with the concept of the one-way quantum computer, beyond binary-systems, and its relation to the concept of stabilizer quantum codes. This relation is exploited to analyze a particular class of quantum…
Dripping, jetting and tip streaming have been studied up to a certain point separately by both fluid mechanics and microfluidics communities, the former focusing on fundamental aspects while the latter on applications. Here, we intend to…
Reaction systems are a computational model inspired by the bio-chemical reactions that happen inside biological cells. They have been and currently are studied for their many nice theoretical properties. They are also a useful modeling tool…
The past few years have seen many advances in our understanding of the dynamics of polymeric fluids. These include improvements on the successful reptation theory; an emerging molecular theory of semiflexible chain dynamics; and an…
A limit theorem for a sequence of diffusion processes on graphs is proved in a case when vary both parameters of the processes (the drift and diffusion coefficients on every edge and the asymmetry coefficients in every vertex), and…
This paper is a preliminary work to address the problem of dynamical systems with parameters varying in time. An idea to predict their behaviour is proposed. These systems are called \emph{transient systems}, and are distinguished from…
This paper investigates properties of the class of graphs based on exchangeable point processes. We provide asymptotic expressions for the number of edges, number of nodes and degree distributions, identifying four regimes: (i) a dense…
Neuromorphic computing targets energy-efficient event-driven information processing by placing artificial spiking-neurons at its core. Artificial neuron devices and circuits have multiple operating modes and produce region-dependent…
Graph burning is a discrete-time process on graphs, where vertices are sequentially burned, and burned vertices cause their neighbours to burn over time. We consider extremal properties of this process in the new setting where the…
Triple flickering buoyant diffusion flames in an isosceles triangle arrangement were experimentally studied as a nonlinear dynamical system of coupled oscillators. The objective of the study is two-fold: to establish a well-controlled…
Graph burning is a discrete process that models the spread of influence through a network using a fire as a proxy for the type of influence being spread. This process was recently extended to hypergraphs. We introduce a variant of…