Job recommender systems (JRS) are a subclass of information filtering systems that aims to help job seekers identify what might match their skills and experiences and prevent them from being lost in the vast amount of information available on job boards that aggregates postings from many sources such as LinkedIn or Indeed. A variety of strategies used as part of JRS have been implemented, most of them failed to recommend job vacancies that fit properly to the job seekers profiles when dealing with more than one job offer. They consider skills as passive entities associated with the job description, which need to be matched for finding the best job recommendation. This paper provides a recommender system to assist job seekers in finding suitable jobs based on their resumes. The proposed system recommends the top-n jobs to the job seekers by analyzing and measuring similarity between the job seeker’s skills and explicit features of job listing using content-based filtering. First-hand information was gathered by scraping jobs description from Indeed from major cities in Saudi Arabia (Dammam, Jeddah, and Riyadh). Then, the top skills required in job offers were analyzed and job recommendation was made by matching skills from resumes to posted jobs. To quantify recommendation success and error rates, we sought to compare the results of our system to reality using decision support measures.

Let $\partial \mathsf{T}$ be a super-critical Galton–Watson tree. Recently, the first author computed almost surely and simultaneously the Hausdorff dimensions of the sets of infinite branches of the boundary of $\partial \mathsf{T}$ along which the sequence $S_n\mathsf{X}\left(t\right)/S_n\tilde{\mathsf{X}}\left(t\right)$ has a given set of limit points, where $S_n\mathsf{X}\left(t\right)$ and $S_n\tilde{\mathsf{X}}\left(t\right)$ are two branching random walks defined on $\partial \mathsf{T}$. In this study, we are interested in the study of the speed of convergence of this sequence. More precisely, for a given sequence $s=\left(s_n\right)$, we consider $E_{\alpha ,s}=\left\{t\in \partial \mathsf{T}:S_n\mathsf{X}\left(t\right)-\alpha S_n\tilde{\mathsf{X}}\left(t\right)\sim s_n\mathrm{as}n\to +\infty \right\}.$ We will give a sufficient condition on $\left(s_n\right)$ so that $E_{\alpha ,s}$ has a maximal Hausdorff and packing dimension.