搜索结果: 61-75 共查到“知识库 数学基础”相关记录713条 . 查询时间(2.562 秒)
GENUS 0 AND 1 HURWITZ NUMBERS: RECURSIONS, FORMULAS, AND GRAPH-THEORETIC INTERPRETATIONS
RECURSIONS FORMULAS GRAPH-THEORETIC
2015/7/14
We derive a closed-form expression for all genus 1 Hurwitz numbers, and give a
simple new graph-theoretic interpretation of Hurwitz numbers in genus 0 and 1. (Hurwitz
numbers essentially count irred...
Spectral Analysis for Discrete Longitudinal Data
Discrete longitudinal data spectral analysis
2015/7/14
Spectral Analysis for Discrete Longitudinal Data.
A SHORT PROOF OF THE CONJECTURE WITHOUT GROMOV-WITTEN THEORY: HURWITZ THEORY AND THE MODULI OF CURVES
HURWITZ THEORY THE MODULI OF CURVES
2015/7/14
I. P. GOULDEN, D. M. JACKSON AND R. VAKILConjecture. The
approach is through the Ekedahl-Lando-Shapiro-Vainshtein theorem, which establishes the \polynomiality" of Hurwitz numbers, from which we pick...
A SHORT PROOF OF THE CONJECTURE WITHOUT GROMOV-WITTEN THEORY: HURWITZ THEORY AND THE MODULI OF CURVES
HURWITZ THEORY THE MODULI OF CURVES
2015/7/14
I. P. GOULDEN, D. M. JACKSON AND R. VAKILConjecture. The
approach is through the Ekedahl-Lando-Shapiro-Vainshtein theorem, which establishes the \polynomiality" of Hurwitz numbers, from which we pick...
Hammersley's Interacting Particle Process and Longst Increasing Subsequences
Hammersley interaction the process of particles the Longst increasing subsequences
2015/7/14
Hammersley's Interacting Particle Process and Longst Increasing Subsequences。
RIFFLE SHUFFLES,CYCLES,AND DESCENTS。
LOGARITHMIC SOBOLEV INEQUALITIES FOR FINITE MARKOV CHAINS
Logarithmic sobolev limited markov chain the inequality
2015/7/14
LOGARITHMIC SOBOLEV INEQUALITIES FOR FINITE MARKOV CHAINS。
Walks on generating sets of Abelian groups。
The cutoff phenomenon in finite Markov chains。
Markov chains on finite sets are used in a great variety of situations
to approximate, understand and sample from their limit distribution. A familiar
example is provided by card shufflin...
Matchings and phylogenetic trees。
From shuffling cards to walking around the building:An Inetroduction to modern markov chain theory
Shuffle CARDS walk around buildings markov chain theory
2015/7/14
From shuffling cards to walking around the building:An Inetroduction to modern markov chain theory。
Walks on generating sets of groups
Markov chain the data the random path organization theory parameters
2015/7/14
We study a Markov chain on generating n-tuples of a ®xed
group which arises in algorithms for manipulating ®nite groups. The
main tools are comparison of two Markov chains on di€erent...
What Do We Know about the Metropolis Algorithm.
Consistency of Bayes Estimates for Nonparametric Regression: Normal Theory
Consistency Bayes estimates model selection binary regression
2015/7/14
Performance characteristics of Bayes estimates are studied. More exactly, for each subject in a data
set, let 5 be a vector of binary covariates and let Y be a normal response variable, with
E{YIE...