Hierarchical Poisson Registration of Longitudinal Crime Trajectories DONATELLO TELESCA1 , ELENA A. EROSHEVA2 , DEREK A. KREAGER3 , ROSS L. MATSUEDA4 Author’s Footnote 1

The University of Texas M.D. Anderson Cancer Center, Department of Biostatistics. 2

3

University of Washington, Departments of Statistics and School of Social Work.

Pennsylvania State University, Department of Sociology and Crime, Law and Justice. 4

University of Washington, Department of Sociology.

August 25, 2008

1

For Correspondence

Donatello Telesca, Department of Biostatistics The University of Texas M.D. Anderson Cancer Center 1515 Holcombe Boulevard, Unit 447 Houston, TX 77030 phone: 713 792 1619 e-mail: [email protected]

1

Hierarchical Poisson Registration of Longitudinal Crime Trajectories

Abstract A major aim of longitudinal analyses of life course data is to describe the within- and between-individual variability in a behavioral outcome, such as crime. Models for such data typically draw on mixed-effects growth and mixture models. One common method assumes a mixture of groups defined by distinct polynomial relationships between age and behavior and incorporates individual-specific polynomial random effects such as age or age squared. We develop an alternative model of life course crime data by taking a functional data analytic point of view and considering the observed individual crime trajectories as a set of random functions. We draw on the empirical and theoretical claims of Hirschi and Gottfredson (1983) and assume a natural unimodal age-crime curve, common for all individuals, and allow expected individual crime trajectories to differ by latent patterns of temporal misalignment and scalar amplitude parameters. We extend the hierarchical curve registration methods of Telesca and Inoue (2008) to accommodate count data and to incorporate unimodality constraints on individual behavioral trajectories. Hierarchical registration of longitudinal count data with unimodality constraints allows us to develop a flexible nonparametric representation for individual curves of criminal offending. We illustrate this method on self-reported counts of yearly marijuana use from the Denver Youth Survey.

Keywords: Curve Registration, Functional Data, Generalized Linear Models, Longitudinal Data, MCMC, Unimodal Regression.

2

1 Introduction In the social sciences, many of the most important substantive questions require analyzing individual behavioral trajectories over time, including demographic studies of fertility curves, economic studies of wage trajectories, and education studies of learning curves. In criminology, a focus on individual trajectories began with interest in life course perspectives, theories about distinct types of offender trajectories, and controversy over the age-crime curve. Hirschi and Gottfredson (1983) injected controversy in criminology when they claimed that the age crime curve is invariant across social groups and throughout history, and therefore beyond social explanation. They argued that a single unimodal age–crime curve underlies all crime (including illicit drug use) , such that crime rises precipitously from age seven (age of culpability) until the peak years (between 13-21 depending on the crime), and then slowly declines thereafter through the life span. Sampson and Laub (1993) subsequently pioneered a life course perspective on crime, in which crime patterns can be traced to trajectories and turning points. Moffitt (1993) also developed a theoretical taxonomy in which individual trajectories of offending are a mixture of adolescence-limited and life course persistent offenders. More recently, Roeder et al. (1999) developed mixture models for latent classes of trajectories drawing on Moffits theory of distinct types of offenders (e.g., see Nagin (2005)). Muth´en and Shedden (1999) then developed a similar model that also allows for within-group random effects. Most of the work on crime trajectories, whether it assumes a single class of offenders or multiple latent classes, specifies individual trajectories to be polynomial in age, with possible polynomial random effects such as age and age squared. Such polynomial representations are typically not able to capture nuanced heterogeneity in observed individual curves of criminal behavior. In fact, research findings using these methods can be overwhelmingly driven by

3

tremendous variability in within-age behavioral amplitude that is common in crime data (Gottfredson and Hirschi 1990). Polynomial-based trajectory methods often perform poorly in predicting other sources of variability in crime data, such as age at desistance. In this article, we consider observed individual crime trajectories as a set of random functions. We are not the first to take a functional data analytic point of view towards life course crime data. Ramsay and Silverman (2002) carried out a functional principal component analysis on landmark data originally collected by Glueck and Glueck (1950), and reanalyzed by Sampson and Laub (1993). Their analysis attempted to address the controversy among criminologists about the existence of different types of “criminal careers”; they concluded that there was “no real evidence of strong groups within the original data”. Our approach to analyzing life course crime trajectories, although functional, is fundamentally different from that of Ramsay and Silverman (2002). We draw on the claim of Hirschi and Gottfredson (1983) about the existence of a common shape of crime patterns across age, and on observations of Sampson and Laub (2005) about individual differences in ages at desistance, and thus approach phase variability in behavioral patterns via curve registration and time stochasticity in an explicit fashion. Several authors have contributed to the statistical analysis of random curves. Shi et al. (1996) were among the first to introduce flexible semiparametric models for the analysis of a sample of curves based on functional mixed effects modeling. In the analysis of sparsely observed functions, Rice and Silverman (1991) and, more recently, Yao et al. (2005) discuss nonparametric methods based on functional principal component analysis. Typically, functional data analysis deals with large amounts of data sampled on a fine grid in time or space (Brumback and Lindstrom 2004, Gervini and Gasser 2004). Information on lifetime criminal behavior, however, often comes in the form of many short or sparsely sampled time series (see Elliott et al. 1985 or Harris et al. 2003). High individual hetero4

geneity in combination with such data structures call for classes of models that capitalize on borrowing information across subjects while maintaining a high level of flexibility in order to fit well to individual observed trajectories. To deal with short and sparse time series that, in addition, may be observed over different time intervals 1 , we draw on the theoretical claims of Hirschi and Gottfredson (1983) and incorporate the unimodality constraint on individual behavioral trajectories within the existing toolkit of functional data analysis. The treatment of unimodal regression models has had limited attention in the statistical literature (Fris´en 1986). In the framework of penalized B–Splines, we derive a simple reparametrization of the spline coefficients that guarantees weak unimodality at the cost of only one extra modality parameter. We build on curve registration models of Ramsay and Li (1998), who introduced a model for the alignment of a sample of curves via a continuous monotone transformation of a main effect modifier (usually time), and Telesca and Inoue (2008), who formulated a Bayesian hierarchical model for curve registration, allowing for the borrowing of information across curves. To accommodate discrete observations (counts), we develop a generalized extension of the curve registration models to count data. To our knowledge, we are the first to use warping regression modeling in a non-Gaussian case. Our method of hierarchical curve registration with unimodality constraints allows us to develop a flexible set of nonparametric representations for individual curves of criminal offending that we illustrate with data on marijuana use. Our formulation deals with data sparsity by combining information across curves in two ways: (1) structurally, by representing individual curves as an affine transformation of a natural crime curve (common to all subjects) evaluated over a stochastic time scale; and (2) stochastically, by assuming conditional dependence (exchangeability) between key parameters contributing to the likelihood 1

