Paris Dauphine University

About: Paris Dauphine University is a education organization based out in Paris, France. It is known for research contribution in the topics: Context (language use) & Population. The organization has 1766 authors who have published 6909 publications receiving 162747 citations. The organization is also known as: Paris Dauphine & Dauphine.

Organizational Socialization Tactics and Newcomer Adjustment: The Moderating Role of Perceived Organizational Support

Abstract: Understanding and facilitating new hires' adjustment are critical to maximizing the effectiveness of recruitment and selection. The aim of the current study is to examine how organizational socialization tactics interact with perceived organizational support (POS) to influence socialization outcomes above and beyond proactive personality. Our sample consisted of 103 blue-collar apprentices from a well-established apprenticeship program that began in the Middle Ages in France. Using a time-lagged design, we surveyed apprentices in their first months of employment, while they were learning their trade (carpentry, roofing, and stone cutting). We found that POS significantly moderated the relationship between socialization tactics and three important socialization outcomes (learning the job, learning work-group norms, and role innovation), such that there was a positive relationship under low POS and a non-significant relationship under high POS. Unexpectedly, POS was negatively related to role innovation. Implications for the organizational socialization literature are discussed.

Constant Thresholds Can Make Target Set Selection Tractable

Abstract: Target Set Selection, which is a prominent NP-hard problem occurring in social network analysis and distributed computing, is notoriously hard both in terms of achieving useful polynomial-time approximation as well as fixed-parameter algorithms. Given an undirected graph, the task is to select a minimum number of vertices into a "target set" such that all other vertices will become active in the course of a dynamic process (which may go through several activation rounds). A vertex, equipped with a threshold value t, becomes active once at least t of its neighbors are active; initially, only the target set vertices are active. We contribute further insights into the existence of islands of tractability for Target Set Selection by spotting new parameterizations characterizing some sparse graphs as well as some "cliquish" graphs and developing corresponding fixed-parameter tractability and (parameterized) hardness results. In particular, we demonstrate that upper-bounding the thresholds by a constant may significantly alleviate the search for efficiently solvable, but still meaningful special cases of Target Set Selection.

Bayesian computation via empirical likelihood

Abstract: Approximate Bayesian computation has become an essential tool for the analysis of complex stochastic models when the likelihood function is numerically unavailable. However, the well-established statistical method of empirical likelihood provides another route to such settings that bypasses simulations from the model and the choices of the approximate Bayesian computation parameters (summary statistics, distance, tolerance), while being convergent in the number of observations. Furthermore, bypassing model simulations may lead to significant time savings in complex models, for instance those found in population genetics. The Bayesian computation with empirical likelihood algorithm we develop in this paper also provides an evaluation of its own performance through an associated effective sample size. The method is illustrated using several examples, including estimation of standard distributions, time series, and population genetics models.

Texture Synthesis with Grouplets

Abstract: This paper proposes a new method to synthesize and inpaint geometric textures. The texture model is composed of a geometric layer that drives the computation of a new grouplet transform. The geometry is an orientation flow that follows the patterns of the texture to analyze or synthesize. The grouplet transform extends the original construction of Mallat and is adapted to the modeling of natural textures. Each grouplet atoms is an elongated stroke located along the geometric flow. These atoms exhibit a wide range of lengths and widths, which is important to match the variety of structures present in natural images. Statistical modeling and sparsity optimization over these grouplet coefficients enable the synthesis of texture patterns along the flow. This paper explores texture inpainting and texture synthesis, which both require the joint optimization of the geometric flow and the grouplet coefficients.

Multiplicative stochastic heat equations on the whole space

Abstract: We carry out the construction of some ill-posed multiplicative stochastic heat equations on unbounded domains. The two main equations our result covers are, on the one hand the parabolic Anderson model on $\mathbf{R}^3$, and on the other hand the KPZ equation on $\mathbf{R}$ via the Cole-Hopf transform. To perform these constructions, we adapt the theory of regularity structures to the setting of weighted Besov spaces. One particular feature of our construction is that it allows one to start both equations from a Dirac mass at the initial time.