Browse
Submit Data
Databases
API
Help

Dataset Information

9 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Linear variational principle for Riemann mappings and discrete conformality.

ABSTRACT: We consider Riemann mappings from bounded Lipschitz domains in the plane to a triangle. We show that in this case the Riemann mapping has a linear variational principle: It is the minimizer of the Dirichlet energy over an appropriate affine space. By discretizing the variational principle in a natural way we obtain discrete conformal maps which can be computed by solving a sparse linear system. We show that these discrete conformal maps converge to the Riemann mapping in [Formula: see text], even for non-Delaunay triangulations. Additionally, for Delaunay triangulations the discrete conformal maps converge uniformly and are known to be bijective. As a consequence we show that the Riemann mapping between two bounded Lipschitz domains can be uniformly approximated by composing the discrete Riemann mappings between each Lipschitz domain and the triangle.

SUBMITTER: Dym N

PROVIDER: S-EPMC6338830 | biostudies-other | 2019 Jan

REPOSITORIES: biostudies-other

ACCESS DATA

Json Xml

Publications

Linear variational principle for Riemann mappings and discrete conformality.

Dym Nadav N Slutsky Raz R Lipman Yaron Y

Proceedings of the National Academy of Sciences of the United States of America 20181228 3

We consider Riemann mappings from bounded Lipschitz domains in the plane to a triangle. We show that in this case the Riemann mapping has a linear variational principle: It is the minimizer of the Dirichlet energy over an appropriate affine space. By discretizing the variational principle in a natural way we obtain discrete conformal maps which can be computed by solving a sparse linear system. We show that these discrete conformal maps converge to the Riemann mapping in [Formula: see text], eve ...[more]

PMID: 30593564

Similar Datasets

Variational principle for scale-free network motifs.

Project description:For scale-free networks with degrees following a power law with an exponent τ ∈ (2, 3), the structures of motifs (small subgraphs) are not yet well understood. We introduce a method designed to identify the dominant structure of any given motif as the solution of an optimization problem. The unique optimizer describes the degrees of the vertices that together span the most likely motif, resulting in explicit asymptotic formulas for the motif count and its fluctuations. We then classify all motifs into two categories: motifs with small and large fluctuations.

| S-EPMC6494877 | biostudies-other

A variational Bayes discrete mixture test for rare variant association.

Project description:Recently, many statistical methods have been proposed to test for associations between rare genetic variants and complex traits. Most of these methods test for association by aggregating genetic variations within a predefined region, such as a gene. Although there is evidence that "aggregate" tests are more powerful than the single marker test, these tests generally ignore neutral variants and therefore are unable to identify specific variants driving the association with phenotype. We propose a novel aggregate rare-variant test that explicitly models a fraction of variants as neutral, tests associations at the gene-level, and infers the rare-variants driving the association. Simulations show that in the practical scenario where there are many variants within a given region of the genome with only a fraction causal our approach has greater power compared to other popular tests such as the Sequence Kernel Association Test (SKAT), the Weighted Sum Statistic (WSS), and the collapsing method of Morris and Zeggini (MZ). Our algorithm leverages a fast variational Bayes approximate inference methodology to scale to exome-wide analyses, a significant computational advantage over exact inference model selection methodologies. To demonstrate the efficacy of our methodology we test for associations between von Willebrand Factor (VWF) levels and VWF missense rare-variants imputed from the National Heart, Lung, and Blood Institute's Exome Sequencing project into 2,487 African Americans within the VWF gene. Our method suggests that a relatively small fraction (~10%) of the imputed rare missense variants within VWF are strongly associated with lower VWF levels in African Americans.

| S-EPMC4030763 | biostudies-literature

Feynman's clock, a new variational principle, and parallel-in-time quantum dynamics.

Project description:We introduce a discrete-time variational principle inspired by the quantum clock originally proposed by Feynman and use it to write down quantum evolution as a ground-state eigenvalue problem. The construction allows one to apply ground-state quantum many-body theory to quantum dynamics, extending the reach of many highly developed tools from this fertile research area. Moreover, this formalism naturally leads to an algorithm to parallelize quantum simulation over time. We draw an explicit connection between previously known time-dependent variational principles and the time-embedded variational principle presented. Sample calculations are presented, applying the idea to a hydrogen molecule and the spin degrees of freedom of a model inorganic compound, demonstrating the parallel speedup of our method as well as its flexibility in applying ground-state methodologies. Finally, we take advantage of the unique perspective of this variational principle to examine the error of basis approximations in quantum dynamics.

| S-EPMC3799300 | biostudies-literature

Variational Bayesian Parameter Estimation Techniques for the General Linear Model.

Project description:Variational Bayes (VB), variational maximum likelihood (VML), restricted maximum likelihood (ReML), and maximum likelihood (ML) are cornerstone parametric statistical estimation techniques in the analysis of functional neuroimaging data. However, the theoretical underpinnings of these model parameter estimation techniques are rarely covered in introductory statistical texts. Because of the widespread practical use of VB, VML, ReML, and ML in the neuroimaging community, we reasoned that a theoretical treatment of their relationships and their application in a basic modeling scenario may be helpful for both neuroimaging novices and practitioners alike. In this technical study, we thus revisit the conceptual and formal underpinnings of VB, VML, ReML, and ML and provide a detailed account of their mathematical relationships and implementational details. We further apply VB, VML, ReML, and ML to the general linear model (GLM) with non-spherical error covariance as commonly encountered in the first-level analysis of fMRI data. To this end, we explicitly derive the corresponding free energy objective functions and ensuing iterative algorithms. Finally, in the applied part of our study, we evaluate the parameter and model recovery properties of VB, VML, ReML, and ML, first in an exemplary setting and then in the analysis of experimental fMRI data acquired from a single participant under visual stimulation.

