几何随机图大连通分支覆盖面积及其在传感器网络中的应用

随机网络中的大连通分支能体现一个网络的连通情况,是几何随机图研究的-个热点,具有重要的理论意义和应用价值.本文利用渗流理论,研究了几何随机图大连通分支覆盖面积所具有的性质,并将理论结果应用到大型无线传感器网络中,研究了无线传感器网络覆盖的性质.研究结果表明,对于节点服从泊松分布的大型无线传感器网络,其大连通分支覆盖区域大小与总区域大小的比值趋于-个常数,且并估计出了2维空间中没有被大连通分支所覆盖的连通区域(本文称为空洞)的大小.这些结果为衡量无线传感器网络性能提供了理论基础,对实际布网和网络优化等具有一定的指导意义.     

Limit laws in the generalized random graphs with random vertex weights

In this note we investigate the number of edges and the vertex degree in the generalized random graphs with vertex weights, which are independent and identically distributed random variables.     

On properties of geometric random problems in the plane

In this paper, we present results dealing with properties of well-known geometric random problems in the plane, together with their motivations. The paper specifically concentrates on the traveling salesman and minimum spanning tree problems, even though most of the results apply to other problems such as the Steiner tree problem and the minimum weight matching problem.     

Small subgraphs in random graphs and the power of multiple choices

The standard paradigm for online power of two choices problems in random graphs is the Achlioptas process. Here we consider the following natural generalization: Starting with G₀ as the empty graph on n vertices, in every step a set of r edges is drawn uniformly at random from all edges that have not been drawn in previous steps. From these, one edge has to be selected, and the remaining r−1 edges are discarded. Thus after N steps, we have seen rN edges, and selected exactly N out of these to create a graph GN.In a recent paper by Krivelevich, Loh, and Sudakov (2009) [11], the problem of avoiding a copy of some fixed graph F in GN for as long as possible is considered, and a threshold result is derived for some special cases. Moreover, the authors conjecture a general threshold formula for arbitrary graphs F. In this work we disprove this conjecture and give the complete solution of the problem by deriving explicit threshold functions N₀(F,r,n) for arbitrary graphs F and any fixed integer r. That is, we propose an edge selection strategy that a.a.s. (asymptotically almost surely, i.e. with probability 1−o(1) as n→∞) avoids creating a copy of F for as long as N=o(N₀), and prove that any online strategy will a.a.s. create such a copy once N=ω(N₀).     

Asymptotic theory for the principal component analysis of a vector random function: Some applications to statistical inference

From the results of convergence by sampling in linear principal component analysis (of a random function in a separable Hilbert space), the limiting distribution is given for the principal values and the principal factors. These results can be explicitly written in the normal case. Some applications to statistical inference are investigated.     

Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph

We consider four conjectures related to the largest eigenvalue of (the adjacency matrix of) a graph (i.e., to the index of the graph). Three of them have been formulated after some experiments with the programming system AutoGraphiX, designed for finding extremal graphs with respect to given properties by the use of variable neighborhood search. The conjectures are related to the maximal value of the irregularity and spectral spread in n-vertex graphs, to a Nordhaus–Gaddum type upper bound for the index, and to the maximal value of the index for graphs with given numbers of vertices and edges. None of the conjectures has been resolved so far. We present partial results and provide some indications that the conjectures are very hard.     

Some properties for a class of interchange graphs

The Wiener number is the sum of distances between all pairs of vertices of a connected graph. In this paper, we give an explicit algebraic formula for the Wiener number of a class of interchange graphs. Moreover, distance-related properties and cliques of this class of interchange graphs are investigated.     

Uniform existence of the integrated density of states for random Schrödinger operators on metric graphs over

We consider ergodic random Schrödinger operators on the metric graph with random potentials and random boundary conditions taking values in a finite set. We show that normalized finite volume eigenvalue counting functions converge to a limit uniformly in the energy variable. This limit, the integrated density of states, can be expressed by a closed Shubin–Pastur type trace formula. It supports the spectrum and its points of discontinuity are characterized by existence of compactly supported eigenfunctions. Among other examples we discuss random magnetic fields and percolation models.     

Asymptotic distribution of the LR statistic for equality of the smallest eigenvalues in high-dimensional principal component analysis

This paper deals with the distribution of the LR statistic for testing the hypothesis that the smallest eigenvalues of a covariance matrix are equal. We derive an asymptotic null distribution of the LR statistic when the dimension p and the sample size N approach infinity, while the ratio p/N converging on a finite nonzero limit c(0,1). Numerical simulations revealed that our approximation is more accurate than the classical chi-square-type approximation as p increases in value.     

Some decomposition method for analytic solving of certain nonlinear partial differential equations in physics with applications

Certain nonlinear partial differential equations (NPDEs) can be decomposed into several more simple equations, which can possess enough general analytic solutions. This approach and some interesting kinds of solutions (obtained by using this method) of some NPDEs in physics will be presented. The presented approach is somewhat similar to the homogeneous balance method, however they are different.     

Convergence in the r－th Mean and Some Weak laws of Large Numbers for Random Weighted Sums of Random Elements in Banach Spaces

Ｃｏｎｖｅｒｇｅｎｃｅｉｎｔｈｅｒ－ｔｈＭｅａｎａｎｄＳｏｍｅＷｅａｋｌａｗｓｏｆＬａｒｇｅＮｕｍｂｅｒｓｆｏｒＲａｎｄｏｍＷｅｉｇｈｔｅｄＳｕｍｓｏｆＲａｎｄｏｍＥｌｅｍｅｎｔｓｉｎＢａｎａｃｈＳｐａｃｅｓＷａｎｇＸｉａｎｓｃｈｅｎ（王向忱）（Ｄｅ...     

每个忙期中第一个顾客被拒绝服务的M／M／1排队模型的另一个特征值

研究每个忙期中第一个顾客被拒绝服务的M／M／1排队模型主算子在左半复平面中的特征值,证明2√λμ-λ-μ是该主算子的几何重数为1的特征值。     

每个忙期中第一个顾客被拒绝服务的M／M/1排队模型的其他特征值

研究每个忙期中第一个顾客被拒绝服务的M／M／1排队模型的主算子在左半复平面中的特征值,证明对一切θ∈（0,1）,（2√λμ-λ—μ）θ是该主算子的几何重数为1的特征值．     

A regularity result for a minimum problem in orlicz-sobolev spaces with applications in the study of the dirichlet problem for the operator of hencky-nadai theory

The existence and uniqueness of the solution to the problem of minimum for functionals generated by N- functions are obtained in Orlicz-Sobolev spaces. Applications for some functionals dealing with Hencky theory are given.