Runs of a discrete time regenerative phenomenon

1974 ◽  
Vol 11 (3) ◽  
pp. 588-593 ◽  
Author(s):  
J. P. Imhof
Keyword(s):  
Discrete Time ◽  
Fluctuation Theory ◽  
Limiting Behavior ◽  
The One ◽  
Positive Integers ◽  
Regenerative Phenomenon

The limiting behavior of the number of runs up to time n of a regenerative phenomenon on the positive integers is related to the one of the number of regenerations. Applications are considered in fluctuation theory, and for the GI/G/1 queue.

Runs of a discrete time regenerative phenomenon

1974 ◽  
Vol 11 (03) ◽  
pp. 588-593
Author(s):  
J. P. Imhof
Keyword(s):  
Discrete Time ◽  
Fluctuation Theory ◽  
Limiting Behavior ◽  
The One ◽  
Positive Integers ◽  
Regenerative Phenomenon

The limiting behavior of the number of runs up to time n of a regenerative phenomenon on the positive integers is related to the one of the number of regenerations. Applications are considered in fluctuation theory, and for the GI/G/1 queue.

scholarly journals A note on primes in certain residue classes

2018 ◽  
Vol 14 (08) ◽  
pp. 2219-2223
Author(s):  
Paolo Leonetti ◽  
Carlo Sanna
Keyword(s):  
Positive Integer ◽  
Asymptotic Density ◽  
Residue Classes ◽  
Euler Totient Function ◽  
The One ◽  
Positive Integers

Given positive integers [Formula: see text], we prove that the set of primes [Formula: see text] such that [Formula: see text] for [Formula: see text] admits asymptotic density relative to the set of all primes which is at least [Formula: see text], where [Formula: see text] is the Euler totient function. This result is similar to the one of Heilbronn and Rohrbach, which says that the set of positive integer [Formula: see text] such that [Formula: see text] for [Formula: see text] admits asymptotic density which is at least [Formula: see text].

The non-uniform stationary measure for discrete-time quantum walks in one dimension

2015 ◽  
Vol 15 (11&12) ◽  
pp. 1060-1075
Author(s):  
Norio Konno ◽  
Masato Takei
Keyword(s):  
Eigenvalue Problem ◽  
Discrete Time ◽  
Quantum Walks ◽  
Stationary Measure ◽  
Unitary Matrix ◽  
Uniform Measure ◽  
Simple Argument ◽  
Stationary Measures ◽  
Time Quantum ◽  
The One

We consider stationary measures of the one-dimensional discrete-time quantum walks (QWs) with two chiralities, which is defined by a 2 $\times$ 2 unitary matrix $U$. In our previous paper \cite{Konno2014}, we proved that any uniform measure becomes the stationary measure of the QW by solving the corresponding eigenvalue problem. This paper reports that non-uniform measures are also stationary measures of the QW except when $U$ is diagonal. For diagonal matrices, we show that any stationary measure is uniform. Moreover, we prove that any uniform measure becomes a stationary measure for more general QWs not by solving the eigenvalue problem but by a simple argument.

scholarly journals Equations with powers of singular moduli

2019 ◽  
Vol 15 (03) ◽  
pp. 445-468 ◽  
Author(s):  
Antonin Riffaut
Keyword(s):  
Rational Number ◽  
The Other ◽  
Other Hand ◽  
Singular Moduli ◽  
Cm Points ◽  
The One ◽  
Straight Lines ◽  
Positive Integers

We treat two different equations involving powers of singular moduli. On the one hand, we show that, with two possible (explicitly specified) exceptions, two distinct singular moduli [Formula: see text] such that the numbers [Formula: see text], [Formula: see text] and [Formula: see text] are linearly dependent over [Formula: see text] for some positive integers [Formula: see text], must be of degree at most [Formula: see text]. This partially generalizes a result of Allombert, Bilu and Pizarro-Madariaga, who studied CM-points belonging to straight lines in [Formula: see text] defined over [Formula: see text]. On the other hand, we show that, with obvious exceptions, the product of any two powers of singular moduli cannot be a non-zero rational number. This generalizes a result of Bilu, Luca and Pizarro-Madariaga, who studied CM-points belonging to a hyperbola [Formula: see text], where [Formula: see text].

The fog on: Generalized teleportation by means of discrete-time quantum walks on N-lines and N-cycles

2019 ◽  
Vol 33 (23) ◽  
pp. 1950270 ◽  
Author(s):  
Duc Manh Nguyen ◽  
Sunghwan Kim
Keyword(s):  
Discrete Time ◽  
Quantum Teleportation ◽  
Quantum Walk ◽  
Quantum Walks ◽  
One Dimensional ◽  
Time Quantum ◽  
Infinite Line ◽  
The One

