Asymmetry and structural information in preferential attachment graphs

Graph symmetries intervene in diverse applications, from enumeration, to graph structure compression, to the discovery of graph dynamics (e.g., node arrival order inference). Whereas Erd?s‐Rényi graphs are typically asymmetric, real networks are highly symmetric. So a natural question is whether preferential attachment graphs, where in each step a new node with m edges is added, exhibit any symmetry. In recent work it was proved that preferential attachment graphs are symmetric for m = 1, and there is some nonnegligible probability of symmetry for m = 2. It was conjectured that these graphs are asymmetric when m ≥ 3. We settle this conjecture in the affirmative, then use it to estimate the structural entropy of the model. To do this, we also give bounds on the number of ways that the given graph structure could have arisen by preferential attachment. These results have further implications for information theoretic problems of interest on preferential attachment graphs.     

Spherically symmetric random permutations

We consider random permutations which are spherically symmetric with respect to a metric on the symmetric group S_n and are consistent as n varies. The extreme infinitely spherically symmetric permutation‐valued processes are identified for the Hamming, Kendall‐tau and Cayley metrics. The proofs in all three cases are based on a unified approach through stochastic monotonicity.     

二部图形式的Erd\H{O}s-S\'{o}s猜想

二部图形式的Erd\H{O}s-S\''{o}s猜想     

Ergodic theorems for queuing systems with dependent inter-arrival times

We study a G/GI/1 single-server queuing model with i.i.d. service times that are independent of a stationary process of inter-arrival times. We show that the distribution of the waiting time converges to a stationary law as time tends to infinity provided that inter-arrival times satisfy a Gärtner-Ellis type condition. A convergence rate is given and a law of large numbers established. These results provide tools for the statistical analysis of such systems, transcending the standard case with independent inter-arrival times.     

渐近正态随机变量函数的极限分布

基于渐近正态随机变量,导出随机变量函数极限分布的两个一般性理论结果.作为应用,证明了渐近正态随机变量一系列具体函数的极限分布,其中包括泊松随机变量平方根的渐近正态性,以及随机变量部分和在正则化常数是随机变量情况下的渐近正态性.     

基于IERT的非线性全光谱复杂水体定量分析算法研究

水是一种有限的资源,对农业、工业乃至人类的生存都是必不可少的,良好的水环境是可持续发展的重要保障。对水质信息的科学监测,是实现水资源优化配置与高效利用的基础。联合国环境署（UNEP）与世界卫生组织（WHO）指出,应当加强发展中国家的水质监测网络,包括数据质量的保证和分析能力的提高。光谱法作为一种新兴的水质分析方法,相比传统的化学水质监测方法,具有“响应速度快、多参数同步、绿色无污染”的特点。传统单波长、多波长的线性模型依赖于水体对特定波长的吸收特征,不适用于多组分混合溶液且普适性较差。因此,提出了一种基于IERT的非线性全光谱定量分析算法,建立适用于多组分混合溶液浓度预测模型,达到利用全光谱信息来预测浓度信息的目的。利用实验室配置的COD,BOD₅和TOC多组分混合溶液与NO₃-N、浊度、色度多组分混合溶液作为实验样本,使用光谱仪采集样本的光谱曲线,通过全光谱数据进行浓度预测实验,结果显示,对于COD,BOD₅和TOC多组分混合溶液,本算法对于三种组分的决定系数（R2）分别为0.999 3,0.991 4和0.999 3,均方根误差（RMSE）分别为0.024 4,0.057 7和0.000 4;对于NO₃-N、浊度、色度多组分混合溶液,决定系数（R2）分别为0.983 4,0.868 4和0.981 0,均方根误差（RMSE）分别为0.100 5,0.326 4和0.120 2。通过对比本算法与偏最小二乘（PLS）、支持向量机回归（SVR）、决策树（DT）、极端随机树（ERT）对于同一组数据的实验结果,表明：在两组多组分混合溶液的实验中,本算法对于其中各组分的决定系数（R2）均为最优,相比于其他对比算法均方根误差（RMSE）均有大幅减少。本算法可利用光谱信息对多组分混合溶液进行定量分析,在计算时间相当的情况下,可有效的提高浓度预测精度,减少定量分析的均方根误差,可为光谱法水质监测提供一种新的有效途径。     

Image segmentation using adaptive loopy belief propagation

Loopy belief propagation (LBP) algorithm over pairwise-connected Markov random fields (MRFs) has become widely used for low-level vision problems. However, Pairwise MRF is often insufficient to capture the statistics of natural images well, and LBP is still extremely slow for application on an MRF with large discrete label space. To solve these problems, the present study proposes a new segmentation algorithm based on adaptive LBP. The proposed algorithm utilizes local region information to construct a local region model, as well as a local interaction region MRF model for image segmentation. The adaptive LBP algorithm maximizes the global probability of the proposed MRF model, which employs two very important strategies, namely, “message self-convergence” and “adaptive label pruning”. Message self-convergence can improve the reliability of a pixel in choosing a label in local region, and label pruning can dismiss impossible labels for every pixel. Thus, the most reliable information messages transfer through the LBP algorithm. The experimental results show that the proposed algorithm not only obtains more accurate segmentation results but also greater speed.     

Erdös Rényi随机网络上爆炸渗流模型相变性质的数值模拟研究

基于改进的Newman和Ziff算法以及有限尺寸标度理论, 通过对表征渗流相变特征物理量的序参量、平均集团尺寸、二阶矩、标准偏差及尺寸不均匀性的数值模拟, 分析研究了Erdös Rényi随机网络上Achlioptas爆炸渗流模型的相变性质.研究表明: 尽管序参量表现出了不连续相变的特征, 但序参量以及其他特征物理量仍具有连续相变的幂律标度行为.因此严格地说, Erdös Rényi随机网络中的爆炸渗流相变是一种奇异相变, 它既不是标准的不连续相变, 又与常规随机渗流表现出的连续相变处于不同的普适类. 关键词： Erdös Rényi随机网络 爆炸渗流模型 相变 幂律标度行为     

Preventive maintenance for inspected systems with additive subexponential shock magnitudes

We examine the long-run average availability and cost rate of a maintained system which deteriorates according to a random-shock process. Shocks arrive according to a Poisson process. The system fails whenever the cumulative damage exceeds a given threshold. The system's failures are not self-announcing, hence, failures must be detected via inspections. The system is inspected at periodic or exponentially distributed intervals. Systems are replaced by preventive maintenance or after failure (corrective maintenance), whichever occurs first. When the distribution function of the shock magnitudes belongs to the class of subexponential distributions, we obtain simple approximations for the availability and the cost rate. Copyright © 2007 John Wiley & Sons, Ltd.     

Diffusion in flashing periodic potentials

The one-dimensional overdamped Brownian motion in a symmetric periodic potential modulated by external time-reversible noise is analyzed. The calculation of the effective diffusion coefficient is reduced to the mean first passage time problem. We derive general equations to calculate the effective diffusion coefficient of Brownian particles moving in arbitrary supersymmetric potential modulated by: (i) an external white Gaussian noise and (ii) a Markovian dichotomous noise. For both cases the exact expressions for the effective diffusion coefficient are derived. We obtain acceleration of diffusion in comparison with the free diffusion case for fast fluctuating potentials with arbitrary profile and for sawtooth potential in case (ii). In this case the parameter region where this effect can be observed is given. We obtain also a finite net diffusion in the absence of thermal noise. For rectangular potential the diffusion slows down, for all parameters of noise and of potential, in comparison with the case when particles diffuse freely.