A mixture model for random graphs

The Erdös–Rényi model of a network is simple and possesses many explicit expressions for average and asymptotic properties, but it does not fit well to real-world networks. The vertices of those networks are often structured in unknown classes (functionally related proteins or social communities) with different connectivity properties. The stochastic block structures model was proposed for this purpose in the context of social sciences, using a Bayesian approach. We consider the same model in a frequentest statistical framework. We give the degree distribution and the clustering coefficient associated with this model, a variational method to estimate its parameters and a model selection criterion to select the number of classes. This estimation procedure allows us to deal with large networks containing thousands of vertices. The method is used to uncover the modular structure of a network of enzymatic reactions.     

Further properties of a random graph with duplications and deletions

We deal with a random graph model where at each step, a vertex is chosen uniformly at random, and it is either duplicated or its edges are deleted. Duplication has a given probability. We analyze the limit distribution of the degree of a fixed vertex and derive a.s. asymptotic bounds for the maximal degree. The model shows a phase transition phenomenon with respect to the probabilities of duplication and deletion.     

On a random series in a hilbert space

Let (S_n) be partial sums of a non-degenerate sequence of Identically and independently distributed random variables taking values in a separable Hilbert space. Then for 0 ≤ β ≤ 3/2, the series converges almost nowhere. For β > 3/2 this may not be true.     

On some joint distributions in fluctuation theory

For non-negative integral valued interchangeable random variables v₁, v₂,…,v_n, Takács (1967, 70) has derived the distributions of the statistics ?_n' ?¹_n' ?^(c)_n and ?^(-c)_n concerning the partial sums N_r = v₁ + v₂ + ··· + v_rr = 1,…,n. This paper deals with the joint distributions of some other statistics viz., (α^(c)_n, δ^(c)_n, Z_n), (β^(c)_n, Z_n) and (β^(-c)_n, Z_n) concerning the partial sums N_r = ε₁ + ··· + ε_rr = 1,2,…,n, of geometric random variables ε₁, ε₂,…,ε_n.     

On Measuring Segregation in Samples With Small Units

Standard indexes of segregation measure a sample's distance from evenness, which occurs when each sample unit (e.g., an occupation) has the population share of both the minority and majority groups. We show that random allocation of individuals to units generates substantial unevenness among small units and hence that standard segregation indexes reflect random allocation as well as systematic group segregation. We then modify two popular indexes so that they measure deviations from random allocation rather than deviations from evenness. An empirical example suggests that these modified indexes provide improved measures of the systematic component of group segregation.     

On the extremal behavior of a nonstationary normal random field

Let X={_Xn}n?1$\mathbf{X}=\{X_{\mathbf{n}}{\}}_{\mathbf{n}?\mathbf{1}}$ be a nonstationary random field satisfying a long range weak dependence for each coordinate at a time and a local dependence condition that avoids clustering of exceedances of high values. For these random fields, the probability of no exceedances of high values can be approximated by exp(−τ)$\exp (-\tau )$, where τ$\tau$ is the limiting mean number of exceedances. We present a class of nonstationary normal random fields for which this result can be applied.     

On random grouping in goodness of fit tests of discrete distributions

We consider the problem of random grouping of data from discrete distributions to form χ² goodness of fit tests. In general the random partitions need not converge to the partition one gets using the true distribution function and the same partitioning scheme. We present a method of guaranteeing the convergence of the random partition and yielding the usual χ² asymptotics.     

On the asymptotic properties of parameter estimates in a regression model with non-normally distributed errors

As pointed out in a recent paper by Amirkhalkhali and Rao (1986) (henceforth referred to as A&R), the usual assumption of normality for the error terms of a regression model isoften untenable. However, when this assumption is dropped, it may be difficult to characterize parameter estimates for the model. For example, A&R (p. 189) state that “if the regression errors are non-normal, we are not even sure of their [e.g., the generalized least squares parameter estimates1] asymptotic properties.” A partial answer, however, is given by Spall and Wall (1984), which presents an asymptotic distribution theory for Kalman filter estimates for cases where the random terms of the state space model are not necessarily Gaussian. Certain of these asymptotic distribution results are also discussed in Spall (1985) in the context of model validation (diagnostic checking)     

Degree-based goodness-of-fit tests for heterogeneous random graph models: Independent and exchangeable cases