The recent paper entitled “Generalized teleportation by means of discrete-time quantum walks on [Formula: see text]-lines and [Formula: see text]-cycles” by Yang et al. [Mod. Phys. Lett. B 33(6) (2019) 1950069] proposed the quantum teleportation by means of discrete-time quantum walks on [Formula: see text]-lines and [Formula: see text]-cycles. However, further investigation shows that the quantum walk over the one-dimensional infinite line can be based over the [Formula: see text]-cycles and cannot be based on [Formula: see text]-lines. The proofs of our claims on quantum walks based on finite lines are also provided in detail.

scholarly journals The naming game in language dynamics revisited

2014 ◽  
Vol 51 (A) ◽  
pp. 139-158
Author(s):  
Nicolas Lanchier
Keyword(s):  
Mean Field ◽  
Field Approximation ◽  
Point Of View ◽  
Mean Field Approximation ◽  
Complete Graphs ◽  
Naming Game ◽  
Limiting Behavior ◽  
Linguistic Convention ◽  
Regular Lattices ◽  
The One

In this article we study a biased version of the naming game in which players are located on a connected graph and interact through successive conversations in order to select a common name for a given object. Initially, all the players use the same word B except for one bilingual individual who also uses word A. Both words are attributed a fitness, which measures how often players speak depending on the words they use and how often each word is spoken by bilingual individuals. The limiting behavior depends on a single parameter, ϕ, denoting the ratio of the fitness of word A to the fitness of word B. The main objective is to determine whether word A can invade the system and become the new linguistic convention. From the point of view of the mean-field approximation, invasion of word A is successful if and only if ϕ > 3, a result that we also prove for the process on complete graphs relying on the optimal stopping theorem for supermartingales and random walk estimates. In contrast, for the process on the one-dimensional lattice, word A can invade the system whenever ϕ > 1.053, indicating that the probability of invasion and the critical value for ϕ strongly depend on the degree of the graph. The system on regular lattices in higher dimensions is also studied by comparing the process with percolation models.

Optimality of the one step look-ahead stopping times

1977 ◽  
Vol 14 (1) ◽  
pp. 162-169 ◽  
Author(s):  
M. Abdel-Hameed
Keyword(s):  
Markov Process ◽  
Discrete Time ◽  
Measurable Function ◽  
Infinitesimal Generator ◽  
Stopping Time ◽  
Stopping Times ◽  
Homogeneous Markov Process ◽  
Look Ahead ◽  
One Step ◽  
The One

The optimality of the one step look-ahead stopping rule is shown to hold under conditions different from those discussed by Chow, Robbins and Seigmund [5]. These results are corollaries of the following theorem: Let {Xn, n = 0, 1, …}; X0 = x be a discrete-time homogeneous Markov process with state space (E, ℬ). For any ℬ-measurable function g and α in (0, 1], define Aαg(x) = αExg(X1) – g(x) to be the infinitesimal generator of g. If τ is any stopping time satisfying the conditions: Ex[αNg(XN)I(τ > N)]→0 as as N → ∞, then Applications of the results are considered.

Conditions for strong ergodicity using intensity matrices

1988 ◽  
Vol 25 (1) ◽  
pp. 34-42 ◽  
Author(s):  
Jean Johnson ◽  
Dean Isaacson
Keyword(s):  
Markov Chains ◽  
Rate Of Convergence ◽  
Discrete Time ◽  
Continuous Time ◽  
Sufficient Conditions ◽  
Limiting Behavior ◽  
Strong Ergodicity ◽  
Continuous Time Markov Chains

Sufficient conditions for strong ergodicity of discrete-time non-homogeneous Markov chains have been given in several papers. Conditions have been given using the left eigenvectors ψn of Pn(ψ nPn = ψ n) and also using the limiting behavior of Pn. In this paper we consider the analogous results in the case of continuous-time Markov chains where one uses the intensity matrices Q(t) instead of P(s, t). A bound on the rate of convergence of certain strongly ergodic chains is also given.

scholarly journals Diagnosis of Discrete-Time Singularly Perturbed Systems Based on Slow Subsystem

2014 ◽  
Vol 8 (4) ◽  
pp. 175-180 ◽  
Author(s):  
Adel Tellili ◽  
Nouceyba Abdelkrim ◽  
Bahaa Jaouadi ◽  
Mohamed Naceur Abdelkrim
Keyword(s):  
Discrete Time ◽  
Diagnostic Algorithm ◽  
Perturbation Parameter ◽  
Singularly Perturbed ◽  
Order System ◽  
Singularly Perturbed Systems ◽  
Perturbed Systems ◽  
Parity Space ◽  
The One ◽  
Slow Subsystem

Abstract This paper deals with the diagnosis of discrete-time singularly perturbed systems presenting two time scales property. Parity space method is considered to generate the fault detection residual. The focus is in two directions. First, we discuss the residual illconditioning caused by the singular perturbation parameter. Then, the use of the slow subsystem is considered to make the fault diagnosis easier. It is shown that the designed diagnostic algorithm based on reduced order model is close to the one synthesized using the full order system. The developed approach aims at reducing the computational load and the ill-conditioning for stiff residual generation problem. Two examples of application are used to demonstrate the efficiency of the proposed method.

Sign in / Sign up

Export Citation Format

Share Document