When people in a society want to make inference about some parameter, each person may want to use data collected by other people. Information (data) exchange in social networks is usually costly, so to make reliable statistical decisions, people need to weigh the benefits and costs of information acquisition. Conflicts of interests and coordination problems will arise in the process. Classical statistics does not consider peoples incentives and interactions in the data-collection process. To address this imperfection, this work explores multi-agent Bayesian inference problems with a game theoretic social network model. Motivated by our interest in aggregate inference at the societal level, we propose a new concept, <i>finite population learning</i>, to address whether with high probability, a large fraction of people in a given finite population network can make good inference. Serving as a foundation, this concept enables

In medical imaging, parameterized 3D surface models are of great interest for anatomical modeling and visualization, statistical comparisons of anatomy, and surface-based registration and signal processing. Here we introduce a parameterization method based on algebraic functions. By solving the Yamabe equation with the Ricci flow method, we can conformally map a brain surface to a multi-hole disk. The resulting parameterizations do not have any singularities and are intrinsic and stable. To illustrate the technique, we computed parameterizations of several types of anatomical surfaces in MRI scans of the brain, including the hippocampi and the cerebral cortices with various landmark curves labeled. For the cerebral cortical surfaces, we show the parameterization results are consistent with selected landmark curves and can be matched to each other using constrained harmonic maps. Unlike previous

We state a conjecture for the formulas of the depth 4 low-weight rotational eigenvectors and their corresponding eigenvalues for the 3^G subfactor planar algebras. We prove the conjecture in the case when |G| is odd. To do so, we find an action of G on the reduced subfactor planar algebra at f^{(2)}, which is obtained from shading the planar algebra of the even half. We also show that this reduced subfactor planar algebra is a Yang-Baxter planar algebra.

Mesh parameterization is a fundamental technique in computer graphics. The major goals during mesh parameterization are to minimize both the angle distortion and the area distortion. Angle distortion can be eliminated by the use of conformal mapping, in principle. Our paper focuses on solving the problem of finding the best discrete conformal mapping that also minimizes area distortion. First, we deduce an exact analytical differential formula to represent area distortion by curvature change in the discrete conformal mapping, giving a dynamic Poisson equation. On a mesh, the vertex curvature is related to edge lengths by the curvature map. Our result shows the map is invertible, i.e., the edge lengths can be computed from the curvature (by integration). Furthermore, we give the explicit Jacobi matrix of the inverse curvature map. Second, we formulate the task of computing conformal parameterizations with least area distortions as a constrained nonlinear optimization problem in curvature space. We deduce explicit conditions for the optima. Third, we give an energy form to measure the area distortions, and show that it has a unique global minimum. We use this to design an efficient algorithm, called free boundary curvature diffusion, which is guaranteed to converge to the global minimum; it has a natural physical interpretation. This result proves the common belief that optimal parameterization with least area distortion has a unique solution and can be achieved by free boundary conformal mapping. Major theoretical results and practical algorithms are presented for optimal parameterization based on the inverse curvature map. Comparisons are conducted with existing methods and using different energies. Novel parameterization applications are also introduced. The theoretical framework of the inverse curvature map can be applied to further study discrete conformal mappings.

The paper mainly discusses, based on the properties and related knowledge of continuous functions, the conditions that the graphs of separated binary polynomials are closed curves by the method of separation of variables. It also studies the properties of closed curves in the ways of analytic geometry, and draws a sucient and necessary condition to determine whether the graph of a separated binary polynomial is closed.