On comparison of clustering properties of point processes

Advances in Applied Probability

Volumn 46, Issue 1, 2014, Pages 1-20

  Blaszczyszyn, Bartlomiej ^a   Yogeshwaran, D ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Association; Clustering; Determinantal point process; Directionally convex ordering; Permanental point process; Perturbed lattice; Point process; Sub Poisson point process; Super Poisson point process

Indexed keywords

ASSOCIATION REACTIONS; SOLVENTS; STOCHASTIC SYSTEMS;

CLUSTERING; CLUSTERING PROPERTIES; CONVEX ORDER; INDEPENDENCE PROPERTIES; MACROSCOPIC PROPERTIES; PERTURBED LATTICES; POINT PROCESS; POISSON POINT PROCESS;

STOCHASTIC MODELS;

EID: 84881053128     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1239/aap/1396360100     Document Type: Article

References (37)

1. Aldous, D. and Steele, J. M. (1992). Asymptotics for Euclidean minimal spanning trees on random points. Prob. Theory Relat. Fields 92, 247-258.
2. Alexander, K. S. (1995). Percolation and minimal spanning forests in infinite graphs. Ann. Prob. 23, 87-104.
3. Baccelli, F., Błaszczyszyn, B. and Haji-Mirsadeghi, M. O. (2011). Optimal paths on the space-time SINR random graph. Adv. Appl. Prob. 43, 131-150.
4. Błaszczyszyn, B. and Yogeshwaran, D. (2009). Directionally convex ordering of random measures, shotnoise fields, and some applications to wireless communications. Adv. Appl. Prob. 41, 623-646.
5. Błaszczyszyn, B. and Yogeshwaran, D. (2013). Clustering and percolation of point processes. Electron. J. Prob. 18, 20pp.
6. Błaszczyszyn, B. and Yogeshwaran, D. (2011). Clustering, percolation and directionally convex ordering of point processes. Preprint. Available at http://uk.arxiv.org/abs/1105.4293v1.
7. Burton,R. andWaymire, E. (1985). Scaling limits for associated random measures. Ann. Prob. 13, 1267-1278.
8. Coupechoux, E. and Lelarge, M. (2011). Impact of clustering on diffusions and contagions in random networks. In Proc. NetGCOOP 2011, Paris, 1-7.
9. Daley, D. J. and Last, G. (2005). Descending chains, the lilypond model, and mutual-nearest-neighbour matching. Adv. Appl. Prob. 37, 604-628. (Pubitemid 41488721)
10. Georgii, H.-O. and Yoo, H. J. (2005). Conditional intensity and Gibbsianness of determinantal point processes. J. Statist. Phys. 118, 55-84.
11. Goldman, A. (2010). The Palm measure and the Voronoi tessellation for the Ginibre process. Ann. Appl. Prob. 20, 90-128.
12. Hirsch, C., Neuhauser, D. and Schmidt, V. (2013). Connectivity of random geometric graphs related to minimal spanning forests. Adv. Appl. Prob. 45, 20-36.
13. Hough, J. B., Krishnapur, M., Peres, Y. and Virág, B. (2006). Determinantal processes and independence. Prob. Surveys 3, 206-229.
14. Hough, J. B., Krishnapur, M., Peres, Y. and Virág, B. (2009). Zeros of Gaussian Analytic Functions and Determinantal Point Processes (Univ. Lecture Ser. 51). American Mathematical Society, Providence, RI.
15. Joag-Dev, K. and Proschan, F. (1983). Negative association of random variables with applications. Ann. Statist. 11, 286-295.
16. Kahle, M. (2011). Random geometric complexes. Discrete Comput. Geom. 45, 553-573.
17. Kallenberg, O. (1983). Random Measures, 3rd edn. Akademie-Verlag, Berlin.
18. Lyons, R. (2003). Determinantal probability measures. Publ. Math. Inst. Hautes Études Sci. 98, 167-212.
19. Marchand, R. (2002). Strict inequalities for the time constant in first passage percolation. Ann. Appl. Prob. 12, 1001-1038. (Pubitemid 37023740)
20. Marcus, M. (1964). The Hadamard theorem for permanents. Proc. Amer. Math. Soc. 15, 967-973.
21. Marshall, A. W., Olkin, I. and Arnold, B. C. (2011). Inequalities: Theory of Majorization and Its Applications, 2nd edn. Springer, NewYork.
22. Meester, L. E. and Shanthikumar, J. G. (1993). Regularity of stochastic processes: a theory based on directional convexity. Prob. Eng. Inf. Sci. 7, 343-360.
23. Meester, R. and Roy, R. (1996). Continuum Percolation (Camb. Tracts Math. 119). Cambridge University Press.
24. Miyoshi, N. and Shirai, T. (2014).A cellular network model with Ginibre configurated base stations. To appear in Adv. Appl. Prob.
25. Müller, A. and Stoyan, D. (2002). Comparison Methods for Stochastic Models and Risks. John Wiley, Chichester.
26. Pemantle, R. (2000). Towards a theory of negative dependence. J. Math. Phys. 41, 1371-1390.
27. Penrose, M. D. (1996). Continuum percolation and Euclidean minimal spanning trees in high dimensions. Ann. Appl. Prob. 6, 528-544. (Pubitemid 126119944)
28. Penrose, M. (2003). Random Geometric Graphs. Oxford University Press.
29. Peres, Y. and Virág, B. (2005). Zeros of the i.i.d. Gaussian power series: a conformally invariant determinantal process. Acta Math. 194, 1-35. (Pubitemid 41024641)
30. Schulte, M. and Thäle, C. (2012). The scaling limit of Poisson-driven order statistics with applications in geometric probability. Stoch. Process. Appl. 122, 4096-4120.
31. Sodin, M. and Tsirelson, B. (2004). Random complex zeroes. I. Asymptotic normality. Israel J. Math. 144, 125-149. (Pubitemid 40317778)
32. Sodin, M. and Tsirelson, B. (2006). Random complex zeroes. II. Perturbed lattice. Israel J. Math. 152, 105-124. (Pubitemid 43681552)
33. Van den Berg, J. and Kesten, H. (1993). Inequalities for the time constant in first-passage percolation. Ann. Appl. Prob. 3, 56-80.
34. Whitt, W. (1985). Uniform conditional variability ordering of probability distributions. J. Appl. Prob. 22, 619-633. (Pubitemid 16517353)
35. Yan, M. (2014). Extension of convex function. To appear in J. Convex Anal.
36. Yogeshwaran, D. (2010). Stochastic geometric networks: connectivity and comparison. Doctoral Thesis. Universite Pierre et Marie Curie.
37. Yogeshwaran, D. and Adler, R. J. (2012). On the topology of random complexes built over stationary point processes. Preprint. Available at http://uk.arxiv.org/abs/1211.0061.