Jean-Michel Billiot, Jean-François Coeurjolly and Rémy Drouilhet

Size: px
Start display at page:

Download "Jean-Michel Billiot, Jean-François Coeurjolly and Rémy Drouilhet"

Transcription

1 Colloque International de Statistique Appliquée pour le Développement en Afrique International Conference on Applied Statistics for Development in Africa Sada 07 nn, 1?? 007) MAXIMUM PSEUDO-LIKELIHOOD ESTIMATOR FOR GIBBS POINT PROCESSES Jean-Michel Billiot, Jean-François Coeurjolly and Rémy Drouilhet Abstract. The purpose of this paper is a statistical study of spatial Gibbs point processes. Our framework is general so that it includes a large variety of classical models and some new models based on a nearest-neighbor -type of interaction. We present some method based on the maximization of the pseudo-likelood to estimate some vector θ parametrizing point processes. Finally, we give general conditions under which the consistency and the asymptotic normality hold for such estimates. Keywords: Gibbs point processes, nearest-neighbour Gibbs point processes, pseudo-likelihood 1. Introduction Spatial point pattern data occur frequently in a wide variety of scientific disciplines, including seismology, ecology, forestry, agriculture, geography, spatial epidemiology see for example the classical references [?] or [?] and the references therein. Let us cite a classical example in the domain of forestry: the japanese pines data set e.g. [?]) plotted in Fig.??. The data give the locations of Japanese black pine saplings in a square sampling region in a natural forest. The trees seem not to be uniformly distributed that is that is not the realization of a Poisson process. They preferably seem to aggregate, which could exhibit some special behaviour to environmental conditions or simply competition between trees. A problem that has interested a lot of searchers consisted then in modelling this point process and in estimating the associated parameters in order to attempt to interpret the interaction between points here trees). Figure 1: Japanese Pines data set: the data give the locations of Japanese black pine saplings in a square sampling region in a natural forest. In a general context, the data consist in a spatial point pattern ϕ observed in a bounded region Λ of space R for the sake of simplicity). Thus, ϕ = {x 1,..., x n } where the number of points n 0 is not fixed and each x i is a point in Λ. The data are assumed to be a realization of a point process Φ in R. The typical model is the Poisson process. The class of Gibbs processes is the class for which the probability density function conditionnally on some fixed outside configuration ϕ o with respect to the Poisson process can be written:

2 Jean-Michel Billiot, Jean-François Coeurjolly and Rémy Drouilhet f Φ Λ c =ϕo Λ c Φ Λ ϕ Λ ) exp V ϕ Λ ϕ o Λ c)), where V ϕ Λ ϕ o Λc) measures the energy to insert the configuration ϕ Λ into ϕ o Λ c. We only consider in this paper non-marked point processes but extensions can be obtained with little work. Extensions could also be done by integrating spatial covariates..1. Framework. Description of some Gibbs models The framework of this paper is restricted to stationary Gibbs point processes based on energy function invariant by translation, V ϕ; θ), parametrized by some θ Θ, where Θ is some compact set of R p+1. In its general form, the model is described as V ϕ; θ) = θ 1 ϕ + V ϕ; θ ), 1) with θ = θ 1, θ ). The exponential case is a particular form of??) given by V ϕ; θ) = θ T vϕ), V ϕ; θ ) = θ T v ϕ), ) where vϕ) = v 1 ϕ),..., v p+1 ϕ)) = ϕ, v ϕ)) is the vector of sufficient statistics. We developped the method and obtained asymptotic results for the general form??) but for the sake of simplicity and the clearness of the presentation, we only pay attention on energy function of the form??), see [?] for more details. With such a framework, the local energy, that is the energy required to insert a point x into the configuration ϕ is then expressed as V x ϕ; θ) = θ T v x ϕ) where v x ϕ) = v 1 x ϕ),..., v p+1 x ϕ)) = 1, v x ϕ)) := vϕ {x}) vϕ). The main goal is to obtain some asymptotic results for estimates of θ as the domain grows. Hence the point process has to be defined in R. In [?] are given some sufficient conditions to ensure the existence of an ergodic measure of such a point process: [E1] Locality of the local energy: there exists some fixed range denoted by D such that for any ϕ Ω one has V 0 ϕ; θ) = V 0 ϕ B0, D); θ). [E] Stability of the local energy: there exists K 0 such that for any ϕ Ω: V 0 ϕ; θ) K. Again, this framework may be extended, see [?]... Various examples Classical pairwise interaction point processes e.g. [?]): Poisson process: V ϕ; θ) = θ 1 ϕ. Strauss process: V ϕ; θ) = θ 1 ϕ + θ s [0,D] ϕ) with θ > 0 or with hard-core condition), where s [0,D] ϕ) is the number of [0, D] close pair of points in ϕ that is 1 ξ D). ξ P ϕ)

3 Maximum pseudo-likelihood estimator for Gibbs point processes 3 Multi-type Strauss process: V ϕ; θ) = θ 1 ϕ + p+1 i= θ is [Di 1,D i]ϕ) with θ,..., θ p+1 > 0 or with hard-core condition) where D 0 = 0 < D 1 <... < D p+1 are fixed real numbers. Soft core process: V ϕ; θ) = θ 1 ϕ + θ /k ξ P ϕ) ξ /k 1 ξ D). Overlap are process: V ϕ; θ) = θ 1 ϕ + θ ξ P g ϕ) ξ )1 ξ D) with θ > D 0 and g d) = Arcosd/D) d/ D d ). Nearest-neighbour pairwise interaction point processes: the idea is to replace the classical neighborhood relation that is the one based on the complete graph P ϕ)) by a more structured one. Let us cite for example a Nearest-neighbour Multi-type Strauss process: V ϕ; θ) = θ 1 ϕ + p+1 i= θ is [Di 1,D i]ϕ) where s [Di 1,D i]ϕ) is the number of edges of some graph G ϕ) with length comprised between D i 1 and D i. The existence has been proved for example) when e.g. [?]) G ϕ) corresponds to the set of edges of the slightly modified Delaunay triangulation. G ϕ) corresponds to the set of edges of the first-nearest neighbour graph or more generally the k-nearest-neighbour graph k 1). Other point processes e.g. [?]): Extension to interaction on triangles - Geyer s triplet process: V ϕ; θ) = θ 1 ϕ + θ s [0,D] ϕ) + θ 3 t [0,D] ϕ) θ, θ 3 > 0 or θ < 0 and θ 3 > 0) where t [0,D] ϕ) is the number of triangles of ϕ with lengths edges lower than D, that is t [0,D] ϕ) = ξ P 3ϕ) η P ξ) 1 η D). Widow-Rowlinson Area interaction point process): V ϕ; θ) = θ 1 ϕ +θ U ϕ,d where U ϕ,d is the area of the union of discs of radius D centred at the points. Example of Ord s model: V ϕ; θ) = θ 1 ϕ + θ Aϕ) with 0 < D < + ) where Aϕ) = x ϕ 1 V or Dx ϕ) A 0 ), V or D x ϕ) = V orx ϕ) Bx, D) and V orx ϕ) is the Voronoï region associated with x and the set of points ϕ. This model can be viewed as a Strauss type model on the are of voronoï cells Pseudo-likelihood 3. MPLE: presentation and main results The idea of maximum pseudo-likelihood is due to [?] who first introduced the concept for Markov random fields in order to avoid the normalizing constant appearing if one uses the maximum likelihood method. This work was then widely extended and [?] Theorem.) obtained a general expression for Gibbs point processes. With our notation and up to a scalar factor the pseudo-likelihood defined for a configuration ϕ and a domain of observation Λ is denoted by P L Λ ϕ; θ) and given by P L Λ ϕ; θ) = exp exp θ T v x ϕ) ) ) dx exp θ T v x ϕ \ x) ). 3) Λ x ϕ Λ