Due to age differences at the time of survey enrollment, for example.

5

function. As we model the crime trajectories in a semi–parametric fashion, robustness is achieved by drawing on a substantive theory to restrict the common shape trajectory to a family of weakly unimodal functions. The remainder of this article is organized as follows. In Section 2 we introduce a hierarchical model for the semi–parametric analysis of longitudinal count data. We discuss MCMC estimation and inference in Section 3 and we analyze lifetime data on marijuana use, from the Denver Youth Survey in Section 4. We conclude with a discussion of our contribution and possible extensions in Section 5. 2 Hierachical Registration 2.1 Poisson Warping Regression Model In this section, we introduce a general formulation for the functional representation of longitudinal count data. For ease of notation, we will start considering the hypothetical case, where we can observe the response Y at any time t in a continuous sampling interval T = [t0 , tn ]. More precisely, we let Yi (t) denote the number of offenses for individual i, i = 1, ..., N, at time t ∈ T . Technically, this is the number of offenses over a certain time interval, τ , for example, a month or a year, just before time t. The time interval τ is fixed and the same for all observations in the sample. We assume that individual lifetime crime patterns arise as realizations of a compound Poisson process. Thus, for individual i, the observed count at time t is: Yi (t) | λi (t, θi ) ∼ P oisson{ λi (t, θi ) },

(1)

where θ i = (β, φi , ai )0 denotes a set of parameters defining the following mean structure λi (t, θ i ) = ai m{ µi (t, φi ), β } ≥ 0, 6

∀t ∈ [t0 , tn ].

(2)

Here, subject-specific amplitude parameters ai ≥ 0 reflect variability in the expected intensity of criminal behavior. Allowing the sampling interval T to be extended by a temporal misalignment window, ∆, we define the shape function m(t, β) to be positive over the extended sampling interval T = [t0 − ∆, tn + ∆]: m(t, β) : T −→ R+ ∪ 0.

(3)

We assume the shape function is common to all subjects. We require subject-specific time transformation functions µi (t, φi ) to be strictly monotone, ∂µi (t, φi )/∂t > 0 (Ramsay and Li 1998). This property forbids time reversibility and assures a 1-to-1 correspondence between the original time scale t and the transformed time scale µi (t, φi ). Time transformation functions reflect individual variation in the speed of a “maturation and aging” clock; they can be thought of as describing individual phase variability. Following Telesca and Inoue (2008), we allow time transformation functions to map the original time scale onto random intervals enclosed in a compact interval T = [t0 − ∆, tn + ∆]: µi (t, φi ) : [t0 , tn ] −→ [t0 − ∆, tn + ∆],

(4)

where the extended sampling interval T is defined in terms of a temporal misalignment window ∆ < ∞. To illustrate generation of expected mean curves in Equation (2), we provide graphical examples in Figure 1. The generating shape function (panel b, solid black) is a simple bell shaped curve. This curve is defined over the original time scale, which we represent in panel (a) as the identity time transformation function that maps T onto itself (solid black). In panel (a) we also introduce three monotone transformation functions. The dashed black curve provides a simple linear shift (about 5 time units) in the original time scale. The corresponding trajectory (dashed black) in panel (b) is identical to the generating shape function, 7

shifted backwards by about 5 time units. The original time scale may also be warped in a non linear fashion, creating a trajectory which locally expands and/or contracts the phase of the original curve. In panel (a), (solid gray) we draw a time transformation function which shifts backwards and expands the phase of the shape function (see corresponding curve in panel b). In a different fashion, the transformation function in (dot–dashed gray) shifts forward and shrinks the phase of the shape function (see corresponding curve in panel b). All curves in panel (b) are drawn for different amplitude levels (0.6, 1 and 1.5, respectively), to illustrate the effect of relative changes in the amplitude parameter ai . In the context of this article, the common shape function m(·) can be interpreted as a “typical” pattern of criminal activity. We assume the “typical” subject offends with average intensity ai = 1 and follows the “typical” clock speed µi (t, φi ) = t during the sampling time period T . Given individual-specific variations in behavioral intensity and temporal misalignment, many social and behavioral phenomena may be thought of as following a common shape function with mild constraints. For example, unimodal constraints can be placed on fertility curves and crime trajectories, and learning curves can be assumed to be non-decreasing (Gottfredson and Hirschi 1990). Anticipating our application to lifetime crime curves, we will require the common shape function m(t, β) to be weakly unimodal. That is, if there exists a set of time points Im where ∂m(t, θ)/∂t |t∈Im = 0, then Im is assumed to be a continuous subinterval of T . Thus, our model is consistent with the substantive argument of Hirschi and Gottfredson (1983) about a common shape function for the age-crime curve, and reflects individual variability through variation in intensity and temporal misalignment. Indeed, in their later work, Gottfredson and Hirschi (1990) introduced the concept of self-control to explain individual variation in criminal propensity that remains stable across the life span. That propensity is 8

here modeled as intensity. 2.2 B-Splines Representation and Unimodal Regression In this section we discuss unimodality constraints for the common shape and time-transformation functions introduced in Equations (3) and (4), respectively. We assume that the functional forms of interest belong to the Sobolev space spanned by linear combinations of cubic BSpline basis functions (De Boor 1978). Intuitively, this is a vector space containing shapes of virtually arbitrary flexibility, provided it originates from an adequate number of basis functions. We start by considering the representation of subject-specific time transformation functions µi (t, φi ). Let Sµ (t) denote a set of Q B-spline basis functions of order 4 (See Pe˜ na 1997, for a discussion of B-spline optimality and stability), evaluated at time t, and let φi = (φi1 , . . . , φiQ )0 be a Q–dimensional vector of basis coefficients. Given φi , the subjectspecific time transformation functions are modeled as µi (t, φi ) = Sµ (t)0 φi .

(5)

Placing the order constraints on the time transformation coefficients φi φi1 < · · · < φiq < · · · < φiQ

(6)

provides us with a sufficient condition for time transformation functions µi (t, φi ) to be monotone (Brumback and Lindstrom 2004). Additionally, imposing boundary conditions (t0 − ∆ ≤ φi1 ≤ t0 + ∆) and (tn − ∆ ≤ φiQ ≤ tn + ∆)

