Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Rafik Aguech"'
Autor:
Mohamed Abdelkader, Rafik Aguech
Publikováno v:
AIMS Mathematics, Vol 9, Iss 8, Pp 19888-19910 (2024)
We investigated the statistical properties of the Moran random walk $ (Y_n)_n $ in one dimension, focusing on short memory. Specifically, employing generating function techniques, we determined the cumulative distribution function and the mean of the
Externí odkaz:
https://doaj.org/article/e774ae14759c4abfbb2ca3d895965ef0
Autor:
Rafik Aguech
Publikováno v:
AIMS Mathematics, Vol 9, Iss 7, Pp 17784-17794 (2024)
In this paper, we investigate an extended version of the elephant random walk model. Unlike the traditional approach where step sizes remain constant, our model introduces a novel feature: step sizes are generated as a sequence of positive independen
Externí odkaz:
https://doaj.org/article/de1be4c2b1f24a42bd73baec9f7c5358
Autor:
Rafik Aguech
Publikováno v:
Axioms, Vol 13, Iss 9, p 629 (2024)
The ERW model was introduced twenty years ago to study memory effects in a one-dimensional discrete-time random walk with a complete memory of its past throughout a parameter p between zero and one. Several variations of the ERW model have recently b
Externí odkaz:
https://doaj.org/article/5b6fc6fe27e4405c95dfad40c3f7c55c
Autor:
Mehri Javanian, Rafik Aguech
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 25:2, Iss Combinatorics (2024)
The exponential recursive trees model several kinds of networks. At each step of growing of these trees, each node independently attracts a new node with probability p, or fails to do with probability 1 − p. Here, we investigate the number of prote
Externí odkaz:
https://doaj.org/article/423db1134d2b4f38ac4ee307ab9ceb3c
Autor:
Rafik Aguech, Hanene Mohamed
Publikováno v:
Mathematics, Vol 11, Iss 24, p 4967 (2023)
We study a system of M particles with jump dynamics on a network of N sites. The particles can exist in two states, active or inactive. Only the former can jump. The state of each particle depends on its position. A given particle is inactive when it
Externí odkaz:
https://doaj.org/article/fe0f4788923a47db999bfbc423ba6c28
Autor:
Rafik Aguech, Mohamed Abdelkader
Publikováno v:
Mathematics, Vol 11, Iss 17, p 3774 (2023)
In this paper, we consider a two-dimension symmetric random walk with reset. We give, in the first part, some results about the distribution of every component. In the second part, we give some results about the final altitude Zn. Finally, we analyse
Externí odkaz:
https://doaj.org/article/af5fcb1255c94cf98e8237c170189ac9
Autor:
Rafik Aguech, Wissem Jedidi
Publikováno v:
Arab Journal of Mathematical Sciences, Vol 25, Iss 1, Pp 57-82 (2019)
We give several new characterizations of completely monotone functions and Bernstein functions via two approaches: the first one is driven algebraically via elementary preserving mappings and the second one is developed in terms of the behavior of th
Externí odkaz:
https://doaj.org/article/bdadc368864f4b00a1a14a5ba78d2db4
Autor:
Rafik Aguech
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AI,..., Iss Proceedings (2008)
Two processes of random fragmentation of an interval are investigated. For each of them, there is a splitting probability at each step of the fragmentation process whose overall effect is to stabilize the global number of splitting events. More preci
Externí odkaz:
https://doaj.org/article/e3aae315b56e4898a7f66c58e6436eb0
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AD,..., Iss Proceedings (2005)
We investigate distances between pairs of nodes in digital trees (digital search trees (DST), and tries). By analytic techniques, such as the Mellin Transform and poissonization, we describe a program to determine the moments of these distances. The
Externí odkaz:
https://doaj.org/article/90da9a2bba5840bfb221d0eb9808af14
Autor:
Rafik, Aguech, Olfa, Selmi
Publikováno v:
In Arab Journal of Mathematical Sciences December 2018