COUNTING PROCESSES
Learning and adaptive estimation for marker-dependent counting processes
... The proof of this theorem is given in Section 6 . This theorem proves that ˆ α n adapts to the smoothness of the intensity, and to its structure: if the single-index model ( 38 ) holds, then the rate is n −2¯ s/(2¯ s+2) ...
41
Posterior concentration rates for counting processes with Aalen multiplicative intensities
... Comte, F., Ga¨ıffas, S., Guilloux, A. (2011). Adaptive estimation of the conditional intensity of marker-dependent counting processes Ann. Inst. Henri Poincar´e Probab. Stat., 47: 1171–1196. Daley, D. J., ...
27
Bridges of Markov counting processes. Reciprocal classes and duality formulas
... possible processes with jumps, namely the counting ...simple processes, it appears that this reciprocal structure is ...simple processes with jumps, which we call nice Markov counting ...
13
Kalikow decomposition for counting processes with stochastic intensity *
... time counting processes, is the one by Hodara and L¨ ocherbach ...the processes under interest can be thinned by rejection sampling (see also [18] for another use of thinning in simulation of ...
31
Concentration inequalities, counting processes and adaptive statistics
... This result is a shortened version of Proposition 1 and Theorem 1 of [42]. This result seems more general than Theorem 1 because it deals with general counting processes and as icing on the cake, we obtain ...
20
Counting processes and copulas : applications in insurance
... For instance, in chapter two of this thesis, among several other random variables associated with count data in insurance, we researched on how dependence modeling is carried for b[r] ...
135
Simple Formulas for Counting Processes in Reliability Models
... continuous-time counterpart of the Cheung’s reliability-model (see Example 2.2) developed by Littlewood [10]. Indeed, a software system is often decomposed into a set of M components; the execution control is in one and ...
24
Crowd-Centric Counting via Unsupervised Learning
... V. F INAL R EMARK This paper has proposed a crowd-centric technique based on unsupervised learning for counting device-free targets. Based on a low-dimensional representation of the received waveforms, the number ...
7
Automatic Vehicle Counting System for Traffic Monitoring
... Based on the detection ratio, vehicle detection results of the video-based system are better than those obtained with the ILD system, whatever the dataset considered: 99.2 against 94.02% for Cloudy, 98.69 against 95% for ...
13
Counting the uncountable: statistics for web archives
... services for mobile devices. There is one library activity that has developed recently and has not yet found its place in the existing standards for library evaluation, namely web archiving.Evidently, this huge new task ...
11
Mining frequent patterns with counting inference
... This optimization uses pattern counting inference, using the key patterns in equivalence classes to reduce the number of pat- terns counted and database passes.. We conducted per[r] ...
11
Counting Majorana zero modes in superconductors
... to counting zero modes induced by defective order parameters in the condensed matter ...the counting. Our general counting formula reproduces their and previous results, and extends them to arbitrary ...
20
Counting primary loops in polymer gels
... Low mass primary loop products (e.g., dumbbell polymers) were directly observed in these soluble materials prior to disassembly; quantification of the ratio of primary loop junctions to i[r] ...
7
Counting Subwords Occurrences in Base-b Expansions
... From a linear representation with matrices of size d×d associated with a b-regular sequence, one can derive a linear representation with matrices of size 2d × 2d associated with its summ[r] ...
33
Counting Minimal Transversals of ß-Acyclic Hypergraphs
... 3. Counting the minimal transversals of β-acyclic hypergraphs In this section, we fix H a β-acyclic hypergraph, ≤ a β-elimination ordering of its vertices and we let ≤ H the induced lexicographic ordering on the ...
17
An Hopf algebra for counting simple cycles
... In our view both problems can be treated with the same tools rooted in the algebraic combinatorics of paths [12]. The literature of graph theory contains many different approaches to defining paths on graphs as algebraic ...
23
Counting points on elliptic curves over finite fields
... In this section we explain how to count the number of points on an elliptic curve .E, when the endomorphism ring of E is known.. In this case there is an extremely eff[r] ...
37
Geometric Noise for Locally Private Counting Queries
... for counting queries [10], meaning that it is the mechanism providing the best utility for a given privacy level, and for all possible prior knowledge the adversary or the user may ...
5
Rigid cohomology and $p$-adic point counting
... 1. Introduction I consider the problem of computing the zeta function of an algebraic variety defined over a finite field. This problem has been pushed into the limelight in recent years because of its importance in ...
13
Hyperbolic lattice-point counting and modular symbols
... Abstract. For a cocompact group Γ of SL 2 (R) we fix a real non-zero harmonic 1-form α. We study the asymptotics of the hy- perbolic lattice-counting problem for Γ under restrictions imposed by the modular symbols ...
15