Real networks often exhibit clustering, the tendency to form relatively small groups of nodes with high edge densities. This clustering property can cause large numbers of small and dense subgraphs to emerge in otherwise sparse networks. Subgraph counts are an important and commonly used source of information about the network structure and function. We study probability distributions of subgraph counts in a community affiliation graph. This is a random graph generated as an overlay of m partly overlapping independent Bernoulli random graphs (layers) $G_1,\dots,G_m$ with variable sizes and densities. The model is parameterised by a joint distribution of layer sizes and densities. When m grows linearly in the number of nodes n, the model generates sparse random graphs with a rich statistical structure, admitting a nonvanishing clustering coefficient and a power-law limiting degree distribution. In this paper we establish the normal and $\alpha$-stable approximations to the numbers of small cliques, cycles, and more general 2-connected subgraphs of a community affiliation graph.

This paper investigates properties of the class of graphs based on exchangeable point processes. We provide asymptotic expressions for the number of edges, number of nodes, and degree distributions, identifying four regimes: (i) a dense regime, (ii) a sparse, almost dense regime, (iii) a sparse regime with power-law behaviour, and (iv) an almost extremely sparse regime. We show that, under mild assumptions, both the global and local clustering coefficients converge to constants which may or may not be the same. We also derive a central limit theorem for subgraph counts and for the number of nodes. Finally, we propose a class of models within this framework where one can separately control the latent structure and the global sparsity/power-law properties of the graph.

A probabilistic generative network model with $n$ nodes and $m$ overlapping layers is obtained as a superposition of $m$ mutually independent Bernoulli random graphs of varying size and strength. When $n$ and $m$ are large and of the same order of magnitude, the model admits a sparse limiting regime with a tunable power-law degree distribution and nonvanishing clustering coefficient. In this article, we prove an asymptotic formula for the joint degree distribution of adjacent nodes. This yields a simple analytical formula for the model assortativity and opens up ways to analyze rank correlation coefficients suitable for random graphs with heavy-tailed degree distributions. We also study the effects of power laws on the asymptotic joint degree distributions.

This target article presents a critical survey of the scientific literature dealing with the speed/accuracy trade-offs in rapid-aimed movements. It highlights the numerous mathematical and theoretical interpretations that have been proposed in recent decades. Although the variety of points of view reflects the richness of the field and the high degree of interest that such basic phenomena attract in the understanding of human movements, it calls into question the ability of many models to explain the basic observations consistently reported in the field. This target article summarizes the kinematic theory of rapid human movements, proposed recently by R. Plamondon (1993b; 1993c; 1995a; 1995b), and analyzes its predictions in the context of speed/accuracy trade-offs. Data from human movement literature are reanalyzed and reinterpreted in the context of the new theory. It is shown that the various aspects of speed/ accuracy trade-offs can be taken into account by considering the asymptotic behavior of a large number of coupled linear systems, from which a delta-lognormal law can be derived to describe the velocity profile of an end-effector driven by a neuromuscular synergy. This law not only describes velocity profiles almost perfectly, it also predicts the kinematic properties of simple rapid movements and provides a consistent framework for the analysis of different types of speed/accuracy trade-offs using a quadratic (or power) law that emerges from the model.

Power law distributions have a certain appeal to researchers, not least because they often insinuate a general empirical law. Hence, searching for them in data generated by social and political processes has become popular. In the political science literature, however, power law behavior has rarely been assessed rigorously. Relying mainly on qualitative appraisals of log–log plots, merely a necessary, but no sufficient, condition of power law behavior is tested. This letter therefore seconds the note of caution expressed recently. Moreover, it showcases the use of a principled statistical framework to test power law behavior in a quantitative manner. Applying this method to a seminal case in political science, the results of the analysis invite an empirical as well as theoretical refinement of the claim that changes in public budgets follow a power law. In a more general sense, the letter wishes to contribute to a more thorough practice of stochastic process methods in political science.