4 4 Jean-Michel Billiot, Jean-François Coeurjolly and Rémy Drouilhet It is more convenient to define and work with) the log-pseudo-likelihood function, denoted by LP L Λ ϕ; θ). LP L Λ ϕ; θ) = exp θ T v x ϕ) ) dx θ T v x ϕ \ x) 4) Λ x ϕ Λ Our data consist in the realization of a point process with energy function V ; θ ) in a domain Λ R satisfying the existence conditions [E1] and [E]. Thus, θ is the true parameter to be estimated. The Gibbs measure will be denoted by P θ. Moreover the point process is assumed to be observed in a domain Λ n D = x Λn Bx, D), where Λ n R can de decomposed into i In i where for i = i 1, i ) { i = z R, D i j 1 ) z j D i j 1 ) }, j = 1, for some D > 0. As n +, we also assume that Λ n R such that Λ n + and Λ n 0. Finally, we denote by Λ n θ n ϕ) the maximum pseudo-likelihood estimate based on the configuration ϕ, defined as θ n ϕ) = argmax θ Θ LP L Λn ϕ; θ). 3.. Asymptotic results of the MPLE The following results generalize the ones obtained by [?] and [?]. Indeed, [?] prove the consistency of the MPLE for the exponential case of marked) pairwise interaction point processes. And [?] prove the asymptotic normality of MPLE for pairwise interaction point processes with two parameters. [C1] There exists κ, R some positive real numbers and some integer k, such that for all i = 1,..., p + 1 v i 0 ϕ) κ ϕ B0,R) k [C] Identifiability condition : there exists A 1,..., A p+1, p+1 disjoint events of Ω such that P θ A i ) > 0 and such that for all ϕ 1,..., ϕ p+1 A 1 A p+1 the p+1) p+1) matrix with entries v j 0 ϕ i ) is constant and invertible. [C3] The matrix Σ D, θ ) = D i [ D f D ]+1 E θ LPL 1) 0 Φ; θ ) LPL 1) i Φ; θ ) T ) 5) is symmetric and definite positive. The vector LPL 1) i ϕ; θ) denotes the first order derivative vector of the log-pseudo-likelihood function on the domain i. Theorem 1. Under Assumptions [C1] and [C], for P θ almost every ϕ, the maximum pseudo-likelihood estimate θ n ϕ) converges towards θ as n tends to infinity.

5 Maximum pseudo-likelihood estimator for Gibbs point processes 5 Define for θ Θ, U ) θ) = E Pθ )) v j 0 Φ)v k 0 Φ) exp θ T v 0 Φ). Theorem. Under Assumptions [C1] and [C], we have, for any fixed D, the following convergence in distribution as n + Λ n 1/ U ) θ ) θn θ ) N 0, Σ D, ) θ ), 6) In addition under Assumption [C3] Λ n 1/ Σn D, θ n ) 1/ U n ) θ n ) θn θ ) N 0, I p+1 ), 7) where for some θ and some finite configuration ϕ, the matrices Σ n D, θ) and U n ) θ) are respectively defined by Σ n D, θ) = Λ n 1 D LPL 1) i ϕ; θ) LPL 1) j ϕ; θ) T i In j i [ D D f]+1,j I n and for all j, k = 1,..., p + 1 ) U ) n θ) = 1 j,k Λ n Λ n v j 0 Φ)v k 0 Φ) exp ) θ T v 0 Φ) dx Both results can be proved using a central limit theorem obtained by [?] and results concerning minimum contrast estimators obtained by [?]. Assumptions [C1] and [C] are satisfied for all the examples presented. Assumption [C3] needs more attention but is satisfied for various models, see [?]. Acknowledgements This work was support by a grant from IMAG Project AlpB. References [1] BADDELEY, A.J., AND TURNER, J.. spatstat: An R Package for Analyzing Spatial Point Patterns. J. Stat. Soft., 16) 005), 1 4. [] BERTIN, E., BILLIOT, J.-M., AND DROUILHET, R. Existence of "Nearest-Neighbour" Gibbs Point Models. Adv. Appl. Prob., ), [3] BILLIOT, J.-M., COEURJOLLY, J.-F., AND DROUILHET, R. Maximum pseudolikelihood estimator for nearest-neighbours Gibbs point processes E-print arxiv http ://fr.arxiv.org/abs/math.st/ ), 1 9. [4] BESAG, J. Statistical analysis of non-lattice data. The statistician, ), [5] GUYON, X. Champs aléatoires sur un réseau, Masson, Paris, 199.

6 6 Jean-Michel Billiot, Jean-François Coeurjolly and Rémy Drouilhet [6] JENSEN, J.L., AND KUNSCH, H.R. On asymptotic normality of pseudolikelihood estimates of pairwise interaction processes.ann. Inst. Statist. Math., ), [7] JENSEN, J.L., AND MØLLER, J. Pseudolikelihood for exponential family models of spatial point processes. Ann. Appl. Probab., ), [8] MØLLER, J., AND WAGGEPETERSEN R. Statistical Inference and Simulation for Spatial Point Processes, Chapman and Hall/CRC, Boca Raton, 003. [9] STOYAN, D., KENDALL W.S., AND MECKE, J. Stochastic Geometry and its Applications, Wiley, Chichester, second edition, Jean-Michel Billiot, Jean-François Coeurjolly and Rémy Drouilhet SAGAG Team, Department of Statistics, University of Grenoble 151 Av. Centrale BP GRENOBLE CEDEX 9 Jean-Michel.Billiot@upmf-grenoble.fr, Jean-Francois.Coeurjolly@upmf-grenoble.fr and Remy.Drouilhet@upmf-grenoble.fr

Gibbs Voronoi tessellations: Modeling, Simulation, Estimation.

Gibbs Voronoi tessellations: Modeling, Simulation, Estimation. Gibbs Voronoi tessellations: Modeling, Simulation, Estimation. Frédéric Lavancier, Laboratoire Jean Leray, Nantes (France) Work with D. Dereudre (LAMAV, Valenciennes, France). SPA, Berlin, July 27-31,

More information

Gibbs point processes : modelling and inference

Gibbs point processes : modelling and inference Gibbs point processes : modelling and inference J.-F. Coeurjolly (Grenoble University) et J.-M Billiot, D. Dereudre, R. Drouilhet, F. Lavancier 03/09/2010 J.-F. Coeurjolly () Gibbs models 03/09/2010 1

More information

arxiv:math/ v1 [math.st] 4 Jan 2006

arxiv:math/ v1 [math.st] 4 Jan 2006 arxiv:math/060065v [math.st] 4 Jan 2006 Maximum pseudo-likelihood estimator for nearest-neighbours Gibbs point processes By Jean-Michel Billiot, Jean-François Coeurjolly,2 and Rémy Drouilhet Labsad, University

More information

Topics in Stochastic Geometry. Lecture 4 The Boolean model

Topics in Stochastic Geometry. Lecture 4 The Boolean model Institut für Stochastik Karlsruher Institut für Technologie Topics in Stochastic Geometry Lecture 4 The Boolean model Lectures presented at the Department of Mathematical Sciences University of Bath May

More information

Spatial point processes

Spatial point processes Mathematical sciences Chalmers University of Technology and University of Gothenburg Gothenburg, Sweden June 25, 2014 Definition A point process N is a stochastic mechanism or rule to produce point patterns

More information

Gibbs point processes with geometrical interactions. Models for strongly structured patterns

Gibbs point processes with geometrical interactions. Models for strongly structured patterns Gibbs point processes with geometrical interactions. Models for strongly structured patterns David Dereudre, Laboratoire Paul Painlevé, Lille (joint work with R. Drouilhet and H.-O. Georgii) 8th September

More information

Bootstrap Approximation of Gibbs Measure for Finite-Range Potential in Image Analysis

Bootstrap Approximation of Gibbs Measure for Finite-Range Potential in Image Analysis Bootstrap Approximation of Gibbs Measure for Finite-Range Potential in Image Analysis Abdeslam EL MOUDDEN Business and Management School Ibn Tofaïl University Kenitra, Morocco Abstract This paper presents

More information

Takacs Fiksel Method for Stationary Marked Gibbs Point Processes

Takacs Fiksel Method for Stationary Marked Gibbs Point Processes Scandinavian Journal of Statistics doi: 10.1111/j.1467-9469.2011.00738.x Published by Blackwell Publishing Ltd. Takacs Fiksel Method for Stationary Marked Gibbs Point Processes JEAN-FRANÇOIS COEURJOLLY

More information

An introduction to spatial point processes

An introduction to spatial point processes An introduction to spatial point processes Jean-François Coeurjolly 1 Examples of spatial data 2 Intensities and Poisson p.p. 3 Summary statistics 4 Models for point processes A very very brief introduction...

More information

Residuals and Goodness-of-fit tests for marked Gibbs point processes

Residuals and Goodness-of-fit tests for marked Gibbs point processes Residuals and Goodness-of-fit tests for marked Gibbs point processes Frédéric Lavancier (Laboratoire Jean Leray, Nantes, France) Joint work with J.-F. Coeurjolly (Grenoble, France) 09/06/2010 F. Lavancier

More information

Statistical study of spatial dependences in long memory random fields on a lattice, point processes and random geometry.

Statistical study of spatial dependences in long memory random fields on a lattice, point processes and random geometry. Statistical study of spatial dependences in long memory random fields on a lattice, point processes and random geometry. Frédéric Lavancier, Laboratoire de Mathématiques Jean Leray, Nantes 9 décembre 2011.

More information

Chapter 2. Poisson point processes

Chapter 2. Poisson point processes Chapter 2. Poisson point processes Jean-François Coeurjolly http://www-ljk.imag.fr/membres/jean-francois.coeurjolly/ Laboratoire Jean Kuntzmann (LJK), Grenoble University Setting for this chapter To ease

More information

Poisson line processes. C. Lantuéjoul MinesParisTech

Poisson line processes. C. Lantuéjoul MinesParisTech Poisson line processes C. Lantuéjoul MinesParisTech christian.lantuejoul@mines-paristech.fr Bertrand paradox A problem of geometrical probability A line is thrown at random on a circle. What is the probability

More information

Lecture 2: Poisson point processes: properties and statistical inference

Lecture 2: Poisson point processes: properties and statistical inference Lecture 2: Poisson point processes: properties and statistical inference Jean-François Coeurjolly http://www-ljk.imag.fr/membres/jean-francois.coeurjolly/ 1 / 20 Definition, properties and simulation Statistical

More information

Random graphs: Random geometric graphs

Random graphs: Random geometric graphs Random graphs: Random geometric graphs Mathew Penrose (University of Bath) Oberwolfach workshop Stochastic analysis for Poisson point processes February 2013 athew Penrose (Bath), Oberwolfach February

More information

Statistics 222, Spatial Statistics. Outline for the day: 1. Problems and code from last lecture. 2. Likelihood. 3. MLE. 4. Simulation.

Statistics 222, Spatial Statistics. Outline for the day: 1. Problems and code from last lecture. 2. Likelihood. 3. MLE. 4. Simulation. Statistics 222, Spatial Statistics. Outline for the day: 1. Problems and code from last lecture. 2. Likelihood. 3. MLE. 4. Simulation. 1. Questions and code from last time. The difference between ETAS

More information

