English
Related papers

Related papers: On the waiting time till some patterns occur in i.…

200 papers

The execution time of programs is a key element in many areas of computer science, mainly those where achieving good performance (e.g., scheduling in cloud computing) or a predictable one (e.g., meeting deadlines in embedded systems) is the…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-07-13 Matheus Henrique Junqueira Saldanha

The complete convergence for weighted sums of sequences of independent, identically distributed random variables under sublinear expectations space was studied. By moment inequality and truncation methods, we establish the equivalent…

Probability · Mathematics 2021-08-30 Mingzhou Xu , Kun Cheng

We present a new class of preconditioned iterative methods for solving linear systems of the form $Ax = b$. Our methods are based on constructing a low-rank Nystr\"om approximation to $A$ using sparse random matrix sketching. This…

Data Structures and Algorithms · Computer Science 2025-04-14 Michał Dereziński , Christopher Musco , Jiaming Yang

The emergence of self-sustaining autocatalytic networks in chemical reaction systems has been studied as a possible mechanism for modelling how living systems first arose. It has been known for several decades that such networks will form…

Molecular Networks · Quantitative Biology 2020-11-24 Stuart Kauffman , Mike Steel

Linear temporal logic was introduced in order to reason about reactive systems. It is often considered with respect to infinite words, to specify the behaviour of long-running systems. One can consider more general models for linear time,…

Logic in Computer Science · Computer Science 2011-01-11 Julien Cristau

We describe a situation where an unstable equilibrium in a $3 \times 3$ system of linear differential equations may be stabilized by introducing a delayed response, i.e. converting to a system of delayed differential equations. This…

Dynamical Systems · Mathematics 2022-09-02 Alena Chan

A special case of the satisfiability problem, in which the clauses have a hierarchical structure, is shown to be solvable in linear time, assuming that the clauses have been represented in a convenient way.

Computational Complexity · Computer Science 2008-02-03 Donald E. Knuth

The Collatz sequence for a given natural number $N$ is generated by repeatedly applying the map $N$ $\rightarrow$ $3N+1$ if $N$ is odd and $N$ $\rightarrow$ $N/2$ if $N$ is even. One elusive open problem in Mathematics is whether all such…

General Mathematics · Mathematics 2019-11-11 Rafael Ruggiero

Reaction-diffusion systems with time-delay defined on complex networks have been studied in the framework of the emergence of Turing instabilities. The use of the Lambert W-function allowed us get explicit analytic conditions for the onset…

Statistical Mechanics · Physics 2016-08-03 Julien Petit , Malbor Asllani , Duccio Fanelli , Ben Lauwens , Timoteo Carletti

In this research a continuous model for resource allocations in a queuing system is considered and a local prediction on the system behavior is developed. As a result we obtain a set of possible cases, some of which lead to quite clear…

Optimization and Control · Mathematics 2022-09-13 Tikhon Bogachev

One fundamental problem in studying dynamical process is whether it is possible and how to construct prediction model for an unknown system via sampled time series, especially in the modern big data era. The research in this area is…

Dynamical Systems · Mathematics 2024-11-15 Xiao-Song Yang

Probability generating functions for first passage times of Markov chains are found using the method of collective marks. A system of equations is found which can be used to obtain moments of the first passage times.

Probability · Mathematics 2019-08-14 Yiping ZHANG , Myron HLYNKA , Percy H. BRILL

This paper gives a method for computing distributions associated with patterns in the state sequence of a hidden Markov model, conditional on observing all or part of the observation sequence. Probabilities are computed for very general…

Methodology · Statistics 2007-12-18 John A. D. Aston , Donald E. K. Martin

The standard model of particle physics lies in an enormous number of string vacua. In a nonperturbative formulation of string theory, various string vacua can, in principle, be compared dynamically, and the probability distribution over the…

High Energy Physics - Theory · Physics 2013-05-30 Hajime Aoki

A previous article was devoted to an analysis of the symmetry properties of a class of first-order delay ordinary differential systems (DODSs). Here we concentrate on linear DODSs. They have infinite-dimensional Lie point symmetry groups…

Mathematical Physics · Physics 2018-05-09 Vladimir A. Dorodnitsyn , Roman Kozlov , Sergey V. Meleshko , Pavel Winternitz

Linear systems governed by continuous-time difference equations cover a wide class of linear systems. From the Lyapunov-Krasovskii approach, we investigate stability for such a class of systems. Sufficient conditions, and in some particular…

Optimization and Control · Mathematics 2013-12-30 S. Damak , M. Di Loreto , W. Lombardi , V Andrieu

For the first time, using a modified Ikeda model it is demonstrated analytically that anticipating synchronization can be obtained in chaotic time-delay systems governed by two characteristic delay times. We derive existence and stability…

Chaotic Dynamics · Physics 2007-05-23 E. M. Shahverdiev , S. Sivaprakasam , K. A. Shore

We reinvestigate the dynamical behavior of a first order scalar nonlinear delay differential equation with piecewise linearity and identify several interesting features in the nature of bifurcations and chaos associated with it as a…

Chaotic Dynamics · Physics 2015-06-26 D. V. Senthilkumar , M. Lakshmanan

We investigate a method of generating a graph $G=(V,E)$ out of an ordered list of $n$ distinct real numbers $a_1, \dots, a_n$. These graphs can be used to test for the presence of interesting structure in the sequence. We describe sequences…

Combinatorics · Mathematics 2022-08-10 Dana G. Korssjoen , Biyao Li , Stefan Steinerberger , Raghavendra Tripathi , Ruimin Zhang

Our goal is to find a necessary and sufficient condition on the consensus over a random network, generated by i.i.d. stochastic matrices. We show that the consensus problem in three different convergence modes (almost surely, in…

Networking and Internet Architecture · Computer Science 2010-04-22 Qingshuo Song , Guanrong Chen , Daniel W. C. Ho