A new network evolution model is introduced in this paper. The model is based on cooperations of N units. The units are the nodes of the network and the cooperations are indicated by directed links. At each evolution step N units cooperate, which formally means that they form a directed N-star subgraph. At each step either a new unit joins the network and it cooperates with N − 1 old units, or N old units cooperate. During the evolution both preferential attachment and uniform choice are applied. Asymptotic power law distributions are obtained both for in-degrees and for out-degrees.

The temporal dynamics of spatial heterogeneity was studied for the weed communities in a seashore paspalum turf with the use of a power-law model. Surveys were conducted in January, March, May, July, September, and November in 2007. In every survey, we set 100 quadrats (50 by 50 cm) referred to as L quadrats on a 50-m line transect at the same position in the turf. Each L quadrat was then divided into four S quadrats (25 by 25 cm) and all plant species occurring in each of these S quadrats were identified and recorded. These data were summarized into frequency distributions and the percentage of S quadrats containing a given species, and the variance of each species was estimated. The power law was used to evaluate the spatial heterogeneity (δ) and frequency of occurrence (p) for each species in the weed communities in six survey months. The results showed that weeds emerged more frequently in the summer–spring season than in winter–autumn, and the spatial heterogeneity was much higher in summer–spring than winter–autumn, especially in summer. The Shannon–Wiener diversity indexes (H') from large to small were July (5.9202) > May (5.6775) > September (5.6631) > March (5.5727) > January (5.1742) > November (4.9668). Likewise, the spatial heterogeneity index (δc ) of the whole community was also different in different months. The biggest δc (0.2790) was in July, and the smallest (0.1811) in November. Meanwhile, manilagrass had a high p (= 1.0), indicating that it occurred in all S quadrats in every weed community of every month. However, the turfgrass, seashore paspalum, only emerged in March, May, July, and November, and possessed a low p, indicating the seashore paspalum turf has been naturally replaced by manilagrass.

The importance of managing weeds in seminatural habitats that are adjacent to farm fields is unclear. Weedy-margin vegetation may harbor pests or pathogens and may ALSo serve as source populations for ongoing immigration of weeds into the field. It is ALSo possible, however, that margin vegetation provides habitat for organisms that consume weed seeds or suppress the likelihood of pest or pathogen outbreak. We examined the nature of margin habitat using spatial-scaling of Weed-Species richness as an ecological assay. In 2003, we recorded the occurrence of weedy species along the perimeters of 63 fields in Wisconsin. The fields were distributed within six counties that differed in topography, geological history, local climate, and soil type and which spanned the range of variability in the agricultural landscape. We identified seven habitats that differed in geology and land use. The relationship between species richness and margin class was estimated using an analog of the power law. Additionally, we investigated broadscale correlates of habitat heterogeneity at the field level, using a modeling strategy that included additional explanatory factors logically connected to plant diversity. Using a model-confrontation approach, the survey supported the inclusion of two topographical diversity indices, elevation gradient and a field-shape index, into our model. Our broadscale survey provides information on one of a suite of important considerations needed to make decisions about the importance of managing weeds in field margins.

In the fields of engineering, nanoscience, and biomechanics, thin structural members, such as beams, plates, and shells, that are supported by an elastic medium are used in several applications. There is a possibility that these thin structures might buckle under severe loading conditions; higher-order, complicated elastic buckling modes can be found owing to the balance of rigidities between the thin members and elastic supports. In this study, we have shown a new and simple ‘power law’ relation between the critical buckling strain (or loads) and rigidity parameters in structural members supported by an elastic medium, which can be modelled as a Winkler foundation. The following structural members have been considered in this paper: i) a slender beam held by an outer elastic support under axial loading, ii) cylindrical shells supported by an inner elastic core under hydrostatic pressure (plane strain condition), and iii) complete spherical shells that are filled with an inner elastic medium.

The cross-sectional distribution of consumption is commonly approximated by the lognormal distribution. This note shows that consumption is better described by the double Pareto-lognormal distribution (dPlN), which has a lognormal body with two Pareto tails and arises as the stationary distribution in recently proposed dynamic general equilibrium models. dPlN outperforms other parametric distributions and is often not rejected by goodness-of-fit tests. The analytical tractability and parsimony of dPlN may be convenient for various economic applications.