(7)

allows for the time transformations µi (t, φi ) to map the original time scale t on random intervals not bigger than [t0 − ∆, tn + ∆] and not smaller than [t0 + ∆, tn − ∆]. This 9

last requirement rules out possible degeneracies associated with the time transformation functions, provided that the temporal misalignment window is chosen so that ∆ << (tn − t0 )/2. Similarly, let Sm (t) be a set of K B-spline basis functions of order 4 evaluated at time t, and β = (β1 , . . . , βK )0 denote a K–dimensional vector of shape coefficients. The common shape function m(t, β) can be represented as the linear combination: m(t, β) = Sm (t)0 β.

(8)

A sufficient condition for m(t, β) to be weakly unimodal requires the shape coefficient to exhibit only one possible sign change (Schumaker 1981, Theorem 4.76). We combine the unimodality and positivity constraints on shape coefficients β so that 0 = β1 ≤ β2 ≤ · · · ≤ βk∗ ≥ · · · ≥ βK−1 ≥ βK ≥ 0,

(9)

where 2 ≤ k ∗ ≤ K indexes a pivotal unimodality knot. Here, the condition β1 = 0 coincides with the assumption that E( Yi (t) | t = t0 − ∆) = 0, for a typical individual i. In practice, we only observe individual offending frequencies over a discrete sampling time grid ti = (ti1 , ..., tij , ..., tini )0 . Let Yi = (Yi (ti1 ), ..., Yi (tini ))0 , denote the observed vector of offending frequencies for subject i, i = 1, ..., N . Let Y = (Y10 , ..., YN 0 )0 denote the entire set of observations. Also, let a = (a1 , ..., aN )0 denote the vector of amplitude parameters and Φ = (φ1 0 , ..., φ0N )0 denote the full set of time transformation coefficients. Using the B-Spline representations in (5) and (8), we may rewrite the expected number of offenses for subject i at time tij as: λi (tij , β, ai , φi ) = ai {Sm (tij )0 β ◦ Sµ (tij )0 φi } = ai Sm {Sµ (tij )0 φi }0 β,

10

(10)

