@article{14499, abstract = {An n-vertex graph is called C-Ramsey if it has no clique or independent set of size Clog2n (i.e., if it has near-optimal Ramsey behavior). In this paper, we study edge statistics in Ramsey graphs, in particular obtaining very precise control of the distribution of the number of edges in a random vertex subset of a C-Ramsey graph. This brings together two ongoing lines of research: the study of ‘random-like’ properties of Ramsey graphs and the study of small-ball probability for low-degree polynomials of independent random variables. The proof proceeds via an ‘additive structure’ dichotomy on the degree sequence and involves a wide range of different tools from Fourier analysis, random matrix theory, the theory of Boolean functions, probabilistic combinatorics and low-rank approximation. In particular, a key ingredient is a new sharpened version of the quadratic Carbery–Wright theorem on small-ball probability for polynomials of Gaussians, which we believe is of independent interest. One of the consequences of our result is the resolution of an old conjecture of Erdős and McKay, for which Erdős reiterated in several of his open problem collections and for which he offered one of his notorious monetary prizes.}, author = {Kwan, Matthew Alan and Sah, Ashwin and Sauermann, Lisa and Sawhney, Mehtaab}, issn = {2050-5086}, journal = {Forum of Mathematics, Pi}, keywords = {Discrete Mathematics and Combinatorics, Geometry and Topology, Mathematical Physics, Statistics and Probability, Algebra and Number Theory, Analysis}, publisher = {Cambridge University Press}, title = {{Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture}}, doi = {10.1017/fmp.2023.17}, volume = {11}, year = {2023}, } @article{14750, abstract = {Consider the random matrix model A1/2UBU∗A1/2, where A and B are two N × N deterministic matrices and U is either an N × N Haar unitary or orthogonal random matrix. It is well known that on the macroscopic scale (Invent. Math. 104 (1991) 201–220), the limiting empirical spectral distribution (ESD) of the above model is given by the free multiplicative convolution of the limiting ESDs of A and B, denoted as μα  μβ, where μα and μβ are the limiting ESDs of A and B, respectively. In this paper, we study the asymptotic microscopic behavior of the edge eigenvalues and eigenvectors statistics. We prove that both the density of μA μB, where μA and μB are the ESDs of A and B, respectively and the associated subordination functions have a regular behavior near the edges. Moreover, we establish the local laws near the edges on the optimal scale. In particular, we prove that the entries of the resolvent are close to some functionals depending only on the eigenvalues of A, B and the subordination functions with optimal convergence rates. Our proofs and calculations are based on the techniques developed for the additive model A+UBU∗ in (J. Funct. Anal. 271 (2016) 672–719; Comm. Math. Phys. 349 (2017) 947–990; Adv. Math. 319 (2017) 251–291; J. Funct. Anal. 279 (2020) 108639), and our results can be regarded as the counterparts of (J. Funct. Anal. 279 (2020) 108639) for the multiplicative model. }, author = {Ding, Xiucai and Ji, Hong Chang}, issn = {1050-5164}, journal = {The Annals of Applied Probability}, keywords = {Statistics, Probability and Uncertainty, Statistics and Probability}, number = {4}, pages = {2981--3009}, publisher = {Institute of Mathematical Statistics}, title = {{Local laws for multiplication of random matrices}}, doi = {10.1214/22-aap1882}, volume = {33}, year = {2023}, } @article{14775, abstract = {We establish a quantitative version of the Tracy–Widom law for the largest eigenvalue of high-dimensional sample covariance matrices. To be precise, we show that the fluctuations of the largest eigenvalue of a sample covariance matrix X∗X converge to its Tracy–Widom limit at a rate nearly N−1/3, where X is an M×N random matrix whose entries are independent real or complex random variables, assuming that both M and N tend to infinity at a constant rate. This result improves the previous estimate N−2/9 obtained by Wang (2019). Our proof relies on a Green function comparison method (Adv. Math. 229 (2012) 1435–1515) using iterative cumulant expansions, the local laws for the Green function and asymptotic properties of the correlation kernel of the white Wishart ensemble.}, author = {Schnelli, Kevin and Xu, Yuanyuan}, issn = {1050-5164}, journal = {The Annals of Applied Probability}, keywords = {Statistics, Probability and Uncertainty, Statistics and Probability}, number = {1}, pages = {677--725}, publisher = {Institute of Mathematical Statistics}, title = {{Convergence rate to the Tracy–Widom laws for the largest eigenvalue of sample covariance matrices}}, doi = {10.1214/22-aap1826}, volume = {33}, year = {2023}, } @article{14780, abstract = {In this paper, we study the eigenvalues and eigenvectors of the spiked invariant multiplicative models when the randomness is from Haar matrices. We establish the limits of the outlier eigenvalues λˆi and the generalized components (⟨v,uˆi⟩ for any deterministic vector v) of the outlier eigenvectors uˆi with optimal convergence rates. Moreover, we prove that the non-outlier eigenvalues stick with those of the unspiked matrices and the non-outlier eigenvectors are delocalized. The results also hold near the so-called BBP transition and for degenerate spikes. On one hand, our results can be regarded as a refinement of the counterparts of [12] under additional regularity conditions. On the other hand, they can be viewed as an analog of [34] by replacing the random matrix with i.i.d. entries with Haar random matrix.}, author = {Ding, Xiucai and Ji, Hong Chang}, issn = {1879-209X}, journal = {Stochastic Processes and their Applications}, keywords = {Applied Mathematics, Modeling and Simulation, Statistics and Probability}, pages = {25--60}, publisher = {Elsevier}, title = {{Spiked multiplicative random matrices and principal components}}, doi = {10.1016/j.spa.2023.05.009}, volume = {163}, year = {2023}, } @article{14849, abstract = {We establish a precise three-term asymptotic expansion, with an optimal estimate of the error term, for the rightmost eigenvalue of an n×n random matrix with independent identically distributed complex entries as n tends to infinity. All terms in the expansion are universal.}, author = {Cipolloni, Giorgio and Erdös, László and Schröder, Dominik J and Xu, Yuanyuan}, issn = {0091-1798}, journal = {The Annals of Probability}, keywords = {Statistics, Probability and Uncertainty, Statistics and Probability}, number = {6}, pages = {2192--2242}, publisher = {Institute of Mathematical Statistics}, title = {{On the rightmost eigenvalue of non-Hermitian random matrices}}, doi = {10.1214/23-aop1643}, volume = {51}, year = {2023}, } @article{11135, abstract = {We consider a correlated NxN Hermitian random matrix with a polynomially decaying metric correlation structure. By calculating the trace of the moments of the matrix and using the summable decay of the cumulants, we show that its operator norm is stochastically dominated by one.}, author = {Reker, Jana}, issn = {2010-3271}, journal = {Random Matrices: Theory and Applications}, keywords = {Discrete Mathematics and Combinatorics, Statistics, Probability and Uncertainty, Statistics and Probability, Algebra and Number Theory}, number = {4}, publisher = {World Scientific}, title = {{On the operator norm of a Hermitian random matrix with correlated entries}}, doi = {10.1142/s2010326322500368}, volume = {11}, year = {2022}, } @article{10643, abstract = {We prove a generalised super-adiabatic theorem for extended fermionic systems assuming a spectral gap only in the bulk. More precisely, we assume that the infinite system has a unique ground state and that the corresponding Gelfand–Naimark–Segal Hamiltonian has a spectral gap above its eigenvalue zero. Moreover, we show that a similar adiabatic theorem also holds in the bulk of finite systems up to errors that vanish faster than any inverse power of the system size, although the corresponding finite-volume Hamiltonians need not have a spectral gap. }, author = {Henheik, Sven Joscha and Teufel, Stefan}, issn = {2050-5094}, journal = {Forum of Mathematics, Sigma}, keywords = {computational mathematics, discrete mathematics and combinatorics, geometry and topology, mathematical physics, statistics and probability, algebra and number theory, theoretical computer science, analysis}, publisher = {Cambridge University Press}, title = {{Adiabatic theorem in the thermodynamic limit: Systems with a gap in the bulk}}, doi = {10.1017/fms.2021.80}, volume = {10}, year = {2022}, } @article{12148, abstract = {We prove a general local law for Wigner matrices that optimally handles observables of arbitrary rank and thus unifies the well-known averaged and isotropic local laws. As an application, we prove a central limit theorem in quantum unique ergodicity (QUE): that is, we show that the quadratic forms of a general deterministic matrix A on the bulk eigenvectors of a Wigner matrix have approximately Gaussian fluctuation. For the bulk spectrum, we thus generalise our previous result [17] as valid for test matrices A of large rank as well as the result of Benigni and Lopatto [7] as valid for specific small-rank observables.}, author = {Cipolloni, Giorgio and Erdös, László and Schröder, Dominik J}, issn = {2050-5094}, journal = {Forum of Mathematics, Sigma}, keywords = {Computational Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Mathematical Physics, Statistics and Probability, Algebra and Number Theory, Theoretical Computer Science, Analysis}, publisher = {Cambridge University Press}, title = {{Rank-uniform local law for Wigner matrices}}, doi = {10.1017/fms.2022.86}, volume = {10}, year = {2022}, } @article{12178, abstract = {In this paper we consider the stochastic primitive equation for geophysical flows subject to transport noise and turbulent pressure. Admitting very rough noise terms, the global existence and uniqueness of solutions to this stochastic partial differential equation are proven using stochastic maximal L² regularity, the theory of critical spaces for stochastic evolution equations, and global a priori bounds. Compared to other results in this direction, we do not need any smallness assumption on the transport noise which acts directly on the velocity field and we also allow rougher noise terms. The adaptation to Stratonovich type noise and, more generally, to variable viscosity and/or conductivity are discussed as well.}, author = {Agresti, Antonio and Hieber, Matthias and Hussein, Amru and Saal, Martin}, issn = {2194-041X}, journal = {Stochastics and Partial Differential Equations: Analysis and Computations}, keywords = {Applied Mathematics, Modeling and Simulation, Statistics and Probability}, publisher = {Springer Nature}, title = {{The stochastic primitive equations with transport noise and turbulent pressure}}, doi = {10.1007/s40072-022-00277-3}, year = {2022}, } @article{12281, abstract = {We study the hydrodynamic and hydrostatic limits of the one-dimensional open symmetric inclusion process with slow boundary. Depending on the value of the parameter tuning the interaction rate of the bulk of the system with the boundary, we obtain a linear heat equation with either Dirichlet, Robin or Neumann boundary conditions as hydrodynamic equation. In our approach, we combine duality and first-second class particle techniques to reduce the scaling limit of the inclusion process to the limiting behavior of a single, non-interacting, particle.}, author = {Franceschini, Chiara and Gonçalves, Patrícia and Sau, Federico}, issn = {1350-7265}, journal = {Bernoulli}, keywords = {Statistics and Probability}, number = {2}, pages = {1340--1381}, publisher = {Bernoulli Society for Mathematical Statistics and Probability}, title = {{Symmetric inclusion process with slow boundary: Hydrodynamics and hydrostatics}}, doi = {10.3150/21-bej1390}, volume = {28}, year = {2022}, } @article{12290, abstract = {We prove local laws, i.e. optimal concentration estimates for arbitrary products of resolvents of a Wigner random matrix with deterministic matrices in between. We find that the size of such products heavily depends on whether some of the deterministic matrices are traceless. Our estimates correctly account for this dependence and they hold optimally down to the smallest possible spectral scale.}, author = {Cipolloni, Giorgio and Erdös, László and Schröder, Dominik J}, issn = {1083-6489}, journal = {Electronic Journal of Probability}, keywords = {Statistics, Probability and Uncertainty, Statistics and Probability}, pages = {1--38}, publisher = {Institute of Mathematical Statistics}, title = {{Optimal multi-resolvent local laws for Wigner matrices}}, doi = {10.1214/22-ejp838}, volume = {27}, year = {2022}, } @article{12480, abstract = {We consider the problem of estimating a signal from measurements obtained via a generalized linear model. We focus on estimators based on approximate message passing (AMP), a family of iterative algorithms with many appealing features: the performance of AMP in the high-dimensional limit can be succinctly characterized under suitable model assumptions; AMP can also be tailored to the empirical distribution of the signal entries, and for a wide class of estimation problems, AMP is conjectured to be optimal among all polynomial-time algorithms. However, a major issue of AMP is that in many models (such as phase retrieval), it requires an initialization correlated with the ground-truth signal and independent from the measurement matrix. Assuming that such an initialization is available is typically not realistic. In this paper, we solve this problem by proposing an AMP algorithm initialized with a spectral estimator. With such an initialization, the standard AMP analysis fails since the spectral estimator depends in a complicated way on the design matrix. Our main contribution is a rigorous characterization of the performance of AMP with spectral initialization in the high-dimensional limit. The key technical idea is to define and analyze a two-phase artificial AMP algorithm that first produces the spectral estimator, and then closely approximates the iterates of the true AMP. We also provide numerical results that demonstrate the validity of the proposed approach.}, author = {Mondelli, Marco and Venkataramanan, Ramji}, issn = {1742-5468}, journal = {Journal of Statistical Mechanics: Theory and Experiment}, keywords = {Statistics, Probability and Uncertainty, Statistics and Probability, Statistical and Nonlinear Physics}, number = {11}, publisher = {IOP Publishing}, title = {{Approximate message passing with spectral initialization for generalized linear models}}, doi = {10.1088/1742-5468/ac9828}, volume = {2022}, year = {2022}, } @article{9158, abstract = {While several tools have been developed to study the ground state of many-body quantum spin systems, the limitations of existing techniques call for the exploration of new approaches. In this manuscript we develop an alternative analytical and numerical framework for many-body quantum spin ground states, based on the disentanglement formalism. In this approach, observables are exactly expressed as Gaussian-weighted functional integrals over scalar fields. We identify the leading contribution to these integrals, given by the saddle point of a suitable effective action. Analytically, we develop a field-theoretical expansion of the functional integrals, performed by means of appropriate Feynman rules. The expansion can be truncated to a desired order to obtain analytical approximations to observables. Numerically, we show that the disentanglement approach can be used to compute ground state expectation values from classical stochastic processes. While the associated fluctuations grow exponentially with imaginary time and the system size, this growth can be mitigated by means of an importance sampling scheme based on knowledge of the saddle point configuration. We illustrate the advantages and limitations of our methods by considering the quantum Ising model in 1, 2 and 3 spatial dimensions. Our analytical and numerical approaches are applicable to a broad class of systems, bridging concepts from quantum lattice models, continuum field theory, and classical stochastic processes.}, author = {De Nicola, Stefano}, issn = {1742-5468}, journal = {Journal of Statistical Mechanics: Theory and Experiment}, keywords = {Statistics, Probability and Uncertainty, Statistics and Probability, Statistical and Nonlinear Physics}, number = {1}, publisher = {IOP Publishing}, title = {{Disentanglement approach to quantum spin ground states: Field theory and stochastic simulation}}, doi = {10.1088/1742-5468/abc7c7}, volume = {2021}, year = {2021}, } @article{9387, abstract = {We report the complete analysis of a deterministic model of deleterious mutations and negative selection against them at two haploid loci without recombination. As long as mutation is a weaker force than selection, mutant alleles remain rare at the only stable equilibrium, and otherwise, a variety of dynamics are possible. If the mutation-free genotype is absent, generally the only stable equilibrium is the one that corresponds to fixation of the mutant allele at the locus where it is less deleterious. This result suggests that fixation of a deleterious allele that follows a click of the Muller’s ratchet is governed by natural selection, instead of random drift.}, author = {Khudiakova, Kseniia and Neretina, Tatiana Yu. and Kondrashov, Alexey S.}, issn = {0022-5193}, journal = {Journal of Theoretical Biology}, keywords = {General Biochemistry, Genetics and Molecular Biology, Modelling and Simulation, Statistics and Probability, General Immunology and Microbiology, Applied Mathematics, General Agricultural and Biological Sciences, General Medicine}, publisher = {Elsevier }, title = {{Two linked loci under mutation-selection balance and Muller’s ratchet}}, doi = {10.1016/j.jtbi.2021.110729}, volume = {524}, year = {2021}, } @article{14125, abstract = {Motivation: Recent technological advances have led to an increase in the production and availability of single-cell data. The ability to integrate a set of multi-technology measurements would allow the identification of biologically or clinically meaningful observations through the unification of the perspectives afforded by each technology. In most cases, however, profiling technologies consume the used cells and thus pairwise correspondences between datasets are lost. Due to the sheer size single-cell datasets can acquire, scalable algorithms that are able to universally match single-cell measurements carried out in one cell to its corresponding sibling in another technology are needed. Results: We propose Single-Cell data Integration via Matching (SCIM), a scalable approach to recover such correspondences in two or more technologies. SCIM assumes that cells share a common (low-dimensional) underlying structure and that the underlying cell distribution is approximately constant across technologies. It constructs a technology-invariant latent space using an autoencoder framework with an adversarial objective. Multi-modal datasets are integrated by pairing cells across technologies using a bipartite matching scheme that operates on the low-dimensional latent representations. We evaluate SCIM on a simulated cellular branching process and show that the cell-to-cell matches derived by SCIM reflect the same pseudotime on the simulated dataset. Moreover, we apply our method to two real-world scenarios, a melanoma tumor sample and a human bone marrow sample, where we pair cells from a scRNA dataset to their sibling cells in a CyTOF dataset achieving 90% and 78% cell-matching accuracy for each one of the samples, respectively.}, author = {Stark, Stefan G and Ficek, Joanna and Locatello, Francesco and Bonilla, Ximena and Chevrier, Stéphane and Singer, Franziska and Aebersold, Rudolf and Al-Quaddoomi, Faisal S and Albinus, Jonas and Alborelli, Ilaria and Andani, Sonali and Attinger, Per-Olof and Bacac, Marina and Baumhoer, Daniel and Beck-Schimmer, Beatrice and Beerenwinkel, Niko and Beisel, Christian and Bernasconi, Lara and Bertolini, Anne and Bodenmiller, Bernd and Bonilla, Ximena and Casanova, Ruben and Chevrier, Stéphane and Chicherova, Natalia and D'Costa, Maya and Danenberg, Esther and Davidson, Natalie and gan, Monica-Andreea Dră and Dummer, Reinhard and Engler, Stefanie and Erkens, Martin and Eschbach, Katja and Esposito, Cinzia and Fedier, André and Ferreira, Pedro and Ficek, Joanna and Frei, Anja L and Frey, Bruno and Goetze, Sandra and Grob, Linda and Gut, Gabriele and Günther, Detlef and Haberecker, Martina and Haeuptle, Pirmin and Heinzelmann-Schwarz, Viola and Herter, Sylvia and Holtackers, Rene and Huesser, Tamara and Irmisch, Anja and Jacob, Francis and Jacobs, Andrea and Jaeger, Tim M and Jahn, Katharina and James, Alva R and Jermann, Philip M and Kahles, André and Kahraman, Abdullah and Koelzer, Viktor H and Kuebler, Werner and Kuipers, Jack and Kunze, Christian P and Kurzeder, Christian and Lehmann, Kjong-Van and Levesque, Mitchell and Lugert, Sebastian and Maass, Gerd and Manz, Markus and Markolin, Philipp and Mena, Julien and Menzel, Ulrike and Metzler, Julian M and Miglino, Nicola and Milani, Emanuela S and Moch, Holger and Muenst, Simone and Murri, Riccardo and Ng, Charlotte KY and Nicolet, Stefan and Nowak, Marta and Pedrioli, Patrick GA and Pelkmans, Lucas and Piscuoglio, Salvatore and Prummer, Michael and Ritter, Mathilde and Rommel, Christian and Rosano-González, María L and Rätsch, Gunnar and Santacroce, Natascha and Castillo, Jacobo Sarabia del and Schlenker, Ramona and Schwalie, Petra C and Schwan, Severin and Schär, Tobias and Senti, Gabriela and Singer, Franziska and Sivapatham, Sujana and Snijder, Berend and Sobottka, Bettina and Sreedharan, Vipin T and Stark, Stefan and Stekhoven, Daniel J and Theocharides, Alexandre PA and Thomas, Tinu M and Tolnay, Markus and Tosevski, Vinko and Toussaint, Nora C and Tuncel, Mustafa A and Tusup, Marina and Drogen, Audrey Van and Vetter, Marcus and Vlajnic, Tatjana and Weber, Sandra and Weber, Walter P and Wegmann, Rebekka and Weller, Michael and Wendt, Fabian and Wey, Norbert and Wicki, Andreas and Wollscheid, Bernd and Yu, Shuqing and Ziegler, Johanna and Zimmermann, Marc and Zoche, Martin and Zuend, Gregor and Rätsch, Gunnar and Lehmann, Kjong-Van}, issn = {1367-4811}, journal = {Bioinformatics}, keywords = {Computational Mathematics, Computational Theory and Mathematics, Computer Science Applications, Molecular Biology, Biochemistry, Statistics and Probability}, number = {Supplement_2}, pages = {i919--i927}, publisher = {Oxford University Press}, title = {{SCIM: Universal single-cell matching with unpaired feature sets}}, doi = {10.1093/bioinformatics/btaa843}, volume = {36}, year = {2020}, } @article{8421, abstract = {The classical Birkhoff conjecture claims that the boundary of a strictly convex integrable billiard table is necessarily an ellipse (or a circle as a special case). In this article we prove a complete local version of this conjecture: a small integrable perturbation of an ellipse must be an ellipse. This extends and completes the result in Avila-De Simoi-Kaloshin, where nearly circular domains were considered. One of the crucial ideas in the proof is to extend action-angle coordinates for elliptic billiards into complex domains (with respect to the angle), and to thoroughly analyze the nature of their complex singularities. As an application, we are able to prove some spectral rigidity results for elliptic domains.}, author = {Kaloshin, Vadim and Sorrentino, Alfonso}, issn = {0003-486X}, journal = {Annals of Mathematics}, keywords = {Statistics, Probability and Uncertainty, Statistics and Probability}, number = {1}, pages = {315--380}, publisher = {Annals of Mathematics, Princeton U}, title = {{On the local Birkhoff conjecture for convex billiards}}, doi = {10.4007/annals.2018.188.1.6}, volume = {188}, year = {2018}, } @article{11670, abstract = {Auctions are widely used on the Web. Applications range from sponsored search to platforms such as eBay. In these and in many other applications the auctions in use are single-/multi-item auctions with unit demand. The main drawback of standard mechanisms for this type of auctions, such as VCG and GSP, is the limited expressiveness that they offer to the bidders. The General Auction Mechanism (GAM) of Aggarwal et al. [2009] takes a first step toward addressing the problem of limited expressiveness by computing a bidder optimal, envy-free outcome for linear utility functions with identical slopes and a single discontinuity per bidder-item pair. We show that in many practical situations this does not suffice to adequately model the preferences of the bidders, and we overcome this problem by presenting the first mechanism for piecewise linear utility functions with nonidentical slopes and multiple discontinuities. Our mechanism runs in polynomial time. Like GAM it is incentive compatible for inputs that fulfill a certain nondegeneracy assumption, but our requirement is more general than the requirement of GAM. For discontinuous utility functions that are nondegenerate as well as for continuous utility functions the outcome of our mechanism is a competitive equilibrium. We also show how our mechanism can be used to compute approximately bidder optimal, envy-free outcomes for a general class of continuous utility functions via piecewise linear approximation. Finally, we prove hardness results for even more expressive settings.}, author = {Dütting, Paul and Henzinger, Monika H and Weber, Ingmar}, issn = {2167-8383}, journal = {ACM Transactions on Economics and Computation}, keywords = {Computational Mathematics, Marketing, Economics and Econometrics, Statistics and Probability, Computer Science (miscellaneous)}, number = {1}, publisher = {Association for Computing Machinery}, title = {{An expressive mechanism for auctions on the web}}, doi = {10.1145/2716312}, volume = {4}, year = {2015}, } @article{8459, abstract = {Nuclear magnetic resonance (NMR) is a powerful tool for observing the motion of biomolecules at the atomic level. One technique, the analysis of relaxation dispersion phenomenon, is highly suited for studying the kinetics and thermodynamics of biological processes. Built on top of the relax computational environment for NMR dynamics is a new dispersion analysis designed to be comprehensive, accurate and easy-to-use. The software supports more models, both numeric and analytic, than current solutions. An automated protocol, available for scripting and driving the graphical user interface (GUI), is designed to simplify the analysis of dispersion data for NMR spectroscopists. Decreases in optimization time are granted by parallelization for running on computer clusters and by skipping an initial grid search by using parameters from one solution as the starting point for another —using analytic model results for the numeric models, taking advantage of model nesting, and using averaged non-clustered results for the clustered analysis.}, author = {Morin, Sébastien and Linnet, Troels E and Lescanne, Mathilde and Schanda, Paul and Thompson, Gary S and Tollinger, Martin and Teilum, Kaare and Gagné, Stéphane and Marion, Dominique and Griesinger, Christian and Blackledge, Martin and d’Auvergne, Edward J}, issn = {1367-4803}, journal = {Bioinformatics}, keywords = {Statistics and Probability, Computational Theory and Mathematics, Biochemistry, Molecular Biology, Computational Mathematics, Computer Science Applications}, number = {15}, pages = {2219--2220}, publisher = {Oxford University Press}, title = {{Relax: The analysis of biomolecular kinetics and thermodynamics using NMR relaxation dispersion data}}, doi = {10.1093/bioinformatics/btu166}, volume = {30}, year = {2014}, } @article{8526, author = {Kaloshin, Vadim}, issn = {0003-486X}, journal = {The Annals of Mathematics}, keywords = {Statistics, Probability and Uncertainty, Statistics and Probability}, number = {2}, pages = {729--741}, publisher = {JSTOR}, title = {{An extension of the Artin-Mazur theorem}}, doi = {10.2307/121093}, volume = {150}, year = {1999}, }