Retransmission-based failure recovery represents a primary approach in existing communication networks that guarantees data delivery in the presence of channel failures. Recent work has shown that, when data sizes have infinite support, retransmissions can cause long (-tailed) delays even if all traffic and network characteristics are light-tailed. In this paper we investigate the practically important case of bounded data units 0 ≤ Lb ≤ b under the condition that the hazard functions of the distributions of data sizes and channel statistics are proportional. To this end, we provide an explicit and uniform characterization of the entire body of the retransmission distribution ℙ[Nb > n] in both n and b. Our main discovery is that this distribution can be represented as the product of a power law and gamma distribution. This rigorous approximation clearly demonstrates the coupling of a power law distribution, dominating the main body, and the gamma distribution, determining the exponential tail. Our results are validated via simulation experiments and can be useful for designing retransmission-based systems with the required performance characteristics. From a broader perspective, this study applies to any other system, e.g. computing, where restart mechanisms are employed after a job processing failure.

We consider possibly nonlinear distributional fixed-point equations on weighted branching trees, which include the well-known linear branching recursion. In Jelenković and Olvera-Cravioto (2012), an implicit renewal theorem was developed that enables the characterization of the power-tail asymptotics of the solutions to many equations that fall into this category. In this paper we complement the analysis in our 2012 paper to provide the corresponding rate of convergence.

For a family of linear preferential attachment graphs, we provide rates of convergence for the total variation distance between the degree of a randomly chosen vertex and an appropriate power law distribution as the number of vertices tends to ∞. Our proof uses a new formulation of Stein's method for the negative binomial distribution, which stems from a distributional transformation that has the negative binomial distributions as the only fixed points.

Consider a generic data unit of random size L that needs to be transmitted over a channel of unit capacity. The channel availability dynamic is modeled as an independent and identically distributed sequence {A, Ai}i≥1 that is independent of L. During each period of time that the channel becomes available, say Ai, we attempt to transmit the data unit. If L <Ai, the transmission is considered successful; otherwise, we wait for the next available period Ai+1 and attempt to retransmit the data from the beginning. We investigate the asymptotic properties of the number of retransmissions N and the total transmission time T until the data is successfully transmitted. In the context of studying the completion times in systems with failures where jobs restart from the beginning, it was first recognized by Fiorini, Sheahan and Lipsky (2005) and Sheahan, Lipsky, Fiorini and Asmussen (2006) that this model results in power-law and, in general, heavy-tailed delays. The main objective of this paper is to uncover the detailed structure of this class of heavy-tailed distributions induced by retransmissions. More precisely, we study how the functional relationship ℙ[L>x]-1 ≈ Φ (ℙ[A>x]-1) impacts the distributions of N and T; the approximation ‘≈’ will be appropriately defined in the paper based on the context. Depending on the growth rate of Φ(·), we discover several criticality points that separate classes of different functional behaviors of the distribution of N. For example, we show that if log(Φ(n)) is slowly varying then log(1/ℙ[N>n]) is essentially slowly varying as well. Interestingly, if log(Φ(n)) grows slower than e√(logn) then we have the asymptotic equivalence log(ℙ[N>n]) ≈ - log(Φ(n)). However, if log(Φ(n)) grows faster than e√(logn), this asymptotic equivalence does not hold and admits a different functional form. Similarly, different types of distributional behavior are shown for moderately heavy tails (Weibull distributions) where log(ℙ[N>n]) ≈ -(log Φ(n))1/(β+1), assuming that log Φ(n) ≈ nβ, as well as the nearly exponential ones of the form log(ℙ[N>n]) ≈ -n/(log n)1/γ, γ>0, when Φ(·) grows faster than two exponential scales log log (Φ(n)) ≈ nγ.

In this paper we quantify the efficiency of parallelism in systems that are prone to failures and exhibit power law processing delays. We characterize the performance of two prototype schemes of parallelism, redundant and split, in terms of both the power law exponent and exact asymptotics of the delay distribution tail. We also develop the optimal splitting scheme which ensures that split always outperforms redundant.