Asymptotic properties of the maximum likelihood estimator for a ballistic random walk in a random environment

Asymptotic properties of the maximum likelihood estimator for a ballistic random walk in a random environment Asymptotic properties of the maximum likelihood estimator for a ballistic random walk in a random environment Catherine Matias Joint works with F. Comets, M. Falconnet, D.& O. Loukianov Currently: Laboratoire

More information

RESEARCH REPORT. A note on gaps in proofs of central limit theorems. Christophe A.N. Biscio, Arnaud Poinas and Rasmus Waagepetersen

RESEARCH REPORT. A note on gaps in proofs of central limit theorems.   Christophe A.N. Biscio, Arnaud Poinas and Rasmus Waagepetersen CENTRE FOR STOCHASTIC GEOMETRY AND ADVANCED BIOIMAGING 2017 www.csgb.dk RESEARCH REPORT Christophe A.N. Biscio, Arnaud Poinas and Rasmus Waagepetersen A note on gaps in proofs of central limit theorems

More information

i=1 h n (ˆθ n ) = 0. (2)

i=1 h n (ˆθ n ) = 0. (2) Stat 8112 Lecture Notes Unbiased Estimating Equations Charles J. Geyer April 29, 2012 1 Introduction In this handout we generalize the notion of maximum likelihood estimation to solution of unbiased estimating

More information

DETECTING PHASE TRANSITION FOR GIBBS MEASURES. By Francis Comets 1 University of California, Irvine

DETECTING PHASE TRANSITION FOR GIBBS MEASURES. By Francis Comets 1 University of California, Irvine The Annals of Applied Probability 1997, Vol. 7, No. 2, 545 563 DETECTING PHASE TRANSITION FOR GIBBS MEASURES By Francis Comets 1 University of California, Irvine We propose a new empirical procedure for

More information

Two-step centered spatio-temporal auto-logistic regression model

Two-step centered spatio-temporal auto-logistic regression model Two-step centered spatio-temporal auto-logistic regression model Anne Gégout-Petit, Shuxian Li To cite this version: Anne Gégout-Petit, Shuxian Li. Two-step centered spatio-temporal auto-logistic regression

More information

RESEARCH REPORT. A logistic regression estimating function for spatial Gibbs point processes.

RESEARCH REPORT. A logistic regression estimating function for spatial Gibbs point processes. CENTRE FOR STOCHASTIC GEOMETRY AND ADVANCED BIOIMAGING www.csgb.dk RESEARCH REPORT 2013 Adrian Baddeley, Jean-François Coeurjolly, Ege Rubak and Rasmus Waagepetersen A logistic regression estimating function

More information

Basic math for biology

Basic math for biology Basic math for biology Lei Li Florida State University, Feb 6, 2002 The EM algorithm: setup Parametric models: {P θ }. Data: full data (Y, X); partial data Y. Missing data: X. Likelihood and maximum likelihood

More information

Random Geometric Graphs

Random Geometric Graphs Random Geometric Graphs Mathew D. Penrose University of Bath, UK Networks: stochastic models for populations and epidemics ICMS, Edinburgh September 2011 1 MODELS of RANDOM GRAPHS Erdos-Renyi G(n, p):

More information

Exponential families also behave nicely under conditioning. Specifically, suppose we write η = (η 1, η 2 ) R k R p k so that

Exponential families also behave nicely under conditioning. Specifically, suppose we write η = (η 1, η 2 ) R k R p k so that 1 More examples 1.1 Exponential families under conditioning Exponential families also behave nicely under conditioning. Specifically, suppose we write η = η 1, η 2 R k R p k so that dp η dm 0 = e ηt 1

More information

arxiv: v1 [math.pr] 17 Jan 2019

arxiv: v1 [math.pr] 17 Jan 2019 Perfect Sampling for Gibbs Point Processes Using Partial Rejection Sampling Sarat B. Moka and Dirk P. Kroese arxiv:90.05624v [math.pr] 7 Jan 209 School of Mathematics and Physics The University of Queensland,

More information

Uniqueness of the maximal entropy measure on essential spanning forests. A One-Act Proof by Scott Sheffield

Uniqueness of the maximal entropy measure on essential spanning forests. A One-Act Proof by Scott Sheffield Uniqueness of the maximal entropy measure on essential spanning forests A One-Act Proof by Scott Sheffield First, we introduce some notation... An essential spanning forest of an infinite graph G is a

More information

Introduction The Poissonian City Variance and efficiency Flows Conclusion References. The Poissonian City. Wilfrid Kendall.