and derive the log-likelihood function as: `(β, a, Φ|Y) ∝

ni N X X

[ Yi (tij ) log{λi (tij , β, ai , φi )} − λi (tij , β, ai , φi )] .

(11)

i=1 j=1

Our model depends on the choice of the number and location of the spline knots modeling the common shape function m(t, β) and the time transformation functions µi (t, φi ). The common shape is estimated from the entire set of trajectories; therefore we recommend a large number of knots (e.g., placing knots at every other sampling time point) to allow for a high level of flexibility in the shape of the behavioral pattern. Different considerations apply for the subject–specific time transformation functions. These maps carry structural smoothness as they are constrained to be monotone. The strict monotonicity requirement counterbalances the small number of observations associated with each criminal trajectory and suggests parsimony in the choice of the number of knots2 . Because the time scale is stochastic in our formulation, the exact placement of knots is less important; thus knots for time transformation functions can be equally spaced. We combine these practical considerations with shrinkage properties described in Section 2.3 to allow for a flexible representation of the mean structure that is penalized for complexity in an automatic fashion. 2.3 Prior Specification and Smoothing In this section we complete the Bayesian hierarchical model by describing specific distributional assumptions associated with the subject- and population-level parameters. Subject level parameters To specify a distribution for the subject-specific amplitude, ai , we exploit the Gamma-Poisson 2 In fact, the monotonicity requirement carries an assumption of structural smoothness for the common shape. However, the estimation of this function combines normalized observations across all subjects. We are therefore not worried about its overparametrization.

11

conjugacy and define (ai | a0 , b0 ) ∼ G(b0 , b0 /a0 ).

(12)

√ Here, a0 is the average prior amplitude as E(ai | a0 , b0 ) = b0 × a0 /b0 = a0 , and 1/ b0 is the coefficient of variation. This parametrization will allow for the definition of a partially conjugate prior for the population level parameters a0 and b0 . Following the penalization approach introduced in Lang and Brezger (2004), time transformation coefficients φi that define subject-specific time scales µi (t, φi ) are assumed to arise from a first-order random walk shrinkage prior. If we let Υ be a Q–dimensional vector of identity coefficients, so that Sµ (t)Υ0 = t, we define (φiq − Υq ) = (φi(q−1) − Υq−1 ) + ηq , with ηq ∼ N (0, σφ2 ), q = 1, ..., Q.

(13)

In addition to (13), we require time transformation coefficients to satisfy monotonicity and image constraints in Equations (6) and (7). The variance parameter σφ2 can be interpreted as a smoothing parameter that controls the amount of shrinking of individual time transformation functions towards the identity transformation µi (t, Υ) = t. Population level parameters To choose a prior distribution for the shape coefficients β, we must take into account the unimodality and positivity requirements from Equation (9). We reparametrize the shape coefficients β , so that βk = ν ∗ − |νk − ν ∗ |, k = 1, ..., K, to obtain a new set of nondecreasing coefficients: 0 = ν1 ≤ · · · ≤ νK and νK /2 < ν ∗ < νK .

(14)

The reparametrization above is sufficient to insure the weak unimodality of the shape function in Equation (20). The unimodality knot κ∗ from Equation (9) is now replaced with a unimodality parameter ν ∗ . A proper, non-informative conditional prior distribution on the modal pivot is easily devised as (ν ∗ | νK ) ∼ U (νK /2, νK ). 12

To impose smoothness, we introduce a roughness penalty on the shape function via a second order shrinkage prior on ν = (ν1 , ..., νK )0 . In particular, assuming ν0 = ν1 = 0, we model the k th element of ν as νk = 2νk−1 − νk−2 + εk , where εk ∼ N (0, σβ2 ),

(15)

subject to constraints in Equation (14). The variance parameter σβ2 can be interpreted as a smoothing parameter shrinking the coefficients in ν towards a linearly increasing pattern. The population level parameters (a0 and b0 ) associated with the subject–specific amplitudes of criminal activity are chosen to follow a partially conjugate scheme. More precisely, we place a conjugate inverse gamma prior on the average amplitude a0 , so that a0 ∼ IG(α, γ) and a diffuse, but proper, gamma hyperprior on the dispersion b0 , so that b0 ∼ G(ψ, ω). Finally, we place conjugate Gamma hyperpriors for the shape and time transformation smoothing parameters, so that 1/σβ2 ∼ G(as , bs ) and 1/σφ2 ∼ G(ap , bp ). 3 Estimation and Inference 3.1 Posterior Integration via MCMC For the model described in Section 2, the full parameter vector θ includes a vector of random amplitude coefficients a = (a1 , ..., aN )0 , an (W = N × Q)– dimensional vector of time transformation coefficients Φ = (φ01 , ..., φ0N )0 , a K– dimensional vector of shape parameters ν = (ν1 , ..., νK )0 , a modal coefficient ν ∗ , and the population level parameters a0 , b0 , σφ2 and σβ2 . We seek inference about θ and functionals of θ through the posterior probability p(θ | Y) ∝ p(Y | θ)π(θ),

(16)

where p(Y | θ) is proportional to the log-likelihood in Equation (11) and π(θ) is a product of 13

conditionally independent prior distributions for the components of θ introduced in Section 2.3. Because the posterior distribution is not available in closed form, we base our inferences on a Markov Chain Monte Carlo (MCMC) sample from the joint posterior distribution p(θ | Y) (see Gamerman 1997, for a recent review). We use a Gibbs sampler (Gelfand and Smith 1990) whenever conditional posterior quantities are available in standard distributional form. Otherwise, we derive an efficient sampling scheme, combining Gibbs sampling with the Metropolis-Hastings algorithm (Hastings 1970) and with slice sampling (Neal 2003) in a hybrid sampler (Tienry 1994). The prior model of Section 2.3 induces conjugacy in the conditional posterior distribution of the amplitude parameters a, the average amplitude a0 and the smoothing parameters σφ2 and σβ2 . For these quantities, it is therefore straightforward to devise an efficient Gibbs sampler based on direct simulation from their full conditional distributions. Appendix 1 provides explicit derivations. The conditional posterior distributions associated with φ, ν, ν ∗ and b0 do not have standard form, and we must devise a hybrid sampling scheme capable of exploring p(θ | Y) in an efficient manner. We begin by considering the time transformation coefficients φ. Taking advantage of the fact that these quantities have compact support T = [t0 − ∆, tn + ∆], we implement a Metropolis–Hastings sampler (Hastings 1970) by considering appropriately scaled transition kernels q(φold , φnew ). Taking into account that φiq < φi(q+1) , (∀ i = 1, ..., N, q = 1, ..., Q), we can implement an efficient sampler by considering simple proposal densities of the form new old 2 q(φold iq , φiq ) = N (φiq , siq )I{M},

(17)

where M denotes the appropriate compact support satisfying (6) and (7), and siq = s = (tn − t0 + 2∆)/2(Q + 1). During the MCMC simulation, for each set of individual-specific 14

time transformation coefficients, we start from s and re–calibrate the individual proposal standard deviations siq at burn in to achieve an acceptance rate between 35% and 65% (Roberts and Rosenthal 2001). The construction of efficient transition kernels that generating good candidate values for the shape parameters ν, the modal parameter ν ∗ and the amplitude dispersion b0 is, in general, more difficult (Gamerman 1998). Fortunately, these parameters are shared between individuals and we can afford (computationally) to construct good approximations to their conditional posterior density via Slice sampling (Neal 2003). The use of a Slice sampler is particularly appealing for the exploration of conditional posterior quantities like ν ∗ , for which one cannot guarantee unimodality of the posterior. Our slice sampling scheme follows the algorithm suggested by Neal (2003). Let π(x) denote a target distribution (in our case, a complete conditional posterior density). Given a current value x, a slice level c is proposed uniformly from the interval [0, π(x)]. Given x and c, we seek the smallest random interval [s1 , s2 ] such that π(s1 ) < c and π(s2 ) < c, via random expansions of size w constructed around the current value x. Given the slice [s1 , s2 ], we generate a proposal x0 ∼ U (s1 , s2 ). If π(x0 ) > c, then x0 is retained as the new state, otherwise we shrink the slice [s1 , s2 ] to the larger of the two intervals [x0 , s2 ] or [s1 , x0 ]. A new proposal value is drawn uniformly from the new slice until the candidate state has density higher than the slice level c. Any rejection will correspond to further shrinkage of the proposal interval. This procedure allows for the construction of efficient transition kernels at the price of having to evaluate the target density multiple times, over a random range of values.

15

3.2 Posterior Inference from MCMC samples Given M draws from the posterior distribution of θ, we can derive posterior summaries for any function of θ. In this section, we discuss general summaries of interest, including the common shape function and functions that are appropriate for unimodal natural behavioral curves such as age of peak activity. (j)

Let β (j) , φi

(j)

and ai , be the j th MCMC draw from P (θ | Y). The j th posterior draw

for a subject-specific expected crime count mi (ai , φi , β, t) = ai m(µi (t, φi ), β), evaluated at time t, can be obtained from Equation (2) using the representation in Section 2.2 as: (j)

(j)

(j)

mi (ai , φi , β, t) = ai Sm {Sµ (t)0 φi }0 β (j) ,

j = 1, ..., M.

(18)

(j)

Posterior draws mi (ai , φi , β, t) can be used to approximate the posterior distribution of (j)

the age of peak activity. In particular, given mi (ai , φi , β, t) evaluated over a fine grid of time points in T = [t0 , tn ], a discrete approximation to a draw from the posterior distribution of peak activity P (tˆi | Y), is simply defined as (j) (j) (j) tˆi = {t ∈ T : mi (ai , φi , β, t) > mi (ai , φi , β, x), ∀x ∈ T }, j = 1, ..., M.

(19)

Another function of θ of interest in our analysis is the natural crime curve m(a, ¯ φ, β, t), representing the expected population–level crime count at time t. This function coincides with the marginal expectation of the common shape function m(t, β), integrating out the (j)

random amplitudes ai and time transformation functions µi (t, φi ), for i = 1, ..., N . Let a0 , be the j th draw from the average amplitude parameter a0 . Then a draw from the marginal posterior distribution of m(a, ¯ φ, β, t) may be obtained as follows: (j)

m ¯ (j) (a, φ, β, t) = a0 Sm {Sµ (t)0 Υ}0 β (j) ,

j = 1, ..., M.

(20)

Given M posterior draws from the functions of interest, say f (·), we can obtain 100(1−α)% credible intervals. More precisely, given a fine grid of time points in T = [t0 , tn ], we can 16

obtain a posterior sample from the function of interest as described, and calculate pointwise summaries such as average curve values and 100(1 − α)% HPD intervals using the method described by Chen and Shao (1999). 4 Case Study 4.1 Background We consider a longitudinal study of delinquency and drug use in high risk neighborhoods in Denver. The Denver Youth Survey (DYS) (e.g., Esbensen and Huizinga 1990) identified high delinquency risk neighborhoods via a cluster analysis of census variables such as family structure, ethnicity, SES, housing, mobility, marital status, and age composition. High risk neighborhoods were then defined as the top third in terms of high social disorganization and high official crime rates. The investigators selected 20,300 households, based on vacancy and completion rates, drew a stratified probability sample, proportional to population size, and used a screening questionnaire to identify five child and youth cohorts (i.e., 7, 9, 11, 13 or 15 years old). The overall procedure yielded a sample of 1,528 respondents (for details see Matsueda et al. (2006); Esbensen and Huizinga (1990)). Of these respondents, 1,459, who were aged 11 years or older for at least one interviewed year, completed a youth questionnaire with drug-use items. This sampling strategy implies that our inferences are restricted to the population of youth residing in high risk Denver neighborhoods. Subjects were interviewed in their homes annually from 1988-1992 and 1995-1999 (10 waves). Due to substantial attrition at the final interview (40% of respondents lost at Wave 10 - 1999), we did not include this wave in our analyses. We restrict our analysis to marijuana users who had at least four, not necessarily consec-

17

utive, observations during the course of the study 3 . We define marijuana users as those who reported smoking marijuana at least once. Removing 867 non-users and 22 marijuana users who had less than four observed time-points, we identify a subset of 570 marijuana offenders who were observed during at least four, not necessarily consecutive, years. Our inferences are based on 10,000 (thinned by 5) samples from the posterior distribution, after discarding (a conservative) 50,000 iterations for burn–in. For each individual, unobserved yearly counts of marijuana smoking between ages 10 and 25 are imputed by simulating from the predictive distribution of the individual trajectories P (yi (t)(mis) | Y(obs) ) at each iteration. Here, we use the same imputation scheme for time points that were missing due to the studys enrollment and for intermittent time points missing for other reasons. Thus, our imputation scheme assumes that the intermittent time points are missing at random. 4.2 Results The individual lifetime profiles of marijuana use are reported in Figure 2, panel (a). We monitor the use of marijuana, for each individual, in an interval between t0 = 10 and tn = 25 years of age. In our sample, we have between 4 and 9 person-year observations on each person, with a mean of 7.39 (SD = 1.37) observations per subject during the study period. The survey question asked “In the past year, how many times have you smoked marijuana?” The frequency of marijuana use is highly volatile. On average, marijuana smokers in our sample smoked marijuana 42.85 times per year with SD = 133.33 and a maximum reported count of yearly marijuana smoking 999. One commonly reported quantity of marijuana use over the last year (365 times) corresponds to the ‘once a day’ frequency of smoking. We fit the model introduced in Section 2 using 14 basis functions for the common shape 3

The addition of shorter time series should not affect the population estimates, although posterior inference on subjects with less then 4 records can be misleading due to weak identifiability of the subject level parameters.

18

curve, defined on the extended time interval [t0 − ∆, tn + ∆], and 5 basis functions for the individual random time transformations. The misalignment window ∆ can be interpreted as the maximal size of a linear shift. A natural constraint for the size of ∆ is given by the half width of the time domain (tn − t0 )/2, but more stringent values may be justified in order to avoid degeneracies in the time transformation functions. In our application, we choose a more conservative ∆ = 3, which is obtained by rounding the average distance between the ages of maximal use and the average age of maximal use. For the common shape function, 14 bases correspond to 10 interior knots, obtained considering (21 = 15 + 6) sampling times in the extended interval and dividing by 2. The time transformation functions are modeled as two piecewise cubic monotone functionals, with continuous second derivative in the middle of the sampling design. This amounts to the selection of one interior knot placed at age 17.5. We place relatively diffuse G(1, 0.1) priors on the shape precision 1/σβ2 and time transformation precision 1/σφ2 . We also place a G(11, 10) prior on the average amplitude parameter a0 , so that the we maintain a prior mode of 1 with small variance on the mean amplitude, √ but we allow for high variability in the prior distribution of the coefficient of variation 1/ b0 , placing a diffuse G(0.1, 10) prior on b0 . In Figure 2, panel (c), we report the posterior median estimates of the individual amplitude parameters, with associated 95% highest posterior density (HPD) credible intervals. Panel (d), Figure 2, shows the posterior expected estimates of the time transformation functions, characterizing the subject–specific timing of offense. We highlight a random sample of 25 individual curves in black ink to illustrate subject-specific examples, and show the rest of the curves in light grey to illustrate between-individual variation. Figure 2, panel (b), shows normalized reported frequencies of drug use for all individuals. We obtained these quantities by dividing observed yearly counts for individual i by the expected posterior amplitude E(ai | Y), and evaluating the normalized frequency on the in19

verse transformed time scale E(µ−1 i (t, φi ) | Y). We superimpose normalized reported counts with the posterior median estimate of the natural crime curve m(t, β) and associated 95% HPD intervals. This figure clearly shows how a typical pattern of drug use sees an average subject starting to use marijuana during puberty, continuing with higher intensity through college age, and then dropping off after reaching twenty. This pattern is generally consistent with the claims of Hirschi and Gottfredson (1983) about the age-crime curve, although perhaps the increase from childhood is less precipitous and the decline more precipitous. Our model allows for estimation of subject–specific expected crime trajectories. In Figure 3 we report expected lifetime frequencies of marijuana use for a random subsample of six subjects in the DYS. Observed yearly counts of marijuana use are plotted as black dots. The predicted frequencies of offenses are plotted as a solid line and the dashed lines represent pointwise 95% HPD credible intervals. This figure shows how our formulation appears to provide a remarkable explanatory capability in fitting individual profiles. Based on information that is shared across subjects, this modeling framework allows for individual-specific predictions for all time points within time interval T , including those points where the individual did not have observations. Wider credible bands during years 17-25 for subject [2,1] in Figure 3 illustrate higher uncertainty in model predictions where no subject–specific data is available. Finally, in Figure 4 we analyze the pattern of maximal drug use by considering posterior estimates of the ages of maximum marijuana consumption. In panel (a), we plot the subjectspecific posterior median ages of maximal drug use, with associated 95% HPD credible intervals. Panel (b) shows a density estimate for the median ages of maximal drug use in the DYS sample. These pictures show how most individuals reach their highest consumption of marijuana after puberty and increasingly during the college years, confirming the result in Figure 2, part (b). 20

5 Discussion In this article we propose a generalized unimodal warping regression method for the analysis of longitudinal crime data. Our model assumes that the main components of variation characterizing individual crime trajectories are associated with intensity and phase (timing) of offenses. More precisely, we assume that subject–specific expected patterns of offenses arise from a natural crime curve, assumed to be weakly unimodal, evaluated over a random individual-specific time transformation scale, and with random individual-specific amplitude. Our model provides very reasonable predictions of drug use through the early adult years for marijuana smokers from the Denver Youth Survey. Our analyses draw on the substantive arguments of Hirschi and Gottfredson (1983) about the properties of the age-crime curve. Behavioral trajectories predicted by our model appear to fit individual crime patterns well. Our semi-parametric regression warping method allows for more flexibility in predicted individual trajectories relative to polynomial-based trajectory and latent-group trajectory models. The modeling framework presented in this article could be extended in different directions. While this is beyond the scope of this paper, it would be important to understand how criminal behavior changes in association with covariate information. For example, do individual departures from a natural crime curve correspond to changes in life course transitions, such as high school dropout, entrance into college, parenthood, and entrance into the labor force? Another important extension is related to the identification of different groups of offenders. A voluminous literature has arisen using mixture models to identify latent classes of offenders, and test whether distinct etiologies apply to chronic offenders versus adolescence-limited offenders (e.g., Nagin and Tremblay 2005b, Nagin and Tremblay 2005a, Fergusson et al. 2000, D’Unger et al. 1998, Nagin et al. 1995, Nagin and Land 1993).

21

A mixture reformulation of our model would, for example, allow for the classification of a variety of criminal behaviors, from intensity of offense, to typical offending ages, to different shapes of the natural crime curve. Moreover, given the flexibility and good fit of our model to individual data, this approach may provide more accurate classifications of individual trajectories, and thereby potentially help resolve recent controversies over the substantive utility of group-modeling of trajectories (see Sampson and Laub 2005; Nagin and Tremblay 2005). References Brumback, L. C. and M. J. Lindstrom (2004). Self modeling with flexible, random time transformations. Biometrics 60 (2), 461–470. Chen, M. H. and Q. M. Shao (1999). Monte carlo estimation of bayesian credible and hpd intervals. Journal of Computational and Graphical Statistics 8 (9), 69–92. De Boor, C. (1978). A Practical Guide to Splines. Berlin: Springer-Verlag. D’Unger, A. V., K. C. Land, P. L. McCall, and D. S. Nagin (1998). How many latent classes of delinquent/criminal careers? results from mixed poisson regression analyses. American Journal of Sociology 103, 1593–1630. Elliott, D. S., D. Huizinga, and S. S. Ageton (1985). Explaining Delinquency and Drug Use. Beverly Hills: Sage Publications. Esbensen, F.-A. and D. Huizinga (1990). Community structure and drug use: From a social disorganization perspective. Justice Quarterly 7, 691–709. Fergusson, D. M., L. J. Horwood, and D. S. Nagin (2000). Offending trajectories in a new zealand birth cohort. Criminology 38, 525–551. Fris´en, M. (1986). Unimodal regression. The Statistician 35, 479–485. Gamerman, D. (1997). Markov Chain Monte Carlo: Stochastic Simulation for Bayesian Inference. Chapman & Hall Ltd.

22

Gamerman, D. (1998). Markov chain monte carlo for dynamic generalized linear models. Biometrika 85 (1), 215–227. Gelfand, A. E. and A. F. Smith (1990). Sampling based approaches to calculating marginal densities. Journal of the American Statistical Association 85, 398–409. Gervini, D. and T. Gasser (2004). Self-modelling warping functions. Journal of the Royal Statistical Society, Series B: Statistical Methodology 66 (4), 959–971. Glueck, S. and E. Glueck (1950). Unraveling Juvenile Delinquency. New York: The Commonwealth Fund. Gottfredson, M. and T. Hirschi (1990). A General Theory of Crime. Stanford, CA : Stanford University Press. Harris, K. M., F. Florey, J. Tabor, P. S. Bearman, J. Jones, and J. R. Udry (2003). The National Longitudinal Study of Adolescent Health: Research Design. WWW document. URL: http://www.cpc.unc.edu/projects/addhealth/design. Hastings, W. K. (1970). Monte carlo sampling using markov chains and their applications. Biometrika 57, 97–109. Hirschi, T. and M. R. Gottfredson (1983). Age and the explanation of crime. American Journal of Sociology 89, 552–548. Lang, S. and A. Brezger (2004). Bayesian P-splines. Journal of Computational and Graphical Statistics 13 (1), 183–212. Matsueda, R. L., D. A. Kreager, and D. Huizinga (2006). Deterring delinquents: A rational choice model of theft and violence. American Sociological Association 71, 95–122. Moffitt, T. E. (1993). Adolescence-limited and life-course-persistent antisocial behavior: A developmental taxonomy. Psychological Review 100, 674–701. Muth´en, S. and K. Shedden (1999). Finite mixture modeling with mixture outcomes using the em algorithm. Biometrics 55, 463–469. Nagin, D. S. (2005). Grouped-Based Modeling of Development. Cambridge, MA: Harvard University Press. 23

Nagin, D. S., D. P. Farrington, and T. D. Moffitt (1995). Life-course trajectories of different types of offenders. Criminology 33, 111–139. Nagin, D. S. and K. C. Land (1993). Age, criminal careers, and population heterogeneity: Specification and estimation of a nonparametric, mixed poisson model. Criminology 31, 327–362. Nagin, D. S. and R. E. Tremblay (2005a). Developmental trajectory groups: Fact or useful statistical fiction? Criminology 43, 873–904. Nagin, D. S. and R. E. Tremblay (2005b). What has been learned from group-based trajectory modeling? examples from physical aggression and other problem behaviors. The Annals of the American Academy of Political Social Science 602, 82–117. Neal, R. M. (2003). Slice sampling. Annals of Statistics 31, 705–767. Pe˜ na, J. (1997). B−splines and optimal stability. Mathematics of Computation 66, 1555– 1560. Ramsay, J. O. and X. Li (1998). Curve registration. Journal of the Royal Statistical Society, Series B: Statistical Methodology 60, 351–363. Ramsay, J. O. and B. W. Silverman (2002). Applied Functional Analysis: Methods and Case Studies. New York: Springer-Verlag. Rice, J. A. and B. W. Silverman (1991). Estimating the mean and covariance structure nonparametrically when the data are curves. Journal of the Royal Statistical Society, Series B: Methodological 53, 233–243. Roberts, O. R. and J. S. Rosenthal (2001). Optimal scaling of various metropolis–hastings algorithms. Statistical Science 16 (4), 351–367. Roeder, K., K. G. Lynch, and D. S. Nagin (1999). Modeling uncertainty in latent class membership: A case study in criminology. Journal of the American Statistical Association 94, 766–776. Sampson, R. J. and J. H. Laub (1993). Crime in the Making: Pathways and Turning Points Through the Life Course. Cambridge, MA: Harvard University Press.

24

Sampson, R. J. and J. H. Laub (2005). A life-course view of the development of crime. Annals of the American Academy of Political and Social Science 602, 12–45. Schumaker, L. L. (1981). Spline Functions. Basic Theory. New York : John Wiley & Sons. Shi, M., R. E. Weiss, and J. M. G. Taylor (1996). An analysis of paediatric CD4 counts for acquired immune deficiency syndrome using flexible random curves. Applied Statistics 45, 151–163. Telesca, D. and L. Y. T. Inoue (2008). Bayesian hierarchical curve registration. Journal of the American Statistical Association 103 (481), 328–339. Tienry, L. (1994). Markov chains for exploring posterior distributions. The Annals of Statistics 1994 (22), 1701–1728. Yao, F., H. . J. M¨ uller, and J. L. Wang (2005). Functional data analysis of sparse longitudinal data. JASA 100 (470), 577–590.

25

Appendix 1: Full Conditional Distributions Amplitude parameters ai :

Given a0 and b0 , for all individuals i = 1, ..., N , the am-

plitude parameters have independent prior density P (ai | s, r) ∝ as−1 exp{−r ai }, with i shape s = b0 and rate r = b0 /a0 . The conditional posterior distribution for the ith amplitude can be written as P (ai | Y, θ \ai ) ∝ P (Yi | ai , β, σβ2 , σφ2 )P (ai | s, r), with P (Yi | Qni yi (tij ) exp{−ai m(µi (tij , φi ), β)}. It is easy to shows that: P (ai | ai , β, σβ2 , σφ2 ) ∝ j=1 ai P s∗ −1 Y, θ \ai ) ∝ ai i exp{−ri∗ ai }, a Gamma random variable with shape s∗i = s + j yi (tj ) P and rate ri∗ = r + j m(µi (tj , φi ), β). Average amplitude parameter a0 :

From Section 2.3, we have that E(ai | a0 , b0 ) = a0

and P (a0 | α, γ) ∝ (1/a0 )(α+1) exp{−γ/a0 }. Given the subject–specific amplitude parameter vector a = (a1 , ..., aN )0 , the conditional posterior density of a0 can be written as P (a0 | Y, θ \a0 ) = P (a | θ \(a,a0 ) ) ∝ P (a | a0 , b0 )P (a0 | α, β), where P (a | a0 , b0 ) ∝ P PN (α+1) exp{−b0 /a0 N a }. It follows immediately that P (a | Y, θ ) ∝ (1/a ) exp{−(b i 0 0 0 \a 0 i=1 i=1 ai + P γ)/a0 }, an inverse gamma random variable with shape α and rate (b0 ai + γ). Shape smoothing parameter σβ2 :

For ease of notation we define the shape preci(a −1)

sion hβ = 1/σβ2 . From Section 2.3 we have that P (hβ | aβ , bβ ) ∝ hβ β

exp{−bβ hβ }.

Given the shape parameters ν, the conditional posterior density of hβ can be written as K/2

P (hβ | Y, θ \hβ ) ∝ P (ν | hβ )P (hβ | aβ , bβ ), where P (ν | hβ ) ∝ hβ

exp{−hβ /2 ν 0 Ων} and

Ω is the banded concentration structure arising from a second order random walk, given (a∗ −1)

ν0 = ν1 = 0. It is trivial to show that: P (hβ | Y, θ \hβ ) ∝ hβ β

exp{−b∗β hβ }, corresponding

to the density function of a Gamma random variable with shape a∗β = aβ + K/2, and rate b∗β = bβ + ν 0 Ων/2. Time transformation smoothing parameter σφ2 :

For ease of notation we define the

time transformation precision hφ = 1/σφ2 . From Section 2.3 we have P (hφ | aφ , bφ ) ∝ 26

a −1

hφφ exp{−bφ hφ }. Given the matrix of time transformation coefficients φ, the conditional posterior density of hφ can be written as P (hφ | Y, θ \hφ ) ∝ P (φ | Υ, hφ )P (hφ | aφ , bφ ), where Q Q/2 P (φ | Υ, hφ ) ∝ N exp{−hφ /2 (φi − Υ)0 Ξ(φi − Υ)} and Ξ is a banded concentration i=1 hφ structure arising from a first order random walk, given (φi0 − Υ0 ) = 0 for all i = 1, ..., N . a∗ −1

It easily follows that P (hφ | Y, θ \hφ ) ∝ hφφ exp{−b∗φ hφ }, a Gamma random variable with P 0 shape a∗φ = aφ + N × Q/2, and rate b∗φ = bφ + 1/2 × N i=1 (φi − Υ) Ξ(φi − Υ).

27

7

30

5 4 3

a = 0.6 2

Function Value

20 15

a=1

0

5

1

10

Stochastic Time

25

6

a = 1.5

10

(a)

15

20

25

10

Physical Time

(b)

15

20

25

Physical Time

Figure 1: Example. Panel (a): Time transformation functions µi (t). Panel (b): Composite trajectories ai m{µi (t)}.

28

140 120 100 80 60 40 0

0

15

20

10

25

Age

(b)

15

20

25

Transformed Age

20 15

0

10

100

200

300

Stochastic Age

400

500

25

(a)

Subject Index

20

Normalized Marijuana Use

1000 800 600 400 200

Marijuana Use

10

−4

(c)

−2

0

2

4

10

6

Log Amplitude

(d)

15

20

25

Physical Age

Figure 2: Drug Use (Marijuana). Panel (a): Yearly count for the use of marijuana for 570 subjects from the DYS. Panel (b): Average natural crime curve m(a, ¯ φ, β) with pointwise 95% HPD credible intervals. Panel (c): Subject–specific posterior amplitude with associated 95% HPD credible intervals. Panel (d): Subject-specific time scale, characterized by the expected posterior time transformation functions.

29

Marijuana Use

0

0

20

10

20

30

100 80 60 40

Marijuana Use

10

15

20

25

10

15

20

25

20

25

20

25

Age

30 0

0

20

10

20

Marijuana Use

100 80 60 40

Marijuana Use

40

120

50

140

Age

10

15

20

25

10

15

Age

80 60 20

40

Marijuana Use

20 15 10

0

0

5

Marijuana Use

25

100

Age

10

15

20

25

10

Age

15

Age

Figure 3: Drug Use (Marijuana). Lifetime marijuana use profiles for six random subjects (points). For each profile, the solid line represents the median posterior expected count and the dot–dashed lines represent the associated 95% pointwise HPD credible bands.

30

0.20

Density

0.10

0.15

500 400 300

0.05

200 0

0.00

100

Subject Index

12

(a)

14

16

18

20

22

24

26

10

Age of Maximal Use

15

20

25

Posterior Median Age of Maximal Use

(b)

Figure 4: Age of Maximal Drug Use (Marijuana). Panel (a): Posterior median estimate for the individual ages of maximal us of marijuana, with associated 95% HPD credible intervals. Panel (b): Distribution of the posterior median estimate for the age of maximal marijuana use in the DYS sample.

31

Hierarchical Poisson Registration of Longitudinal ...

Hirschi and Gottfredson (1983) injected controversy in criminology when they ... multiple latent classes, specifies individual trajectories to be polynomial in age, ...

421KB Sizes 0 Downloads 239 Views

Recommend Documents

Bayesian Hierarchical Curve Registration
The analysis often proceeds by synchronization of the data through curve registration. In this article we propose a Bayesian hierarchical model for curve ...

Bayesian Hierarchical Curve Registration
c ) and ai ∼ N(a0;σ2 a ) ×. I{ai > 0}, thus defining curve-specific random linear transfor- mations. ..... http://www.uwm.edu/%7Egervini/programs.html) for the.

The Failure of Poisson Modeling -
The Failure of Poisson Modeling. John Blesswin. Page 2. Outline. • Introduction. • Traces data. • TCP connection interarrivals. • TELNET packet interarrivals.

Poisson 1827.pdf
Page 1 of 4. ANNALES_. DE. CHIMIE ET DE PHYSIQUE,. Par MM. GAY-LUSSAC et AHAGO. TOME TRENTE-CINQULEME. A PARIS_. Chez CROCIJ:ARD. Libra ire, cloitre Saint-Benoit. D0 I(>' . pres Ia rue des Mathnrins. 18 2 7·. Page 1 of 4 ...

Information Aggregation in Poisson-Elections
Nov 28, 2016 - The modern Condorcet jury theorem states that under weak conditions, elections will aggregate information when the population is large, ...

ESTIMATION OF CAUSAL STRUCTURES IN LONGITUDINAL DATA ...
in research to study causal structures in data [1]. Struc- tural equation models [2] and Bayesian networks [3, 4] have been used to analyze causal structures and ...

Stein's method and Normal approximation of Poisson ... - Project Euclid
tion) kernel on Zp+q−r−l, which reduces the number of variables in the product ..... Now fix z ∈ Z. There are three possible cases: (i) z /∈ A and z /∈ B, (ii) z ∈ A,.

On Outage Capacity of MIMO Poisson Fading Channels
Free space optics is emerging as an attractive technology for several applications ... inexpensive components, seamless wireless extension of the optical fiber ...

Local Semi-Parametric Efficiency of the Poisson Fixed ...
Jun 7, 2016 - tor which takes advantage of the assumptions of Poisson distribution and independent draws over time to derive a conditional distribution of the dependent variable that does not depend on the distribution of unobserved heterogeneity. In

Validation of Poisson-Boltzmann Electrostatic Potential ...
Relationships) study was performed on five diverse data sets that have been .... The first data set is the steroid data set of Cramer et al., upon which the CoMFA ...

On Outage Capacity of MIMO Poisson Fading Channels
∗Department of Electrical and Computer Engineering. University of ... mile connectivity, fiber backup, RF-wireless backhaul and enterprise connectivity [10].

Longitudinal project.pdf
Page 1 of 1. Longitudinal project.pdf. Longitudinal project.pdf. Open. Extract. Open with. Sign In. Main menu. Displaying Longitudinal project.pdf. Page 1 of 1.

FanLens: Dynamic Hierarchical Exploration of Tabular Data
Keywords: Tabular data visualization, dynamic hierarchy specifi- cation, radial .... The large angle of Pacific Divison guides us to explore it and find the team ...

Percolation in the vacant set of Poisson cylinders
∗The Weizmann Institute of Science, Faculty of Mathematics and Computer Science, .... B2 and turns out not to be problematic by a suitable choice of an). Of course, ... For A ⊆ Rd and t > 0, we define the t-neighborhood of A as the open set.

FanLens: Dynamic Hierarchical Exploration of Tabular Data
Keywords: Tabular data visualization, dynamic hierarchy specifi- cation, radial space-filling visualization, fisheye distortion. 1 INTRODUCTION. Tabular data is ...

Variational Hierarchical Community of Experts
Such auto-encoder style inference ... we show some preliminary results of HCE by training on .... variational lower bound into a auto-encoder like structure,.

Hierarchical Decomposition.pdf
Page 2 of 24. 2. Background. • Functional decomposition of models (1993). • Hierarchical modules (2005). – Many systems naturally hierarchical. – Easier to ...

Hierarchical networks
quantitative information we introduce a threshold T to convert the correlation matrix into ... similarity between this picture and the one obtained by plotting the ... 1 We refer the interested reader to http://www.ffn.ub.es/albert/synchro.html, wher

Registration of FIR.pdf
MUNICIPAL CORPORATION OF GREATER MUMBAI HOSPITAL. EXT.P2 TRUE COPY OF THE ARREST MEMO DATED 18.6.2015. EXT.P3 TRUE COPY OF THE OCCURRENCE REPORT DATED 18.6.2015. SUBMITTED BEFORE THE COURT BY RESPONDENT NO.2. EXT.P4 TRUE COPY OF THE ORDER SHEET ...

Remarks on Poisson actions - Kirill Mackenzie
Jan 29, 2010 - Abstract. This talk sketches an overview of Poisson actions, developing my paper 'A ... And there is an infinitesimal action of g∗ on G. Namely, any ξ ∈ g∗ ..... That is, it is T∗M pulled back to P over f . As a Lie algebroid

Hierarchical networks
systems, and in particular the paradigmatic analysis of large populations of coupled oscillators. [6–8]. The connection between ... a large variety of synchronization patterns and sufficiently flexible to be adapted to many different contexts [10].