搜索结果: 1-12 共查到“理论统计学 graph”相关记录12条 . 查询时间(0.015 秒)
Graph cluster randomization: network exposure to multiple universes
Graph cluster randomization network exposure multiple universes
2013/6/17
A/B testing is a standard approach for evaluating the effect of online experiments; the goal is to estimate the `average treatment effect' of a new feature or condition by exposing a sample of the ove...
Statistical Analysis of Metric Graph Reconstruction
Metric Graph Filament Reconstruction Manifold Learning Minimax Esti-mation
2013/6/13
A metric graph is a 1-dimensional stratified metric space consisting of vertices and edges or loops glued together. Metric graphs can be naturally used to represent and model data that take the form o...
Seeded Graph Matching
Seeded Graph Matching
2012/11/21
Graph inference is a burgeoning field in the applied and theoretical statistics communities, as well as throughout the wider world of science, engineering, business, etc. Given two graphs on the same ...
Moment based estimation of stochastic Kronecker graph parameters
Moment based estimation stochastic Kronecker graph
2011/7/5
Stochastic Kronecker graphs supply a parsimonious model for large sparse real world graphs. They can specify the distribution of a large random graph using only three or four parameters.
Interpreting Graph Cuts as a Max-Product Algorithm
Max-Product Interpreting Graph binary variable models
2011/6/16
The maximum a posteriori (MAP) con guration
of binary variable models with submodular
graph-structured energy functions
can be found eciently and exactly by graph
cuts. Max-product belief propaga...
A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph
algebraic statistics contingency table three-way transportation pro-gram
2011/3/24
We give an exponential lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph of arbitrary size. Our result is a generalization of the result by Berstein and Onn (...
How the result of graph clustering methods depends on the construction of the graph
graph clustering construction
2011/3/21
We study the scenario of graph-based clustering algorithms such as spectral clustering. Given a set of data points, one first has to construct a graph on the data points and then apply a graph cluste...
Vertices of given degree in a random graph。
Vertices of degree one in a random sphere of influence graph
Vertices of degree one a random sphere of influence graph
2009/9/22
The sphere of influence graph of the set of vertices in R~
is constructed by identifying the nearest neighbour of each vertex,
centering a ball at each vertex so that its nearest neighbour lies on t...
Brownian excursion area, Wright's constants in graph enumeration, and other Brownian areas
Brownian excursion area graph enumeration
2009/5/18
This survey is a collection of various results and formulas by different authors on the areas (integrals) of five related processes, viz. Brownian motion, bridge, excursion, meander and double meander...
We consider the limit distribution of the orders of the k largest components in the Erdös-Rényi random graph inside the ``critical window'' for arbitrary k. We prove a local limit theorem for thi...
A local limit theorem for the critical random graph
critical random graph critical random graph
2009/4/22
We consider the limit distribution of the orders of the k largest components in the Erdös-Rényi random graph inside the ``critical window'' for arbitrary k. We prove a local limit theorem for thi...