| S-EPMC5605759 | biostudies-literature

Reaction networks as systems for resource allocation: a variational principle for their non-equilibrium steady states.

Project description:Within a fully microscopic setting, we derive a variational principle for the non-equilibrium steady states of chemical reaction networks, valid for time-scales over which chemical potentials can be taken to be slowly varying: at stationarity the system minimizes a global function of the reaction fluxes with the form of a Hopfield Hamiltonian with hebbian couplings, that is explicitly seen to correspond to the rate of decay of entropy production over time. Guided by this analogy, we show that reaction networks can be formally re-cast as systems of interacting reactions that optimize the use of the available compounds by competing for substrates, akin to agents competing for a limited resource in an optimal allocation problem. As an illustration, we analyze the scenario that emerges in two simple cases: that of toy (random) reaction networks and that of a metabolic network model of the human red blood cell.

| S-EPMC3397975 | biostudies-literature

A generalization of Ekeland's variational principle by using the τ-distance with its applications.

Project description:In this paper, a new version of Ekeland's variational principle by using the concept of τ-distance is proved and, by applying it, an approximate minimization theorem is stated. Moreover, by using it, two versions of existence results of a solution for the equilibrium problem in the setting of complete metric spaces are investigated. Finally some examples in order to illustrate the results of this note are given.

| S-EPMC5544817 | biostudies-other

Strong evidence of an information-theoretical conservation principle linking all discrete systems.

Project description:Diverse discrete systems share common global properties that lack a unifying theoretical explanation. However, constraining the simplest measure of total information (Hartley-Shannon) in a statistical mechanics framework reveals a principle, the conservation of Hartley-Shannon information (CoHSI) that directly predicts both known and unsuspected common properties of discrete systems, as borne out in the diverse systems of computer software, proteins and music. Discrete systems fall into two categories distinguished by their structure: heterogeneous systems in which there is a distinguishable order of assembly of the system's components from an alphabet of unique tokens (e.g. proteins assembled from an alphabet of amino acids), and homogeneous systems in which unique tokens are simply binned, counted and rank ordered. Heterogeneous systems are characterized by an implicit distribution of component lengths, with sharp unimodal peak (containing the majority of components) and a power-law tail, whereas homogeneous systems reduce naturally to Zipf's Law but with a drooping tail in the distribution. We also confirm predictions that very long components are inevitable for heterogeneous systems; that discrete systems can exhibit simultaneously both heterogeneous and homogeneous behaviour; and that in systems with more than one consistent token alphabet (e.g. digital music), the alphabets themselves show a power-law relationship.

| S-EPMC6837184 | biostudies-literature

Piecewise linear approximation of protein structures using the principle of minimum message length.

Project description:UNLABELLED: Simple and concise representations of protein-folding patterns provide powerful abstractions for visualizations, comparisons, classifications, searching and aligning structural data. Structures are often abstracted by replacing standard secondary structural features-that is, helices and strands of sheet-by vectors or linear segments. Relying solely on standard secondary structure may result in a significant loss of structural information. Further, traditional methods of simplification crucially depend on the consistency and accuracy of external methods to assign secondary structures to protein coordinate data. Although many methods exist automatically to identify secondary structure, the impreciseness of definitions, along with errors and inconsistencies in experimental structure data, drastically limit their applicability to generate reliable simplified representations, especially for structural comparison. This article introduces a mathematically rigorous algorithm to delineate protein structure using the elegant statistical and inductive inference framework of minimum message length (MML). Our method generates consistent and statistically robust piecewise linear explanations of protein coordinate data, resulting in a powerful and concise representation of the structure. The delineation is completely independent of the approaches of using hydrogen-bonding patterns or inspecting local substructural geometry that the current methods use. Indeed, as is common with applications of the MML criterion, this method is free of parameters and thresholds, in striking contrast to the existing programs which are often beset by them. The analysis of results over a large number of proteins suggests that the method produces consistent delineation of structures that encompasses, among others, the segments corresponding to standard secondary structure. AVAILABILITY: http://www.csse.monash.edu.au/~karun/pmml.

| S-EPMC3117365 | biostudies-literature

1-Quasiconformal mappings and CR mappings on Goursat groups.

Project description:We show that 1-quasiconformal mappings on Goursat groups are CR or anti-CR mappings. This can reduce the determination of 1-quasiconformal mappings to the determination of CR automorphisms of CR manifolds, which is a fundamental problem in the theory of several complex variables.

| S-EPMC4032657 | biostudies-other

Stabilization of positive linear discrete-time systems by using a Brauer's theorem.

Project description:The stabilization problem of positive linear discrete-time systems (PLDS) by linear state feedback is considered. A method based on a Brauer's theorem is proposed for solving the problem. It allows us to modify some eigenvalues of the system without changing the rest of them. The problem is studied for the single-input single-output (SISO) and for multi-input multioutput (MIMO) cases and sufficient conditions for stability and positivity of the closed-loop system are proved. The results are illustrated by numerical examples and the proposed method is used in stochastic systems.

| S-EPMC4144301 | biostudies-other

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data