Introduction The Poissonian City Variance and efficiency Flows Conclusion References. The Poissonian City. Wilfrid Kendall. The Poissonian City Wilfrid Kendall w.s.kendall@warwick.ac.uk Mathematics of Phase Transitions Past, Present, Future 13 November 2009 A problem in frustrated optimization Consider N cities x (N) = {x 1,...,

More information

Consistency of the maximum likelihood estimator for general hidden Markov models

Consistency of the maximum likelihood estimator for general hidden Markov models Consistency of the maximum likelihood estimator for general hidden Markov models Jimmy Olsson Centre for Mathematical Sciences Lund University Nordstat 2012 Umeå, Sweden Collaborators Hidden Markov models

More information

SIMILAR MARKOV CHAINS

SIMILAR MARKOV CHAINS SIMILAR MARKOV CHAINS by Phil Pollett The University of Queensland MAIN REFERENCES Convergence of Markov transition probabilities and their spectral properties 1. Vere-Jones, D. Geometric ergodicity in

More information

Bayesian Modeling of Inhomogeneous Marked Spatial Point Patterns with Location Dependent Mark Distributions

Bayesian Modeling of Inhomogeneous Marked Spatial Point Patterns with Location Dependent Mark Distributions Inhomogeneous with Location Dependent Mark Distributions Matt Bognar Department of Statistics and Actuarial Science University of Iowa December 4, 2014 A spatial point pattern describes the spatial location

More information

ESTIMATING FUNCTIONS FOR INHOMOGENEOUS COX PROCESSES

ESTIMATING FUNCTIONS FOR INHOMOGENEOUS COX PROCESSES ESTIMATING FUNCTIONS FOR INHOMOGENEOUS COX PROCESSES Rasmus Waagepetersen Department of Mathematics, Aalborg University, Fredrik Bajersvej 7G, DK-9220 Aalborg, Denmark (rw@math.aau.dk) Abstract. Estimation

More information

RESEARCH REPORT. Estimation of sample spacing in stochastic processes. Anders Rønn-Nielsen, Jon Sporring and Eva B.

RESEARCH REPORT. Estimation of sample spacing in stochastic processes.   Anders Rønn-Nielsen, Jon Sporring and Eva B. CENTRE FOR STOCHASTIC GEOMETRY AND ADVANCED BIOIMAGING www.csgb.dk RESEARCH REPORT 6 Anders Rønn-Nielsen, Jon Sporring and Eva B. Vedel Jensen Estimation of sample spacing in stochastic processes No. 7,

More information

POWER DIAGRAMS AND INTERACTION PROCESSES FOR UNIONS OF DISCS

POWER DIAGRAMS AND INTERACTION PROCESSES FOR UNIONS OF DISCS 30 July 2007 POWER DIAGRAMS AND INTERACTION PROCESSES FOR UNIONS OF DISCS JESPER MØLLER, Aalborg University KATEŘINA HELISOVÁ, Charles University in Prague Abstract We study a flexible class of finite

More information

Poisson-Voronoi graph on a Riemannian manifold

Poisson-Voronoi graph on a Riemannian manifold Poisson-Voronoi graph on a Riemannian manifold Pierre Calka October 3, 2018 Random graphs and its applications for networks Saint-Étienne Poisson-Voronoi tessellation in R n P λ homogeneous Poisson point

More information

A Spatio-Temporal Point Process Model for Firemen Demand in Twente

A Spatio-Temporal Point Process Model for Firemen Demand in Twente University of Twente A Spatio-Temporal Point Process Model for Firemen Demand in Twente Bachelor Thesis Author: Mike Wendels Supervisor: prof. dr. M.N.M. van Lieshout Stochastic Operations Research Applied

More information

Preface. Geostatistical data

Preface. Geostatistical data Preface Spatial analysis methods have seen a rapid rise in popularity due to demand from a wide range of fields. These include, among others, biology, spatial economics, image processing, environmental

More information

Stochastic Proximal Gradient Algorithm

Stochastic Proximal Gradient Algorithm Stochastic Institut Mines-Télécom / Telecom ParisTech / Laboratoire Traitement et Communication de l Information Joint work with: Y. Atchade, Ann Arbor, USA, G. Fort LTCI/Télécom Paristech and the kind

More information

Short-length routes in low-cost networks via Poisson line patterns

Short-length routes in low-cost networks via Poisson line patterns Short-length routes in low-cost networks via Poisson line patterns (joint work with David Aldous) Wilfrid Kendall w.s.kendall@warwick.ac.uk Stochastic processes and algorithms workshop, Hausdorff Research

More information

Estimating functions for inhomogeneous spatial point processes with incomplete covariate data

Estimating functions for inhomogeneous spatial point processes with incomplete covariate data Estimating functions for inhomogeneous spatial point processes with incomplete covariate data Rasmus aagepetersen Department of Mathematics Aalborg University Denmark August 15, 2007 1 / 23 Data (Barro

More information

Asymptotic inference for a nonstationary double ar(1) model

Asymptotic inference for a nonstationary double ar(1) model Asymptotic inference for a nonstationary double ar() model By SHIQING LING and DONG LI Department of Mathematics, Hong Kong University of Science and Technology, Hong Kong maling@ust.hk malidong@ust.hk

More information

Handbook of Spatial Statistics. Jesper Møller

Handbook of Spatial Statistics. Jesper Møller Handbook of Spatial Statistics Jesper Møller May 7, 2008 ii Contents 1 1 2 3 3 5 4 Parametric methods 7 4.1 Introduction.............................. 7 4.2 Setting and notation.........................

More information

Perfect simulation for repulsive point processes

Perfect simulation for repulsive point processes Perfect simulation for repulsive point processes Why swapping at birth is a good thing Mark Huber Department of Mathematics Claremont-McKenna College 20 May, 2009 Mark Huber (Claremont-McKenna College)

More information

Spatial point processes: Theory and practice illustrated with R

Spatial point processes: Theory and practice illustrated with R Spatial point processes: Theory and practice illustrated with R Department of Mathematical Sciences Aalborg University Lecture IV, February 24, 2011 1/28 Contents of lecture IV Papangelou conditional intensity.

More information

Markov random fields. The Markov property

Markov random fields. The Markov property Markov random fields The Markov property Discrete time: (X k X k!1,x k!2,... = (X k X k!1 A time symmetric version: (X k! X!k = (X k X k!1,x k+1 A more general version: Let A be a set of indices >k, B

More information

Stability and Rare Events in Stochastic Models Sergey Foss Heriot-Watt University, Edinburgh and Institute of Mathematics, Novosibirsk

Stability and Rare Events in Stochastic Models Sergey Foss Heriot-Watt University, Edinburgh and Institute of Mathematics, Novosibirsk Stability and Rare Events in Stochastic Models Sergey Foss Heriot-Watt University, Edinburgh and Institute of Mathematics, Novosibirsk ANSAPW University of Queensland 8-11 July, 2013 1 Outline (I) Fluid

More information

A PARAMETRIC MODEL FOR DISCRETE-VALUED TIME SERIES. 1. Introduction

A PARAMETRIC MODEL FOR DISCRETE-VALUED TIME SERIES. 1. Introduction tm Tatra Mt. Math. Publ. 00 (XXXX), 1 10 A PARAMETRIC MODEL FOR DISCRETE-VALUED TIME SERIES Martin Janžura and Lucie Fialová ABSTRACT. A parametric model for statistical analysis of Markov chains type

More information

LIMIT THEORY FOR PLANAR GILBERT TESSELLATIONS

LIMIT THEORY FOR PLANAR GILBERT TESSELLATIONS PROBABILITY AND MATHEMATICAL STATISTICS Vol. 31, Fasc. 1 (2011), pp. 149 160 LIMIT THEORY FOR PLANAR GILBERT TESSELLATIONS BY TOMASZ S C H R E I B E R (TORUŃ) AND NATALIA S O JA (TORUŃ) Abstract. A Gilbert

More information

On the estimation of the entropy rate of finite Markov chains

On the estimation of the entropy rate of finite Markov chains On the estimation of the entropy rate of finite Markov chains Gabriela Ciuperca 1 and Valerie Girardin 2 1 Université LYON I, LaPCS, 50 Av. Tony-Garnier, 69366 Lyon cedex 07, France, gabriela.ciuperca@pop.univ-lyon1.fr

More information

Random Infinite Divisibility on Z + and Generalized INAR(1) Models

Random Infinite Divisibility on Z + and Generalized INAR(1) Models ProbStat Forum, Volume 03, July 2010, Pages 108-117 ISSN 0974-3235 Random Infinite Divisibility on Z + and Generalized INAR(1) Models Satheesh S NEELOLPALAM, S. N. Park Road Trichur - 680 004, India. ssatheesh1963@yahoo.co.in

More information

STAT 7032 Probability Spring Wlodek Bryc

STAT 7032 Probability Spring Wlodek Bryc STAT 7032 Probability Spring 2018 Wlodek Bryc Created: Friday, Jan 2, 2014 Revised for Spring 2018 Printed: January 9, 2018 File: Grad-Prob-2018.TEX Department of Mathematical Sciences, University of Cincinnati,

More information

Mi-Hwa Ko. t=1 Z t is true. j=0

Mi-Hwa Ko. t=1 Z t is true. j=0 Commun. Korean Math. Soc. 21 (2006), No. 4, pp. 779 786 FUNCTIONAL CENTRAL LIMIT THEOREMS FOR MULTIVARIATE LINEAR PROCESSES GENERATED BY DEPENDENT RANDOM VECTORS Mi-Hwa Ko Abstract. Let X t be an m-dimensional

More information

Gibbs models estimation of galaxy point processes with the ABC Shadow algorithm

Gibbs models estimation of galaxy point processes with the ABC Shadow algorithm Gibbs models estimation of galaxy point processes with the ABC Shadow algorithm Lluı s Hurtado Gil Universidad CEU San Pablo (lluis.hurtadogil@ceu.es) Radu Stoica Universite de Lorraine, IECL (radu-stefan.stoica@univlorraine.fr)

More information

arxiv: v1 [stat.me] 27 May 2015

arxiv: v1 [stat.me] 27 May 2015 Modelling aggregation on the large scale and regularity on the small scale in spatial point pattern datasets arxiv:1505.07215v1 [stat.me] 27 May 2015 Frédéric Lavancier 1,2 and Jesper Møller 3 1 Laboratoire

More information

Learning MN Parameters with Approximation. Sargur Srihari

Learning MN Parameters with Approximation. Sargur Srihari Learning MN Parameters with Approximation Sargur srihari@cedar.buffalo.edu 1 Topics Iterative exact learning of MN parameters Difficulty with exact methods Approximate methods Approximate Inference Belief

More information

Topics in Stochastic Geometry. Lecture 1 Point processes and random measures

Topics in Stochastic Geometry. Lecture 1 Point processes and random measures Institut für Stochastik Karlsruher Institut für Technologie Topics in Stochastic Geometry Lecture 1 Point processes and random measures Lectures presented at the Department of Mathematical Sciences University

More information

Logistic regression for spatial Gibbs point processes

Logistic regression for spatial Gibbs point processes Biometrika Advance Access published March 6, 2014 Biometrika (2014), pp. 1 16 Printed in Great Britain doi: 10.1093/biomet/ast060 Logistic regression for spatial Gibbs point processes BY ADRIAN BADDELEY

More information

Quenched invariance principle for random walks on Poisson-Delaunay triangulations

Quenched invariance principle for random walks on Poisson-Delaunay triangulations Quenched invariance principle for random walks on Poisson-Delaunay triangulations Institut de Mathématiques de Bourgogne Journées de Probabilités Université de Rouen Jeudi 17 septembre 2015 Introduction

More information

Tests for spatial randomness based on spacings

Tests for spatial randomness based on spacings Tests for spatial randomness based on spacings Lionel Cucala and Christine Thomas-Agnan LSP, Université Paul Sabatier and GREMAQ, Université Sciences-Sociales, Toulouse, France E-mail addresses : cucala@cict.fr,

More information

SPATIAL point processes are natural models for signals

SPATIAL point processes are natural models for signals I TRANSACTIONS ON INFORMATION THORY, VOL. 45, NO. 1, JANUARY 1999 177 Asymptotic Distributions for the erformance Analysis of Hypothesis Testing of Isolated-oint-enalization oint rocesses Majeed M. Hayat,

More information

Mod-φ convergence II: dependency graphs

Mod-φ convergence II: dependency graphs Mod-φ convergence II: dependency graphs Valentin Féray (joint work with Pierre-Loïc Méliot and Ashkan Nikeghbali) Institut für Mathematik, Universität Zürich Summer school in Villa Volpi, Lago Maggiore,

More information

A NON-PARAMETRIC TEST FOR NON-INDEPENDENT NOISES AGAINST A BILINEAR DEPENDENCE

A NON-PARAMETRIC TEST FOR NON-INDEPENDENT NOISES AGAINST A BILINEAR DEPENDENCE REVSTAT Statistical Journal Volume 3, Number, November 5, 155 17 A NON-PARAMETRIC TEST FOR NON-INDEPENDENT NOISES AGAINST A BILINEAR DEPENDENCE Authors: E. Gonçalves Departamento de Matemática, Universidade

More information

CSC 412 (Lecture 4): Undirected Graphical Models

CSC 412 (Lecture 4): Undirected Graphical Models CSC 412 (Lecture 4): Undirected Graphical Models Raquel Urtasun University of Toronto Feb 2, 2016 R Urtasun (UofT) CSC 412 Feb 2, 2016 1 / 37 Today Undirected Graphical Models: Semantics of the graph:

More information

ON THE ESTIMATION OF DISTANCE DISTRIBUTION FUNCTIONS FOR POINT PROCESSES AND RANDOM SETS

ON THE ESTIMATION OF DISTANCE DISTRIBUTION FUNCTIONS FOR POINT PROCESSES AND RANDOM SETS Original Research Paper ON THE ESTIMATION OF DISTANCE DISTRIBUTION FUNCTIONS FOR POINT PROCESSES AND RANDOM SETS DIETRICH STOYAN 1, HELGA STOYAN 1, ANDRÉ TSCHESCHEL 1, TORSTEN MATTFELDT 2 1 Institut für

More information

Likelihood Inference for Lattice Spatial Processes

Likelihood Inference for Lattice Spatial Processes Likelihood Inference for Lattice Spatial Processes Donghoh Kim November 30, 2004 Donghoh Kim 1/24 Go to 1234567891011121314151617 FULL Lattice Processes Model : The Ising Model (1925), The Potts Model

More information

Anisotropic cylinder processes

Anisotropic cylinder processes Anisotropic cylinder processes Evgeny Spodarev Joint work with A. Louis, M. Riplinger and M. Spiess Ulm University, Germany Evgeny Spodarev, 15 QIA, 8.05.2009 p.1 Modelling the structure of materials Gas

More information

TECHNICAL REPORT NO. 1078R. Modeling Spatial-Temporal Binary Data Using Markov Random Fields

TECHNICAL REPORT NO. 1078R. Modeling Spatial-Temporal Binary Data Using Markov Random Fields DEPARTMENT OF STATISTICS University of Wisconsin Madison 1300 University Avenue Madison, WI 53706 TECHNICAL REPORT NO. 1078R July 31, 2006 Modeling Spatial-Temporal Binary Data Using Markov Random Fields

More information

Mechanistic spatio-temporal point process models for marked point processes, with a view to forest stand data

Mechanistic spatio-temporal point process models for marked point processes, with a view to forest stand data Aalborg Universitet Mechanistic spatio-temporal point process models for marked point processes, with a view to forest stand data Møller, Jesper; Ghorbani, Mohammad; Rubak, Ege Holger Publication date:

More information

The Geometry of Cubic Maps

The Geometry of Cubic Maps The Geometry of Cubic Maps John Milnor Stony Brook University (www.math.sunysb.edu) work with Araceli Bonifant and Jan Kiwi Conformal Dynamics and Hyperbolic Geometry CUNY Graduate Center, October 23,

More information

Normal approximation of geometric Poisson functionals

Normal approximation of geometric Poisson functionals Institut für Stochastik Karlsruher Institut für Technologie Normal approximation of geometric Poisson functionals (Karlsruhe) joint work with Daniel Hug, Giovanni Peccati, Matthias Schulte presented at

More information

Perturbed Proximal Gradient Algorithm

Perturbed Proximal Gradient Algorithm Perturbed Proximal Gradient Algorithm Gersende FORT LTCI, CNRS, Telecom ParisTech Université Paris-Saclay, 75013, Paris, France Large-scale inverse problems and optimization Applications to image processing

More information

A fast sampler for data simulation from spatial, and other, Markov random fields

A fast sampler for data simulation from spatial, and other, Markov random fields A fast sampler for data simulation from spatial, and other, Markov random fields Andee Kaplan Iowa State University ajkaplan@iastate.edu June 22, 2017 Slides available at http://bit.ly/kaplan-phd Joint

More information

Gaussian Limits for Random Measures in Geometric Probability

Gaussian Limits for Random Measures in Geometric Probability Gaussian Limits for Random Measures in Geometric Probability Yu. Baryshnikov and J. E. Yukich 1 May 19, 2004 bstract We establish Gaussian limits for measures induced by binomial and Poisson point processes

More information

Delay-Based Connectivity of Wireless Networks

Delay-Based Connectivity of Wireless Networks Delay-Based Connectivity of Wireless Networks Martin Haenggi Abstract Interference in wireless networks causes intricate dependencies between the formation of links. In current graph models of wireless

More information

Estimating functions for inhomogeneous spatial point processes with incomplete covariate data

Estimating functions for inhomogeneous spatial point processes with incomplete covariate data Estimating functions for inhomogeneous spatial point processes with incomplete covariate data Rasmus aagepetersen Department of Mathematical Sciences, Aalborg University Fredrik Bajersvej 7G, DK-9220 Aalborg

More information

A mathematical framework for Exact Milestoning

A mathematical framework for Exact Milestoning A mathematical framework for Exact Milestoning David Aristoff (joint work with Juan M. Bello-Rivas and Ron Elber) Colorado State University July 2015 D. Aristoff (Colorado State University) July 2015 1

More information

Jesper Møller ) and Kateřina Helisová )

Jesper Møller ) and Kateřina Helisová ) Jesper Møller ) and ) ) Aalborg University (Denmark) ) Czech Technical University/Charles University in Prague 5 th May 2008 Outline 1. Describing model 2. Simulation 3. Power tessellation of a union of

