A Dynamic Kernel Logit Model for the Analysis of Longitudinal Discrete Choice Data: Properties and Computational Assessment

Srinivasan, Karthik K.; Mahmassani, Hani S.
May 2005
Transportation Science;May2005, Vol. 39 Issue 2, p160
Academic Journal
This paper focuses on the application of the kernel logit formulation to model dynamic discrete choice data. A dynamic kernel logit (DKL) formulation with normal errors is presented to model unordered discrete choice panel data. Investigating the theoretical foundations of the kernel logit model, it is demonstrated that the mixed logit error structure converges in distribution asymptotically to a suitable multivariate normal error structure. This result provides support for both cross-sectional kernel logit (CKL) and DKL models with normal errors. The calibration, identification, and specification issues associated with the latter model are also discussed. The performance of the proposed DKL model is assessed from the perspective of computational efficiency and estimate accuracy relative to the multinomial probit (MNP) model using a series of numerical experiments. Complexity analysis reveals that the DKL has a lower computational complexity than the MNP frequency simulator, which has an exponential complexity. Thus, for choice situations with a large number of alternatives J in each time period, and/or large number of time periods (T), the DKL model is faster than the corresponding MNP by more than an order of magnitude. This is also confirmed by computational experiments conducted using 32 synthetic data sets. The computational performance of the DKL relative to MNP appears to be the result of a trade-off between the number of Monte-Carlo draws required, and the computational cost of each draw. With fewer than 25 alternatives (JT), the results suggest that it is more advantageous to use the probit model (MNP)compared to the DKL. There appears to be little advantage in applying the kernel logit formulation relative to the MNP to cross-sectional data with a few alternatives. Regarding computational accuracy,the numerical results suggest that the parameter estimates of both models (MNP and DKL) are comparable and close to the true values from which the data sets...


Related Articles

  • COMPUTING HIGH DIMENSIONAL INTEGRALS WITH MONTE CARLO METHODS. Todorov, Venelin // Journal Scientific & Applied Research;2016, Vol. 10, p11 

    High dimensional integrals are usually solved with Monte Carlo algorithms and quasi Monte Carlo algorithms. We are doing numerical testing which compare low discrepancy and Monte Carlo algorithms. It is well known that Sobol algorithm has some advantageous over the other low discrepancy...

  • The search for a flux-expansion divertor in TJ-II. Castejón, F.; López-Fraguas, A.; Tarancón, A.; Velasco, J. L. // AIP Conference Proceedings;11/2/2008, Vol. 1071 Issue 1, p29 

    The role of the divertor in a stellarator-based fusion reactor is discussed, making emphasis on the flux-expansion concept. In this context, the possibility of having a flux-expansion divertor in TJ-II is explored. As a first step, the three-dimensional map of the particle flux has been...

  • Do High Performance and Low Power Go Together? Fioravante, Janice // Securities Industry News;3/26/2007, Vol. 19 Issue 12, p16 

    The article focuses on the use of high-performance computing (HPC) in the financial industry. HPC has been used to run tasks such as Monte Carlo simulations but the physical limitations of semiconductors, such as heat, power consumption and space issues, hindered in the full integration of HPC...

  • Structure of interparticle space in great noncrystalline packings of Lennard-Jones atoms and its influence on diffusional mobility of admixture particles. Voloshin, V.; Naberukhin, Yu. // Journal of Structural Chemistry;Mar2006, Vol. 46 Issue 2, p264 

    Models of 100,000 atoms interacting with Lennard-Jones potential have been constructed using the Monte Carlo method at different densities and temperatures. In these models, the structure of empty space is investigated in which the test particle with a diameter smaller than the diameter of...

  • Monte Carlo simulations of hydrogen adsorption on the W(110) and Mo(110) surfaces. Petrova, N. V.; Yakovkin, I. N.; Ptushinskii, Yu. G. // European Physical Journal B -- Condensed Matter;Apr2004, Vol. 38 Issue 3, p525 

    Kinetics of low-temperature hydrogen and deuterium adsorption on W(110) and Mo(110) surfaces have been studied by the “real-time” Monte Carlo simulations. Recently reported qualitative dependence of the adsorption characteristics on variation of the H2 flux is described in terms of...

  • On a Monte Carlo method for neutron transport criticality computations. Maire, Sylvain; Talay, Denis // IMA Journal of Numerical Analysis;Oct2006, Vol. 26 Issue 4, p657 

    We give a stochastic representation of the principal eigenvalue of some homogeneous neutron transport operators. Our construction is based upon the Feynman–Kac formula for integral transport equations, and uses probabilistic techniques only. We develop a Monte Carlo method for criticality...

  • Estimation of the rate of water renewal in the ocean conveyor. Degterev, A. // Russian Meteorology & Hydrology;Jun2011, Vol. 36 Issue 6, p403 

    The imitating numerical model of the turbulent exchange between the ocean conveyor belt and the surrounding waters is proposed. The water particle exchange through the belt surface of the given size during its movement along the deep conveyor branch is considered. The length of the turbulent...

  • On the echo interference in sound backscattering by densely aggregated targets Gorska, Natalia; Chu, Dezhang // ICES Journal of Marine Science / Journal du Conseil;Jun2005, Vol. 62 Issue 4, p771 

    It is important to understand the volume backscattering by dense aggregations of a variety of scattering objects such as bubbles or biological targets. This paper addresses the interference of the echoes from randomly distributed targets. The main motivation of the paper is to understand the...

  • A MONTE CARLO SAMPLING PLAN FOR ESTIMATING NETWORK RELIABILITY. Fishman, George S. // Operations Research;Jul/Aug86, Vol. 34 Issue 4, p581 

    For an undirected network G = (V, E) whose arcs are subject to random failure, we present a relatively complete and comprehensive description of a general class of Monte Carlo sampling plans for estimating g = g(s. T). the probability that a specified node s is connected to all nodes in a node...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics