Search

In this paper, we provide a new routine to employ the Nash-Moser iteration technique to analyze the local and global properties of positive solutions to the equation $$\Delta_pv + a|\nabla v|^qv^r =0$$ on a complete Riemannian manifold with Ricci curvature bounded from below, where $p>1$, $q$, $r$ and $a$ are some real constants. Assuming certain conditions on $a,\, p,\, q$ and $r$, we can derive universal and succinct Cheng-Yau type logarithmic gradient estimates for such solutions. In particular, we give the obvious expressions of constants in the logarithmic gradient estimate for entire solutions to the above equation (see \thmref{t10}). The gradient estimates enable us to obtain some Liouville-type theorems, Harnack inequalities and some local estimates near singularities for positive solutions. Some of our results are new even in the case the domain is an Euclidean space and $p=2$.

Synthetic data generation is a powerful tool for privacy protection when considering public release of record-level data files. Initially proposed about three decades ago, it has generated significant research and application interest. To meet the pressing demand of data privacy protection in a variety of contexts, the field needs more researchers and practitioners. This review provides a comprehensive introduction to synthetic data, including technical details of their generation and evaluation. Our review also addresses the challenges and limitations of synthetic data, discusses practical applications, and provides thoughts for future work.

Suppose $\Omega_0,\Omega_1$ are two bounded strongly $\mathbb{C}$-convex domains in $\mathbb{C}^n$, with $n\geq 2$ and $\Omega_1\supset\overline{\Omega_0}$. Let $\mathcal{R}=\Omega_1\backslash\overline{\Omega_0}$. We call $\mathcal{R}$ a $\mathbb{C}$-convex ring. We will show that for a solution $\Phi$ to the homogenous complex Monge-Amp\`ere equation in $\mathcal{R}$, with $\Phi=1$ on $\partial\Omega_1$ and $\Phi=0$ on $\partial\Omega_0$, $\sqrt{-1}\partial\overline{\partial}\Phi$ has rank $n-1$ and the level sets of $\Phi$ are strongly $\mathbb{C}$-convex.

Probabilistic models such as logistic regression, Bayesian classification, neural networks, and models for natural language processing, are increasingly more present in both undergraduate and graduate statistics and data science curricula due to their wide range of applications. In this paper, we present a one-week course module for studnets in advanced undergraduate and applied graduate courses on variational inference, a popular optimization-based approach for approximate inference with probabilistic models. Our proposed module is guided by active learning principles: In addition to lecture materials on variational inference, we provide an accompanying class activity, an \texttt{R shiny} app, and guided labs based on real data applications of logistic regression and clustering documents using Latent Dirichlet Allocation with \texttt{R} code. The main goal of our module is to expose students to a method that facilitates statistical modeling and inference with large datasets. Using our proposed module as a foundation, instructors can adopt and adapt it to introduce more realistic case studies and applications in data science, Bayesian statistics, multivariate analysis, and statistical machine learning courses.

On a compact complex affine manifold with a constant coefficient K\"ahler metric $\omega_0$, we introduce a concept: $(S,\omega_0)$-convexity and show that $(S,\omega_0)$-convexity is preserved by geodesics in the space of K\"ahler potentials. This implies that if two potentials are both strictly $(S,\omega_0)$-convex, then the metrics along the geodesic connecting them are non-degenerate., Comment: 2 figures

In this paper we establish a positive lower bound estimate for the second smallest eigenvalue of the complex Hessian of solutions to a degenerate complex Monge-Amp\`ere equation. As a consequence, we find that in the space of K\"ahler potentials any two points close to each other in $C^2$ norm can be connected by a geodesic along which the associated metrics do not degenerate., Comment: 29 pages, 3 figures

The large number of publicly available survey datasets of wide variety, albeit useful, raise respondent-level privacy concerns. The synthetic data approach to data privacy and confidentiality has been shown useful in terms of privacy protection and utility preservation. This paper aims at illustrating how synthetic data can facilitate the dissemination of highly sensitive information about youth risk behavior by presenting a case study of synthetic data for a sample of the Youth Risk Behavior Survey (YRBS). Given the categorical nature of almost all variables in YRBS, the Dirichlet Process mixture of products of multinomials (DPMPM) synthesizer is adopted to partially synthesize the YRBS sample. Detailed evaluations of utility and disclosure risks demonstrate that the generated synthetic data are able to significantly reduce the disclosure risks compared to the confidential YRSB sample while maintaining a high level of utility.

In the intelligent communication field, deep learning (DL) has attracted much attention due to its strong fitting ability and data-driven learning capability. Compared with the typical DL feedforward network structures, an enhancement structure with direct data feedback have been studied and proved to have better performance than the feedfoward networks. However, due to the above simple feedback methods lack sufficient analysis and learning ability on the feedback data, it is inadequate to deal with more complicated nonlinear systems and therefore the performance is limited for further improvement. In this paper, a novel multi-agent feedback enabled neural network (MAFENN) framework is proposed, which make the framework have stronger feedback learning capabilities and more intelligence on feature abstraction, denoising or generation, etc. Furthermore, the MAFENN framework is theoretically formulated into a three-player Feedback Stackelberg game, and the game is proved to converge to the Feedback Stackelberg equilibrium. The design of MAFENN framework and algorithm are dedicated to enhance the learning capability of the feedfoward DL networks or their variations with the simple data feedback. To verify the MAFENN framework's feasibility in wireless communications, a multi-agent MAFENN based equalizer (MAFENN-E) is developed for wireless fading channels with inter-symbol interference (ISI). Experimental results show that when the quadrature phase-shift keying (QPSK) modulation scheme is adopted, the SER performance of our proposed method outperforms that of the traditional equalizers by about 2 dB in linear channels. When in nonlinear channels, the SER performance of our proposed method outperforms that of either traditional or DL based equalizers more significantly, which shows the effectiveness and robustness of our proposal in the complex channel environment.

This paper introduces a new method that embeds any Bayesian model used to generate synthetic data and converts it into a differentially private (DP) mechanism. We propose an alteration of the model synthesizer to utilize a censored likelihood that induces upper and lower bounds of [$\exp(-\epsilon / 2), \exp(\epsilon / 2)$], where $\epsilon$ denotes the level of the DP guarantee. This censoring mechanism equipped with an $\epsilon-$DP guarantee will induce distortion into the joint parameter posterior distribution by flattening or shifting the distribution towards a weakly informative prior. To minimize the distortion in the posterior distribution induced by likelihood censoring, we embed a vector-weighted pseudo posterior mechanism within the censoring mechanism. The pseudo posterior is formulated by selectively downweighting each likelihood contribution proportionally to its disclosure risk. On its own, the pseudo posterior mechanism produces a weaker asymptotic differential privacy (aDP) guarantee. After embedding in the censoring mechanism, the DP guarantee becomes strict such that it does not rely on asymptotics. We demonstrate that the pseudo posterior mechanism creates synthetic data with the highest utility at the price of a weaker, aDP guarantee, while embedding the pseudo posterior mechanism in the proposed censoring mechanism produces synthetic data with a stronger, non-asymptotic DP guarantee at the cost of slightly reduced utility. The perturbed histogram mechanism is included for comparison.

When releasing record-level data containing sensitive information to the public, the data disseminator is responsible for protecting the privacy of every record in the dataset, simultaneously preserving important features of the data for users' analyses. These goals can be achieved by data synthesis, where confidential data are replaced with synthetic data that are simulated based on statistical models estimated on the confidential data. In this paper, we present a data synthesis case study, where synthetic values of price and the number of available days in a sample of the New York Airbnb Open Data are created for privacy protection. One sensitive variable, the number of available days of an Airbnb listing, has a large amount of zero-valued records and also truncated at the two ends. We propose a zero-inflated truncated Poisson regression model for its synthesis. We utilize a sequential synthesis approach to further synthesize the sensitive price variable. The resulting synthetic data are evaluated for its utility preservation and privacy protection, the latter in the form of disclosure risks. Furthermore, we propose methods to investigate how uncertainties in intruder's knowledge would influence the identification disclosure risks of the synthetic data. In particular, we explore several realistic scenarios of uncertainties in intruder's knowledge of available information and evaluate their impacts on the resulting identification disclosure risks.

As a result of the increased emphasis on mis- and over-use of $p$-values in scientific research and the rise in popularity of Bayesian statistics, Bayesian education is becoming more important at the undergraduate level. With the advances in computing tools, Bayesian statistics is also becoming more accessible for the undergraduates. This study focuses on analyzing Bayesian courses for the undergraduates. We explored whether an undergraduate Bayesian course is offered in our sample of 152 high-ranking research universities and liberal arts colleges. For each identified Bayesian course, we examined how it fits into the institution's undergraduate curricula, such as majors and prerequisites. Through a series of course syllabi analyses, we explored the topics covered and their popularity in these courses, and the adopted teaching and learning tools, such as software. This paper presents our findings on the current practices of teaching full Bayesian courses at the undergraduate level. Based on our findings, we provide recommendations for programs that may consider offering Bayesian courses to their students.

In this paper, we study the problem of shock reflection by a wedge, with the potential flow equation, which is a simplification of the Euler System. In the work of M. Feldman and G. Chen, the existence theory of shock reflection problems with the potential flow equation was established, when the wedge is symmetric w.r.t. the direction of the upstream flow. As a natural extension, we study non-symmetric cases, i.e. when the direction of the upstream flow forms a nonzero angle with the symmetry axis of the wedge. The main idea of investigating the existence of solutions to non-symmetric problems is to study the symmetry of the solution. Then difficulties arise such as free boundaries and degenerate ellipticity, especially when ellipticity degenerates on the free boundary. We developed an integral method to overcome these difficulties. Some estimates near the corner of wedge is also established, as an extension of G.Lieberman's work. We proved that in non-symmetric cases, the ideal Lipschitz solution to the potential flow equation, which we call regular solution, does not exist. This suggests that the potential flow solutions to the non-symmetric shock reflection problem, should have some singularity which is not encountered in symmetric case.

Synthetic data is a promising approach to privacy protection in many contexts. A Bayesian synthesis model, also known as a synthesizer, simulates synthetic values of sensitive variables from their posterior predictive distributions. The resulting synthetic data can then be released in place of the confidential data. An important evaluation prior to synthetic data release is its level of privacy protection, which is often in the form of disclosure risks evaluation. Attribute disclosure, referring to an intruder correctly inferring the confidential values of synthetic records, is one type of disclosure that is challenging to be computationally evaluated. In this paper, we review and discuss in detail some Bayesian estimation approaches to attribute disclosure risks evaluation, with examples of commonly-used Bayesian synthesizers. We create the $\texttt{AttributeRiskCalculation}$ R package to facilitate its implementation, and demonstrate its functionality with examples of evaluating attribute disclosure risks in synthetic samples of the Consumer Expenditure Surveys., Comment: 34 pages, 17 figures

Recent research in differential privacy demonstrated that (sub)sampling can amplify the level of protection. For example, for $\epsilon$-differential privacy and simple random sampling with sampling rate $r$, the actual privacy guarantee is approximately $r\epsilon$, if a value of $\epsilon$ is used to protect the output from the sample. In this paper, we study whether this amplification effect can be exploited systematically to improve the accuracy of the privatized estimate. Specifically, assuming the agency has information for the full population, we ask under which circumstances accuracy gains could be expected, if the privatized estimate would be computed on a random sample instead of the full population. We find that accuracy gains can be achieved for certain regimes. However, gains can typically only be expected, if the sensitivity of the output with respect to small changes in the database does not depend too strongly on the size of the database. We only focus on algorithms that achieve differential privacy by adding noise to the final output and illustrate the accuracy implications for two commonly used statistics: the mean and the median. We see our research as a first step towards understanding the conditions required for accuracy gains in practice and we hope that these findings will stimulate further research broadening the scope of differential privacy algorithms and outputs considered.

We propose two synthetic microdata approaches to generate private tabular survey data products for public release. We adapt a pseudo posterior mechanism that downweights by-record likelihood contributions with weights $\in [0,1]$ based on their identification disclosure risks to producing tabular products for survey data. Our method applied to an observed survey database achieves an asymptotic global probabilistic differential privacy guarantee. Our two approaches synthesize the observed sample distribution of the outcome and survey weights, jointly, such that both quantities together possess a privacy guarantee. The privacy-protected outcome and survey weights are used to construct tabular cell estimates (where the cell inclusion indicators are treated as known and public) and associated standard errors to correct for survey sampling bias. Through a real data application to the Survey of Doctorate Recipients public use file and simulation studies motivated by the application, we demonstrate that our two microdata synthesis approaches to construct tabular products provide superior utility preservation as compared to the additive-noise approach of the Laplace Mechanism. Moreover, our approaches allow the release of microdata to the public, enabling additional analyses at no extra privacy cost.

In many contexts, missing data and disclosure control are ubiquitous and challenging issues. In particular at statistical agencies, the respondent-level data they collect from surveys and censuses can suffer from high rates of missingness. Furthermore, agencies are obliged to protect respondents' privacy when publishing the collected data for public use. The NPBayesImputeCat R package, introduced in this paper, provides routines to i) create multiple imputations for missing data, and ii) create synthetic data for statistical disclosure control, for multivariate categorical data, with or without structural zeros. We describe the Dirichlet process mixture of products of multinomial distributions model used in the package, and illustrate various uses of the package using data samples from the American Community Survey (ACS). We also compare results of the missing data imputation to the mice R package and those of the synthetic data generation to the synthpop R package.

We propose a two-phase synthesis process for synthesizing income, a sensitive variable which is usually highly-skewed and has a number of reported zeros. We consider two forms of a continuous income variable: a binary form, which is modeled and synthesized in phase 1; and a non-negative continuous form, which is modeled and synthesized in phase 2. Bayesian synthesis models are proposed for the two-phase synthesis process, and other synthesis models are readily implementable. We demonstrate our methods with applications to a sample from the National Health Interview Survey (NHIS). Utility and risk profiles of generated synthetic datasets are evaluated and compared to results from a single-phase synthesis process.

We extend a general approach to evaluating identification risk of synthesized variables in partially synthetic data. For multiple continuous synthesized variables, we introduce the use of a radius $r$ in the construction of identification risk probability of each target record, and illustrate with working examples. We create the $\texttt{IdentificationRiskCalculation}$ R package to aid researchers and data disseminators in performing these identification risks evaluation calculations. We demonstrate our methods through the R package with applications to a data sample from the Consumer Expenditure Surveys, and discuss the impacts on risk and data utility of 1) the choice of radius $r$, 2) the choice of synthesized variables, and 3) the choice of number of synthetic datasets. We give recommendations for statistical agencies for synthesizing and evaluating identification risk of continuous variables., Comment: 16 pages with 10 figures

We address practical implementation of a risk-weighted pseudo posterior synthesizer for microdata dissemination with a new re-weighting strategy that maximizes utility of released synthetic data under at any level of formal privacy guarantee. Our re-weighting strategy applies to any vector-weighted pseudo posterior mechanism under which a vector of observation-indexed weights are used to downweight likelihood contributions for high disclosure risk records. We demonstrate our method on two different vector-weighted schemes that target high-risk records. Our new method for constructing record-indexed downeighting maximizes the data utility under any privacy budget for the vector-weighted synthesizers by adjusting the by-record weights, such that their individual Lipschitz bounds approach the bound for the entire database. Our method achieves an $(\epsilon = 2 \Delta_{\boldsymbol{\alpha}})-$asymptotic differential privacy (aDP) guarantee, globally, over the space of databases. We illustrate our methods using simulated highly skewed count data and compare the results to a scalar-weighted synthesizer under the Exponential Mechanism (EM). We also apply our methods to a sample of the Survey of Doctorate Recipients and demonstrate the practicality of our methods.

For statistics courses at all levels, teaching and learning online poses challenges in different aspects. Particular online challenges include how to effectively and interactively conduct exploratory data analyses, how to incorporate statistical programming, how to include individual or team projects, and how to present mathematical derivations efficiently and effectively. This article draws from the authors' experience with seven different online statistics courses to address some of the aforementioned challenges. One course is an online exploratory data analysis course taught at Bowling Green State University. A second course is an upper level Bayesian statistics course taught at Vassar College and shared among 10 liberal arts colleges through a hybrid model. We alo describes a five-course MOOC specialization on Coursera, offered by Duke University.

Bayesian statistics has gained great momentum since the computational developments of the 1990s. Gradually, advances in Bayesian methodology and software have made Bayesian techniques much more accessible to applied statisticians and, in turn, have potentially transformed Bayesian education at the undergraduate level. This article provides an overview on the various options for implementing Bayesian computational methods motivated to achieve particular learning outcomes. The advantages and disadvantages of each computational method are described based on the authors' experience in using these methods in the classroom. The goal is to present guidance on the choice of computation for the instructors who are introducing Bayesian methods in their undergraduate statistics curriculum.

We propose a semester-long Bayesian statistics course for undergraduate students with calculus and probability background. We cultivate students' Bayesian thinking with Bayesian methods applied to real data problems. We leverage modern Bayesian computing techniques not only for implementing Bayesian methods, but also to deepen students' understanding of the methods. Collaborative case studies further enrich students' learning and provide experience to solve open-ended applied problems. The course has an emphasis on undergraduate research, where accessible academic journal articles are read, discussed, and critiqued in class. With increased confidence and familiarity, students take the challenge of reading, implementing, and sometimes extending methods in journal articles for their course projects.

We propose a Bayesian pseudo posterior mechanism to generate record-level synthetic databases equipped with an $(\epsilon,\delta)-$ probabilistic differential privacy (pDP) guarantee, where $\delta$ denotes the probability that any observed database exceeds $\epsilon$. The pseudo posterior mechanism employs a data record-indexed, risk-based weight vector with weight values $\in [0, 1]$ that surgically downweight the likelihood contributions for high-risk records for model estimation and the generation of record-level synthetic data for public release. The pseudo posterior synthesizer constructs a weight for each data record using the Lipschitz bound for that record under a log-pseudo likelihood utility function that generalizes the exponential mechanism (EM) used to construct a formally private data generating mechanism. By selecting weights to remove likelihood contributions with non-finite log-likelihood values, we guarantee a finite local privacy guarantee for our pseudo posterior mechanism at every sample size. Our results may be applied to \emph{any} synthesizing model envisioned by the data disseminator in a computationally tractable way that only involves estimation of a pseudo posterior distribution for parameters, $\theta$, unlike recent approaches that use naturally-bounded utility functions implemented through the EM. We specify mild conditions that guarantee the asymptotic contraction of $\delta$ to $0$ over the space of databases. We illustrate our pseudo posterior mechanism on the sensitive family income variable from the Consumer Expenditure Surveys database published by the U.S. Bureau of Labor Statistics. We show that utility is better preserved in the synthetic data for our pseudo posterior mechanism as compared to the EM, both estimated using the same non-private synthesizer, due to our use of targeted downweighting., Comment: 35 pages, 7 figures, 2 tables

Statistical agencies utilize models to synthesize respondent-level data for release to the public for privacy protection. In this work, we efficiently induce privacy protection into any Bayesian synthesis model by employing a pseudo likelihood that exponentiates each likelihood contribution by an observation record-indexed weight in [0, 1], defined to be inversely proportional to the identification risk for that record. We start with the marginal probability of identification risk for a record, which is composed as the probability that the identity of the record may be disclosed. Our application to the Consumer Expenditure Surveys (CE) of the U.S. Bureau of Labor Statistics demonstrates that the marginally risk-adjusted synthesizer provides an overall improved privacy protection; however, the identification risks actually increase for some moderate-risk records after risk-adjusted pseudo posterior estimation synthesis due to increased isolation after weighting; a phenomenon we label "whack-a-mole". We proceed to construct a weight for each record from a collection of pairwise identification risk probabilities with other records, where each pairwise probability measures the joint probability of re-identification of the pair of records, which mitigates the whack-a-mole issue and produces a more efficient set of synthetic data with lower risk and higher utility for the CE data.

Statistical agencies utilize models to synthesize respondent-level data for release to the general public as an alternative to the actual data records. A Bayesian model synthesizer encodes privacy protection by employing a hierarchical prior construction that induces smoothing of the real data distribution. Synthetic respondent-level data records are often preferred to summary data tables due to the many possible uses by researchers and data analysts. Agencies balance a trade-off between utility of the synthetic data versus disclosure risks and hold a specific target threshold for disclosure risk before releasing synthetic datasets. We introduce a pseudo posterior likelihood that exponentiates each contribution by an observation record-indexed weight in (0, 1), defined to be inversely proportional to the disclosure risk for that record in the synthetic data. Our use of a vector of weights allows more precise downweighting of high risk records in a fashion that better preserves utility as compared with using a scalar weight. We illustrate our method with a simulation study and an application to the Consumer Expenditure Survey of the U.S. Bureau of Labor Statistics. We demonstrate how the frequentist consistency and uncertainty quantification are affected by the inverse risk-weighting., Comment: This is to replace arXiv:1908.07639

The release of synthetic data generated from a model estimated on the data helps statistical agencies disseminate respondent-level data with high utility and privacy protection. Motivated by the challenge of disseminating sensitive variables containing geographic information in the Consumer Expenditure Surveys (CE) at the U.S. Bureau of Labor Statistics, we propose two non-parametric Bayesian models as data synthesizers for the county identifier of each data record: a Bayesian latent class model and a Bayesian areal model. Both data synthesizers use Dirichlet Process priors to cluster observations of similar characteristics and allow borrowing information across observations. We develop innovative disclosure risks measures to quantify inherent risks in the confidential CE data and how those data risks are ameliorated by our proposed synthesizers. By creating a lower bound and an upper bound of disclosure risks under a minimum and a maximum disclosure risks scenarios respectively, our proposed inherent risks measures provide a range of acceptable disclosure risks for evaluating risks level in the synthetic datasets.

In this paper we address the following question regarding the regularity of geodesics in the space of K\"ahler potentials. Given a geodesic which is highly regular, and has smooth boundary value, can we expect that it is actually smooth? We construct an example to show that the answer to the question is ``no"., Comment: 17 pages, 1 figure

We show that, given $k> 4$, $0

The synthetic data approach to data confidentiality has been actively researched on, and for the past decade or so, a good number of high quality work on developing innovative synthesizers, creating appropriate utility measures and risk measures, among others, have been published. Comparing to a large volume of work on synthesizers development and utility measures creation, measuring risks has overall received less attention. This paper focuses on the detailed construction of some Bayesian methods proposed for estimating disclosure risks in synthetic data. In the processes of presenting attribute and identification disclosure risks evaluation methods, we highlight key steps, emphasize Bayesian thinking, illustrate with real application examples, and discuss challenges and future research directions. We hope to give the readers a comprehensive view of the Bayesian estimation procedures, enable synthetic data researchers and producers to use these procedures to evaluate disclosure risks, and encourage more researchers to work in this important growing field.

We investigate whether generating synthetic data can be a viable strategy for providing access to detailed geocoding information for external researchers, without compromising the confidentiality of the units included in the database. Our work was motivated by a recent project at the Institute for Employment Research (IAB) in Germany that linked exact geocodes to the Integrated Employment Biographies (IEB), a large administrative database containing several million records. We evaluate the performance of three synthesizers regarding the trade-off between preserving analytical validity and limiting disclosure risks: One synthesizer employs Dirichlet Process mixtures of products of multinomials (DPMPM), while the other two use different versions of Classification and Regression Trees (CART). In terms of preserving analytical validity, our proposed synthesis strategy for geocodes based on categorical CART models outperforms the other two. If the risks of the synthetic data generated by the categorical CART synthesizer are deemed too high, we demonstrate that synthesizing additional variables is the preferred strategy to address the risk-utility trade-off in practice, compared to limiting the size of the regression trees or relying on the strategy of providing geographical information only on an aggregated level. We also propose strategies for making the synthesizers scalable for large files, present analytical validity measures and disclosure risk measures for the generated data, and provide general recommendations for statistical agencies considering the synthetic data approach for disseminating detailed geographical information.

We are concerned with the suitability of the main models of compressible fluid dynamics for the Lighthill problem for shock diffraction by a convex corned wedge, by studying the regularity of solutions of the problem, which can be formulated as a free boundary problem. In this paper, we prove that there is no regular solution that is subsonic up to the wedge corner for potential flow. This indicates that, if the solution is subsonic at the wedge corner, at least a characteristic discontinuity (vortex sheet or entropy wave) is expected to be generated, which is consistent with the experimental and computational results. Therefore, the potential flow equation is not suitable for the Lighthill problem so that the compressible Euler system must be considered. In order to achieve the non-existence result, a weak maximum principle for the solution is established, and several other mathematical techniques are developed. The methods and techniques developed here are also useful to the other problems with similar difficulties., Comment: 20 pages, 4 figures, To appear in: SIAM Journal of Mathematical Analysis, 2020

We present a Bayesian model for estimating the joint distribution of multivariate categorical data when units are nested within groups. Such data arise frequently in social science settings, for example, people living in households. The model assumes that (i) each group is a member of a group-level latent class, and (ii) each unit is a member of a unit-level latent class nested within its group-level latent class. This structure allows the model to capture dependence among units in the same group. It also facilitates simultaneous modeling of variables at both group and unit levels. We develop a version of the model that assigns zero probability to groups and units with physically impossible combinations of variables. We apply the model to estimate multivariate relationships in a subset of the American Community Survey. Using the estimated model, we generate synthetic household data that could be disseminated as redacted public use files with high analytic validity and low disclosure risks. Supplementary materials for this article are available online.

Let $e_\l(x)$ be a Neumann eigenfunction with respect to the positive Laplacian $\Delta$ on a compact Riemannian manifold $M$ with boundary such that $\Delta\, e_\l=\l^2 e_\l$ in the interior of $M$ and the normal derivative of $e_\l$ vanishes on the boundary of $M$. Let $\chi_\lambda$ be the unit band spectral projection operator associated with the Neumann Laplacian and $f$ a square integrable function on $M$. We show the following gradient estimate for $\chi_\lambda\,f$ as $\lambda\geq 1$: $\|\nabla\ \chi_\l\ f\|_\infty\leq C\l \|\chi_\l\f\|_\infty+\l^{-1}\|\Delta\ \chi_\l\ f\|_\infty$, where $C$ is a positive constant depending only on $M$. As a corollary, we obtain the gradient estimate of $e_\l$: for every $\l\geq 1$, there holds $\|\nabla e_\l\|_\infty\leq C\,\l\, \|e_\l\|_\infty$., Comment: Comments welcomed. Submitted