More information

Bayesian Image Segmentation Using MRF s Combined with Hierarchical Prior Models

Bayesian Image Segmentation Using MRF s Combined with Hierarchical Prior Models Bayesian Image Segmentation Using MRF s Combined with Hierarchical Prior Models Kohta Aoki 1 and Hiroshi Nagahashi 2 1 Interdisciplinary Graduate School of Science and Engineering, Tokyo Institute of Technology

More information

An adapted intensity estimator for linear networks with an application to modelling anti-social behaviour in an urban environment

An adapted intensity estimator for linear networks with an application to modelling anti-social behaviour in an urban environment An adapted intensity estimator for linear networks with an application to modelling anti-social behaviour in an urban environment M. M. Moradi 1,2,, F. J. Rodríguez-Cortés 2 and J. Mateu 2 1 Institute

More information

Second-Order Analysis of Spatial Point Processes

Second-Order Analysis of Spatial Point Processes Title Second-Order Analysis of Spatial Point Process Tonglin Zhang Outline Outline Spatial Point Processes Intensity Functions Mean and Variance Pair Correlation Functions Stationarity K-functions Some

More information

Good Triangulations. Jean-Daniel Boissonnat DataShape, INRIA

Good Triangulations. Jean-Daniel Boissonnat DataShape, INRIA Good Triangulations Jean-Daniel Boissonnat DataShape, INRIA http://www-sop.inria.fr/geometrica Algorithmic Geometry Good Triangulations J-D. Boissonnat 1 / 29 Definition and existence of nets Definition

