Pub Date : 2026-01-15DOI: 10.1007/s10114-026-4134-9
Ziling Cheng
We study supercritical age-structured branching models starting from a single particle with a random lifetime, where the reproduction law depends on the remaining lifetime of the parent. The lifespan of an individual is decided at its birth and its remaining lifetime decreases at the unit speed. A necessary and sufficient condition is provided for the convergence of the Malthusian normalized random measures. The Malthusian type limit theory in a functional form can be strengthened to hold with probability one under some “L log L” conditions. We further prove a central limit theory with a random normalization factor.
{"title":"Limit Theorems for Supercritical Remaining-lifetime Age-structured Branching Processes","authors":"Ziling Cheng","doi":"10.1007/s10114-026-4134-9","DOIUrl":"10.1007/s10114-026-4134-9","url":null,"abstract":"<div><p>We study supercritical age-structured branching models starting from a single particle with a random lifetime, where the reproduction law depends on the remaining lifetime of the parent. The lifespan of an individual is decided at its birth and its remaining lifetime decreases at the unit speed. A necessary and sufficient condition is provided for the convergence of the Malthusian normalized random measures. The Malthusian type limit theory in a functional form can be strengthened to hold with probability one under some “<i>L</i> log <i>L</i>” conditions. We further prove a central limit theory with a random normalization factor.</p></div>","PeriodicalId":50893,"journal":{"name":"Acta Mathematica Sinica-English Series","volume":"42 1","pages":"50 - 84"},"PeriodicalIF":0.9,"publicationDate":"2026-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147339462","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-15DOI: 10.1007/s10114-026-4223-9
Yuanpei Wang, Liying Kang
Given a graph H and an integer p ≥ 2, the edge blow-up graph Hp+1 of H is the graph obtained by replacing each edge in H with a clique of order p + 1, where the new vertices of the cliques are all distinct. The generalized Turán number ex(n, Km, F) denote the maximum number of copies of Km in an n-vertex F-free graph. Let Ct and Pt denote the cycle and path with t vertices, respectively. In this paper, we obtain the generalized Turán numbers ex(n, Km, P