The Limit Theorems for Transportation Networks

2000 Mathematics Subject Classi cation: 60K25 (primary); 60F05, 37A50 (secondary)

Limit Theorems for Maxima of Heavy-Tailed Terms with Random Dependent Weights

2000 Mathematics Subject Classification: Primary 60F17, 60G52, 60G70 secondary 60E07, 62E20.

Limit Theorems for Non-Critical Branching Processes with Continuous State Space

2000 Mathematics Subject Classification: Primary 60J80, Secondary 60G99.

Topological properties of the one dimensional exponential random geometric graph

In this article we study the one-dimensional random geometric (random interval) graph when the location of the nodes are independent and exponentially distributed. We derive exact results and limit theorems for the connectivity and other properties associated with this random graph. We show that the asymptotic properties of a graph with a truncated exponential distribution can be obtained using the exponential random geometric graph. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008.

Performance analysis of a slotted-ALOHA protocol on a capture channel with fading

We consider the slotted ALOHA protocol on a channel with a capture effect. There are M limit theorems. Our arrival streams contain all the traffic models suggested in the recent literature, including the ones which display long range dependence. We also obtain bounds on the stationary moments of waiting times which can be tight under realistic conditions. Finally, we obtain several results on the transient performance of the system, e.g., first time to overflow and the limits of the overflow process. We also extend the above results to the case of a capture channel exhibiting Markov modulated fading. Most of our results and proofs will be shown to hold also for the slotted ALOHA protocol without capture.

A backward particle interpretation of Feynman-Kac formulae

We design a particle interpretation of Feynman-Kac measures on path spaces based on a backward Markovian representation combined with a traditional mean field particle interpretation of the flow of their final time marginals. In contrast to traditional genealogical tree based models, these new particle algorithms can be used to compute normalized additive functionals "on-the-fly" as well as their limiting occupation measures with a given precision degree that does not depend on the final time horizon. We provide uniform convergence results with respect to the time horizon parameter as well as functional central limit theorems and exponential concentration estimates. Our results have important consequences for online parameter estimation for non-linear non-Gaussian state-space models. We show how the forward filtering backward smoothing estimates of additive functionals can be computed using a forward only recursion.

Trench stability under bentonite pressure in purely cohesive clay

Trench stability is a conventional geotechnical problem; however, current evaluations are often based entirely on empiricism. This paper uses numerical finite-element upper and lower bound limit analysis to produce stability charts for two-dimensional and three-dimensional homogeneous and inhomogeneous undrained diaphragm wall trenches. Using the limit theorems cannot only provide a simple and useful way of analyzing the stability of the trench, but also avoid the shortcomings and arbitrary assumptions underpinning the limit equilibrium method. By considering the effects from the bentonite slurry pressures, the collapse load in this study has been bracketed to within ±8.5 or better by the numerical upper and lower bound limit analyses. The chart solutions can be used to predict either the critical depth or the safety factor of the trench and provide a convenient tool for preliminary designs by practicing engineers. © 2014 American Society of Civil Engineers.

On scale-mixture Birnbaum-Saunders distributions

We present for the first time a justification on the basis of central limit theorems for the family of life distributions generated from scale-mixture of normals. This family was proposed by Balakrishnan et al. (2009) and can be used to accommodate unexpected observations for the usual Birnbaum-Saunders distribution generated from the normal one. The class of scale-mixture of normals includes normal, slash, Student-t, logistic, double-exponential, exponential power and many other distributions. We present a model for the crack extensions where the limiting distribution of total crack extensions is in the class of scale-mixture of normals. (C) 2012 Elsevier B.V. All rights reserved.

Randomness and degrees of irregularity.

The fundamental question "Are sequential data random?" arises in myriad contexts, often with severe data length constraints. Furthermore, there is frequently a critical need to delineate nonrandom sequences in terms of closeness to randomness--e.g., to evaluate the efficacy of therapy in medicine. We address both these issues from a computable framework via a quantification of regularity. ApEn (approximate entropy), defining maximal randomness for sequences of arbitrary length, indicating the applicability to sequences as short as N = 5 points. An infinite sequence formulation of randomness is introduced that retains the operational (and computable) features of the finite case. In the infinite sequence setting, we indicate how the "foundational" definition of independence in probability theory, and the definition of normality in number theory, reduce to limit theorems without rates of convergence, from which we utilize ApEn to address rates of convergence (of a deficit from maximal randomness), refining the aforementioned concepts in a computationally essential manner. Representative applications among many are indicated to assess (i) random number generation output; (ii) well-shuffled arrangements; and (iii) (the quality of) bootstrap replicates.

Subcritical Randomly Indexed Branching Processes

2000 Mathematics Subject Classification: 60J80, 62P05.

Lp Microlocal Supercritical Markov Branching Processes with Non-Homogeneous Poisson Immigration

2010 Mathematics Subject Classification: 60J80.

Relationship between Extremal and Sum Processes Generated by the same Point Process

2000 Mathematics Subject Classification: Primary 60G51, secondary 60G70, 60F17.

O paradoxo da superdifusão de uma caminhada aleatória com memória exponencial

The random walk models with temporal correlation (i.e. memory) are of interest in the study of anomalous diffusion phenomena. The random walk and its generalizations are of prominent place in the characterization of various physical, chemical and biological phenomena. The temporal correlation is an essential feature in anomalous diffusion models. These temporal long-range correlation models can be called non-Markovian models, otherwise, the short-range time correlation counterparts are Markovian ones. Within this context, we reviewed the existing models with temporal correlation, i.e. entire memory, the elephant walk model, or partial memory, alzheimer walk model and walk model with a gaussian memory with profile. It is noticed that these models shows superdiffusion with a Hurst exponent H > 1/2. We study in this work a superdiffusive random walk model with exponentially decaying memory. This seems to be a self-contradictory statement, since it is well known that random walks with exponentially decaying temporal correlations can be approximated arbitrarily well by Markov processes and that central limit theorems prohibit superdiffusion for Markovian walks with finite variance of step sizes. The solution to the apparent paradox is that the model is genuinely non-Markovian, due to a time-dependent decay constant associated with the exponential behavior. In the end, we discuss ideas for future investigations.

Threshold behaviour and final outcome of an epidemic on a random network with household structure

This paper considers a stochastic SIR (susceptible-infective-removed) epidemic model in which individuals may make infectious contacts in two ways, both within 'households' (which for ease of exposition are assumed to have equal size) and along the edges of a random graph describing additional social contacts. Heuristically-motivated branching process approximations are described, which lead to a threshold parameter for the model and methods for calculating the probability of a major outbreak, given few initial infectives, and the expected proportion of the population who are ultimately infected by such a major outbreak. These approximate results are shown to be exact as the number of households tends to infinity by proving associated limit theorems. Moreover, simulation studies indicate that these asymptotic results provide good approximations for modestly-sized finite populations. The extension to unequal sized households is discussed briefly.