More information

High-dimensional graphical model selection: Practical and information-theoretic limits

High-dimensional graphical model selection: Practical and information-theoretic limits 1 High-dimensional graphical model selection: Practical and information-theoretic limits Martin Wainwright Departments of Statistics, and EECS UC Berkeley, California, USA Based on joint work with: John

More information

Lecture 9. d N(0, 1). Now we fix n and think of a SRW on [0,1]. We take the k th step at time k n. and our increments are ± 1

Lecture 9. d N(0, 1). Now we fix n and think of a SRW on [0,1]. We take the k th step at time k n. and our increments are ± 1 Random Walks and Brownian Motion Tel Aviv University Spring 011 Lecture date: May 0, 011 Lecture 9 Instructor: Ron Peled Scribe: Jonathan Hermon In today s lecture we present the Brownian motion (BM).

More information

Bulk scaling limits, open questions

Bulk scaling limits, open questions Bulk scaling limits, open questions Based on: Continuum limits of random matrices and the Brownian carousel B. Valkó, B. Virág. Inventiones (2009). Eigenvalue statistics for CMV matrices: from Poisson

More information

On the entropy flows to disorder

On the entropy flows to disorder CHAOS 2009 Charnia, Crete 1-5 June 2009 On the entropy flows to disorder C.T.J. Dodson School of Mathematics University of Manchester, UK Abstract Gamma distributions, which contain the exponential as