The degrees are a classical and relevant way to study the topology of a network. They can be used to assess the goodness of fit for a given random graph model. In this paper, we introduce goodness-of-fit tests for two classes of models. First, we consider the case of independent graph models such as the heterogeneous Erdös-Rényi model in which the edges have different connection probabilities. Second, we consider a generic model for exchangeable random graphs called the W-graph. The stochastic block model and the expected degree distribution model fall within this framework. We prove the asymptotic normality of the degree mean square under these independent and exchangeable models and derive formal tests. We study the power of the proposed tests and we prove the asymptotic normality under specific sparsity regimes. The tests are illustrated on real networks from social sciences and ecology, and their performances are assessed via a simulation study.     

On the Alias Method for Generating Random Variables from a Discrete Distribution

The alias method of Walker is a clever, new, fast method for generating random variables from an arbitrary, specified discrete distribution. A simple probabilistic proof is given, in terms of mixtures, that the method works for any discrete distribution with a finite number of outcomes. A more efficient version of the table-generating portion of the method is described. Finally, a brief discussion on efficiency of the method is given. We believe that the generality, speed, and simplicity of the method make it attractive for use in generating discrete random variables.     

On a robustness property of PBIBD

In this paper we study a robustness property of partially balanced incomplete block designs based on association schemes with m classes (PBIBD(m)) against the unavailability of data in the sense that, when any t (a positive integer) observations are unavailable the design remains connected w.r.t. treatment. We characterize the robustness property of PBIBD(m) completely for m=2 and partially for m=3.     

On two random search problems

The paper is concerned with static search on a finite set. An unknown subset of cardinality k of the finite set is to be found by testing its subsets. We investigate two problems: in the first, the number of common elements of the tested and the unknown subset is given; in the second, only the information whether the tested and the unknown subset are disjoint or not is given. Both problems correspond to problems on false coins. If the unknown subset is taken from the family of k-element sets with uniform distribution, we determine the minimum of the lengths of the strategies that find the unknown element with small error probability. The strategies are constructed by probabilistic means.     

Bayesian inference for stochastic multitype epidemics in structured populations via random graphs

Summary.  The paper is concerned with new methodology for statistical inference for final outcome infectious disease data using certain structured population stochastic epidemic models. A major obstacle to inference for such models is that the likelihood is both analytically and numerically intractable. The approach that is taken here is to impute missing information in the form of a random graph that describes the potential infectious contacts between individuals. This level of imputation overcomes various constraints of existing methodologies and yields more detailed information about the spread of disease. The methods are illustrated with both real and test data.     

基于加权网随机区块模型的学术热点提取算法

学术热点在把握科学前沿、掌握学术动向、制订科研规划、学术作品评审等领域中有广泛的应用。针对学术热点发现中对文献市场选择性影响体现不足和热点内容结构表现单一的问题,本文提出了以学者选读文献为基础的学术热点提取模型和算法,设计了基于加权网模块社群挖掘算法的随机区组模型两阶段算法,用于发现带结构的学术热点,模拟和实证研究均表明算法在学术热点提取中取得良好效果。     

On the distribution of a second degree polynomial statistic in singular normal var1aies

This note provides an alternative proof of a basic theorem on the distribution of a second degree polynomial statistic in noncentral singular normal variates originally proven by Rayner and Livingstone (1965)     

On future household structure

Summary.  We develop a method for computing probabilistic household forecasts which quantifies uncertainty in the future number of households of various types in a country. A probabilistic household forecast helps policy makers, planners and other forecast users in the fields of housing, energy, social security etc. in taking appropriate decisions, because some household variables are more uncertain than others. Deterministic forecasts traditionally do not quantify uncertainty. We apply the method to data from Norway. We find that predictions of future numbers of married couples, cohabiting couples and one-person households are more certain than those of lone parents and other private households. Our method builds on an existing method for computing probabilistic population forecasts, combining such a forecast with a random breakdown of the population according to household position (single, cohabiting, living with a spouse, living alone etc.). In this application, uncertainty in the total numbers of households of different types derives primarily from random shares, rather than uncertain future population size. A similar method could be applied to obtain probabilistic forecasts for other divisions of the population, such as household size, health or disability status, region of residence and labour market status.