An induced forest of a graph G is an acyclic induced subgraph of G. The present paper is devoted to the analysis of a simple randomised algorithm that grows an induced forest in a regular graph. The expected size of the forest it outputs provides a lower bound on the maximum number of vertices in an induced forest of G. When the girth is large and the degree is at least 4, our bound coincides w...

The convergence of polyhomogeneous expansions of zero-rest-mass fields in asymptotically flat spacetimes is discussed. An existence proof for the asymptotic characteristic initial value problem for a zero-rest-mass field with polyhomogeneous initial data is given. It is shown how this non-regular problem can be properly recast as a set of regular initial value problems for some auxiliary fields...

The mean time to extinction of a critical Galton–Watson process with initial population size k is shown to be asymptotically equivalent to two integral transforms: one involving the kth iterate of the probability generating function and one involving the generating function itself. Relating the growth of these transforms to the regular variation of their arguments, immediately connects statemen...

In this paper we provide an explicit way to compute asymptotically almost sure upper bounds on the bisection width of random d-regular graphs, for any value of d. The upper bounds are obtained from the analysis of the performance of a randomized greedy algorithm to find bisections of d-regular graphs. We provide bounds for 5 ≤ d ≤ 12. We also give empirical values of the size of the bisection f...

We construct regular, asymptotically flat black holes of higher order scalar tensor (DHOST) theories, which are obtained by making use a generalized Kerr-Schild solution generating method. The solutions depend on mass integration constant, admit smooth core chosen regularity, and generically have an inner outer event horizon. In particular, below certain threshold, we find massive, horizonless,...

We investigate a semiparametric regression model where one gets noisy non linear non invertible functions of the observations. We focus on the application to bearings-only tracking. We first investigate the least squares estimator and prove its consistency and asymptotic normality under mild assumptions. We study the semiparametric likelihood process and prove local asymptotic normality of the ...

A proper edge colouring of a graph is neighbour-distinguishing if for all pairs of adjacent vertices v, w the set of colours appearing on the edges incident with v is not equal to the set of colours appearing on the edges incident with w. Let ndi(G) be the least number of colours required for a proper neighbour-distinguishing edge colouring of G. We prove that for d ≥ 4, a random d-regular grap...

This work is devoted to the exploration of shadow cast and center mass energy in background a 4-dimensional charged Gauss-Bonnet AdS black hole. On investigating particle dynamics, we have examined BH's metric function. Whereas, with help null geodesics, pursue calculate celestial coordinates radius We made use hawking temperature study emission rate. Moreover, explored discussed its characteri...

This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in a random graph. We present the results of an experimental investigation of the comparative performance of several efficient heuristics for constructing maximal independent sets. Among the algorithms that we evaluate ...

In regular statistical models, the leave-one-out cross-validation is asymptotically equivalent to the Akaike information criterion. However, since many learning machines are singular statistical models, the asymptotic behavior of the cross-validation remains unknown. In previous studies, we established the singular learning theory and proposed a widely applicable information criterion, the expe...