More information

On the Goodness-of-Fit Tests for Some Continuous Time Processes

On the Goodness-of-Fit Tests for Some Continuous Time Processes On the Goodness-of-Fit Tests for Some Continuous Time Processes Sergueï Dachian and Yury A. Kutoyants Laboratoire de Mathématiques, Université Blaise Pascal Laboratoire de Statistique et Processus, Université

More information

Exponential Family and Maximum Likelihood, Gaussian Mixture Models and the EM Algorithm. by Korbinian Schwinger

Exponential Family and Maximum Likelihood, Gaussian Mixture Models and the EM Algorithm. by Korbinian Schwinger Exponential Family and Maximum Likelihood, Gaussian Mixture Models and the EM Algorithm by Korbinian Schwinger Overview Exponential Family Maximum Likelihood The EM Algorithm Gaussian Mixture Models Exponential

More information

Consistency of Quasi-Maximum Likelihood Estimators for the Regime-Switching GARCH Models

Consistency of Quasi-Maximum Likelihood Estimators for the Regime-Switching GARCH Models Consistency of Quasi-Maximum Likelihood Estimators for the Regime-Switching GARCH Models Yingfu Xie Research Report Centre of Biostochastics Swedish University of Report 2005:3 Agricultural Sciences ISSN

More information

Sensitivity and Asymptotic Error Theory

Sensitivity and Asymptotic Error Theory Sensitivity and Asymptotic Error Theory H.T. Banks and Marie Davidian MA-ST 810 Fall, 2009 North Carolina State University Raleigh, NC 27695 Center for Quantitative Sciences in Biomedicine North Carolina

More information

Desingularization of an immersed self-shrinker.

Desingularization of an immersed self-shrinker. Desingularization of an immersed self-shrinker. Xuan Hien Nguyen (joint work with S. Kleene and G. Drugan) Iowa State University May 29, 2014 1 / 28 Examples of gluing constructions Summary of a classical

More information

Probabilistic Graphical Models

Probabilistic Graphical Models Probabilistic Graphical Models Lecture 11 CRFs, Exponential Family CS/CNS/EE 155 Andreas Krause Announcements Homework 2 due today Project milestones due next Monday (Nov 9) About half the work should

More information

LAN property for ergodic jump-diffusion processes with discrete observations

LAN property for ergodic jump-diffusion processes with discrete observations LAN property for ergodic jump-diffusion processes with discrete observations Eulalia Nualart (Universitat Pompeu Fabra, Barcelona) joint work with Arturo Kohatsu-Higa (Ritsumeikan University, Japan) &

More information

Kesten s power law for difference equations with coefficients induced by chains of infinite order

Kesten s power law for difference equations with coefficients induced by chains of infinite order Kesten s power law for difference equations with coefficients induced by chains of infinite order Arka P. Ghosh 1,2, Diana Hay 1, Vivek Hirpara 1,3, Reza Rastegar 1, Alexander Roitershtein 1,, Ashley Schulteis

More information

A fixed-point approximation accounting for link interactions in a loss network

A fixed-point approximation accounting for link interactions in a loss network A fixed-point approximation accounting for link interactions in a loss network MR Thompson PK Pollett Department of Mathematics The University of Queensland Abstract This paper is concerned with evaluating

More information

High-dimensional graphical model selection: Practical and information-theoretic limits

High-dimensional graphical model selection: Practical and information-theoretic limits 1 High-dimensional graphical model selection: Practical and information-theoretic limits Martin Wainwright Departments of Statistics, and EECS UC Berkeley, California, USA Based on joint work with: John

More information

Introduction to graphical models: Lecture III

Introduction to graphical models: Lecture III Introduction to graphical models: Lecture III Martin Wainwright UC Berkeley Departments of Statistics, and EECS Martin Wainwright (UC Berkeley) Some introductory lectures January 2013 1 / 25 Introduction

More information

KALMAN-TYPE RECURSIONS FOR TIME-VARYING ARMA MODELS AND THEIR IMPLICATION FOR LEAST SQUARES PROCEDURE ANTONY G AU T I E R (LILLE)

KALMAN-TYPE RECURSIONS FOR TIME-VARYING ARMA MODELS AND THEIR IMPLICATION FOR LEAST SQUARES PROCEDURE ANTONY G AU T I E R (LILLE) PROBABILITY AND MATHEMATICAL STATISTICS Vol 29, Fasc 1 (29), pp 169 18 KALMAN-TYPE RECURSIONS FOR TIME-VARYING ARMA MODELS AND THEIR IMPLICATION FOR LEAST SQUARES PROCEDURE BY ANTONY G AU T I E R (LILLE)

More information

A = {(x, u) : 0 u f(x)},

A = {(x, u) : 0 u f(x)}, Draw x uniformly from the region {x : f(x) u }. Markov Chain Monte Carlo Lecture 5 Slice sampler: Suppose that one is interested in sampling from a density f(x), x X. Recall that sampling x f(x) is equivalent

More information

L n = l n (π n ) = length of a longest increasing subsequence of π n.

L n = l n (π n ) = length of a longest increasing subsequence of π n. Longest increasing subsequences π n : permutation of 1,2,...,n. L n = l n (π n ) = length of a longest increasing subsequence of π n. Example: π n = (π n (1),..., π n (n)) = (7, 2, 8, 1, 3, 4, 10, 6, 9,

More information

RELATING TIME AND CUSTOMER AVERAGES FOR QUEUES USING FORWARD COUPLING FROM THE PAST

RELATING TIME AND CUSTOMER AVERAGES FOR QUEUES USING FORWARD COUPLING FROM THE PAST J. Appl. Prob. 45, 568 574 (28) Printed in England Applied Probability Trust 28 RELATING TIME AND CUSTOMER AVERAGES FOR QUEUES USING FORWARD COUPLING FROM THE PAST EROL A. PEKÖZ, Boston University SHELDON

More information