Home › Researcher directory › Rafik Aguech
Rafik Aguech
Affiliation : King Saud University
- 21Publications (affiliation in Tunisia)
- 41Total publications
- 126Citations
- 6h-index
Research profile
Rafik Aguech has 21 indexed publications (2005–2026). Their work appears mainly in “Discrete Mathematics & Theoretical Computer Science”, “arXiv (Cornell University)” and “International Journal of Computer Mathematics Computer Systems Theory”. Their most cited article, “Limit Theorems for Random Triangular URN Schemes” (2009), has been cited 33 times. 3 of these publications date from the last three years of activity. Their work is co-authored with at least 4 researchers, including institutions in Saudi Arabia, France.
Is this you? Get your research seen
Create your free DzCademia profile and add your articles: they will show up more easily on Google and in AI assistants like ChatGPT, so more people can read and cite your work.
Create my free profile Add my publicationsResearch areas
- Stochastic processes and statistical mechanics
- Probability and Statistical Research
- Advanced Combinatorial Mathematics
- Point processes and geometric inequalities
- Fractional Differential Equations Solutions
Publications (21)
- On a class of unbalanced step-reinforced random walks
- Exponentially preferential trees
- On the protected nodes in exponential recursive trees
- Height of walks with resets, the Moran model, and the discrete Gumbel distribution
- Unbalanced multi-drawing urn with random addition matrix II
- Multiple-drawing dynamic Friedman urns with opposite-reinforcement
- Moments of a non‐homogenous bi‐variate fragmentation process using integral equations tools
- Some properties of exponential trees
- Nonhomogenous bivariate fragmentation process: Asymptotic distribution via contraction method
- Unbalanced multi-drawing urn with random addition matrix II
- Unbalanced multi-drawing urn with random addition matrix
- A generalized urn with multiple drawing and random addition
- New characterizations of completely monotone functions and Bernstein functions, a converse to Hausdorff’s moment characterization theorem
- On Weighted Depths in Random Binary Search Trees
- Limit Theorems for Random Triangular URN Schemes
- The size of random fragmentation intervals
- Limit distribution of distances in biased random tries
- EXTREMAL WEIGHTED PATH LENGTHS IN RANDOM BINARY SEARCH TREES
- Distances in random digital search trees
- On the asymptotic independent representations for sums of some weakly dependent random variables
- Distribution of inter-node distances in digital trees
Publication venues
- Discrete Mathematics & Theoretical Computer Science × 3
- arXiv (Cornell University) × 2
- International Journal of Computer Mathematics Computer Systems Theory × 2
- Probability in the Engineering and Informational Sciences × 2
- Mathematical Methods in the Applied Sciences × 2
- Arab Journal of Mathematical Sciences × 2
Publications per year
- 20261
- 20251
- 20241
- 20233
- 20221
- 20213
- 20191
- 20182
- 20171
- 20091
Collaborations
Partner institutions : University of Monastir · Tunis El Manar University · Tunis University · Université Sorbonne Paris Nord · Laboratoire d'Informatique de Paris-Nord
Co-authors’ countries : Saudi Arabia · France
Co-authors
Bibliographic data from OpenAlex (open database).
Why choose DzCademia?
Profiles, articles and conference contributions: give your research a structured public presence. Integrated metadata help search engines and AI assistants identify your work and understand its references.
Comment with Google
Sign in with Google to comment directly on this page.