Asymptotically independent topological indices on random trees

Topological indices are graph invariants used in computational chemistry to encode molecules. A frequent problem when performing structure-activity studies is that topological indices are inter-correlated. We consider a simple topological index and show asymptotic independence for a random tree model. This continues previous work on the correlation among topological indices. These findings suggest that a size-dependence in a certain class of distance-based topological indices can be eliminated.AMS subject classification: 05C80, 60E10, 92E10     

关于随机变量期望方差的两个注记

文献[1]中给出了有关条件期望与三个随机变量独立的两个充要条件,本文通过几个反例说明其充分性是不成立的.分析了文献[4]中一个定理证明存在的错误,并给出了新的证明.     

Unprovability of a “precognition” effect in quantum mechanics

It is shown that nonlocality gives rise to an undecidable proposition, meaning it cannot be proved true nor proved false from the usual assumptions, but is independent of them. A variation on the usual thought experiment is considered in which the observers are timelike separated, but the nonlocality fails to become a precognition effect because of this independence result.     

Stationary queues with one autonomous server

Given a stationary stochastic continuous demand of service σ(θ_tω) dt with ∫ σ(ω)P(dω) < 1, we construct real stationary point processes $\text{(T}{}_{\mathrm{n}}\text{, n ∈}\text{Z}\text{)[T}{}_{\mathrm{n}}\text{< T}{}_{\mathrm{n}}\text{+1, lim}{}_{\mathrm{\pm \infty }}\text{T}{}_{\mathrm{n}}\text{= ±∞]}$ such that

for a given constant D \2>0. These point processes correspond to a service discipline for which a single server services during the time intervals [T_n, T_n+1[ the demand of service accumulated during the proceding intervals [T_n?1, T_n[ and take a rest of fixed duration D.     

On the statistical independence of various column contributions to band broadening. Part 1: Second moment contributions from statistically independent,longitudinal diffusion in both phases

The total length-based second moment contribution from longitudinal sample diffusion in both phases on a column, σD , is derived by adding individual partial differential contributions to a partial differential equation accounting for the longitudinal diffusion processes only. Although each diffusion-dispersed sample part is equilibrated between two phases, the resulting σ,D (= 2D _mt _m + 2D _st _s) can be interpreted as the sum of two independent contributions in accordance with the variance addition rule. (D _m and D _s are the mean diffusion coefficients and t _mand t _s the mean residence times of the sample in the mobile and stationary phases, respectively.) The same σD expression is derived from the random walk model of Giddings by treating the diffusional process in each phase as statistically independent of the other processes. Under these conditions the broadening contribution from longitudinal diffusion in the mobile phase is shown to be independent of the velocity profile.     

Convergence issues in using high‐resolution schemes and lower–upper symmetric Gauss–Seidel method for steady shock‐induced combustion problems

This paper reports numerical convergence study for simulations of steady shock‐induced combustion problems with high‐resolution shock‐capturing schemes. Five typical schemes are used: the Roe flux‐based monotone upstream‐centered scheme for conservation laws (MUSCL) and weighted essentially non‐oscillatory (WENO) schemes, the Lax–Friedrichs splitting‐based non‐oscillatory no‐free parameter dissipative (NND) and WENO schemes, and the Harten–Yee upwind total variation diminishing (TVD) scheme. These schemes are implemented with the finite volume discretization on structured quadrilateral meshes in dimension‐by‐dimension way and the lower–upper symmetric Gauss–Seidel (LU–SGS) relaxation method for solving the axisymmetric multispecies reactive Navier–Stokes equations. Comparison of iterative convergence between different schemes has been made using supersonic combustion flows around a spherical projectile with Mach numbers M = 3.55 and 6.46 and a ram accelerator with M = 6.7. These test cases were regarded as steady combustion problems in literature. Calculations on gradually refined meshes show that the second‐order NND, MUSCL, and TVD schemes can converge well to steady states from coarse through fine meshes for M = 3.55 case in which shock and combustion fronts are separate, whereas the (nominally) fifth‐order WENO schemes can only converge to some residual level. More interestingly, the numerical results show that all the schemes do not converge to steady‐state solutions for M = 6.46 in the spherical projectile and M = 6.7 in the ram accelerator cases on fine meshes although they all converge on coarser meshes or on fine meshes without chemical reactions. The result is based on the particular preconditioner of LU–SGS scheme. Possible reasons for the nonconvergence in reactive flow simulation are discussed.Copyright © 2012 John Wiley & Sons, Ltd.     

Analysis of the multiple roots of the Lundberg fundamental equation in the PH (n) risk model

In the study of the Sparre Andersen risk model with phase‐type (n) inter‐claim times (PH (n) risk model), the distinct roots of the Lundberg fundamental equation in the right half of the complex plane and the linear independence of the eigenvectors related to the Lundberg matrix L_δ(s) play important roles. In this paper, we study the case where the Lundberg fundamental equation has multiple roots or the corresponding eigenvectors are linearly dependent in the PH (n) risk model. We show that the multiple roots of the Lundberg fundamental equation det[L_δ(s)] = 0 can be approximated by the distinct roots of the generalized Lundberg equation introduced in this paper and that the linearly dependent eigenvectors can be approximated by the corresponding linearly independent ones as well. Using this result we derive the expressions for the Gerber–Shiu penalty function. Two special cases of the generalized Erlang(n) risk model and a Coxian(3) risk model are discussed in detail, which illustrate the applicability of main results. Finally, we consider the PH(2) risk model and conclude that the roots of the Lundberg fundamental equation in the right half of the complex plane are distinct and that the corresponding eigenvectors are linearly independent. Copyright © 2011 John Wiley & Sons, Ltd.     

On percolation and ‐hardness

The edge‐percolation and vertex‐percolation random graph models start with an arbitrary graph G, and randomly delete edges or vertices of G with some fixed probability. We study the computational complexity of problems whose inputs are obtained by applying percolation to worst‐case instances. Specifically, we show that a number of classical ‐hard problems on graphs remain essentially as hard on percolated instances as they are in the worst‐case (assuming ). We also prove hardness results for other ‐hard problems such as Constraint Satisfaction Problems and Subset‐Sum, with suitable definitions of random deletions. Along the way, we establish that for any given graph G the independence number and the chromatic number are robust to percolation in the following sense. Given a graph G, let be the graph obtained by randomly deleting edges of G with some probability . We show that if is small, then remains small with probability at least 0.99. Similarly, we show that if is large, then remains large with probability at least 0.99. We believe these results are of independent interest.     

The trigonometric triangle

A procedure is presented by which the integration of a function such as cos ⁿ (x) or sin ⁿ (x) with n = 1, 2, 3, 4 … is facilitated.