搜索结果: 1-15 共查到“理论统计学 Graphs”相关记录18条 . 查询时间(0.171 秒)
A limit theorem for scaled eigenvectors of random dot product graphs
limit theorem scaled eigenvectors random dot product graphs
2013/6/14
We prove a central limit theorem for the components of the largest eigenvector of the adjacency matrix of a one-dimensional random dot product graph whose true latent positions are unknown. In particu...
Out-of-sample Extension for Latent Position Graphs
out-of-sample extension inhomogeneous random graphs latent position model convergence of eigenvectors
2013/6/14
We consider the problem of vertex classification for graphs constructed from the latent position model. It was shown previously that the approach of embedding the graphs into some Euclidean space foll...
Marginal AMP Chain Graphs
Marginal AMPChain Graphs
2013/6/13
We present a new family of graphical models that may have undirected, directed and bidirected edges. We name these new models marginal AMP (MAMP) chain graphs because each of them can be seen as the r...
Jointly interventional and observational data: estimation of interventional Markov equivalence classes of directed acyclic graphs
Causal inference Interventions BIC Graphical model Maximum likelihood estimation Greedy equivalence search
2013/4/27
In many applications we have both observational and (randomized) interventional data. We propose a Gaussian likelihood framework for joint modeling of such different data-types, based on global parame...
Learning AMP Chain Graphs and some Marginal Models Thereof under Faithfulness
Learning AMP Chain Graphs some Marginal Models Thereof under Faithfulness
2013/4/27
This paper deals with chain graphs under the Andersson-Madigan-Perlman (AMP) interpretation. In particular, we present a constraint based algorithm for learning an AMP chain graph a given probability ...
Supplement to "Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs"
Sparse graphical model Reversible Markov chain Markov equivalence class
2013/4/27
This supplementary material includes three parts: some preliminary results, four examples, an experiment, three new algorithms, and all proofs of the results in the paper "Reversible MCMC on Markov eq...
Topology Discovery of Sparse Random Graphs With Few Participants
Topology Discovery Sparse Random Graphs End-to-end Measurements Hidden Nodes Quartet Tests
2011/3/25
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. The rest of the nodes ...
Estimation of Rényi Entropy and Mutual Information Based on Generalized Nearest-Neighbor Graphs
Rényi Entropy Mutual Information Generalized Nearest-Neighbor Graphs
2010/3/11
In this paper we consider simple and computationally efficient nonparametric estimators of R´enyi
entropy and mutual information based on an i.i.d. sample drawn from an unknown, absolutely
con...
The dynamics of message passing on dense graphs,with applications to compressed sensing
message passing dense graphs compressed sensing
2010/3/9
Approximate message passing’ algorithms proved to be extremely effective in reconstructing
sparse signals from a small number of incoherent linear measurements. Extensive numerical
experiments furth...
The shortest distance in random multi-type intersection graphs
Intersection graph shortest path branching process approximation Poissonapproximation
2010/3/9
Using an associated branching process as the basis of our approximation, we
show that typical inter-point distances in a multitype random intersection graph
have a defective distribution, which is w...
On exchangeable random variables and the statistics of large graphs and hypergraphs
random variables large graphs large hypergraphs
2009/5/18
In this survey we recall the basic results of the theory of exchangeable laws, and then explain the probabilistic versions of various interesting questions from graph and hypergraph theory that their ...
On the Cover Time of Planar Graphs
effective resistance commute time hitting time difference time circle packing
2009/5/4
The cover time of a finite connected graph is the expected number of steps needed for a simple random walk on the graph to visit all the vertices. It is known that the cover time on any n-vertex, conn...
Stationary random graphs with prescribed iid degrees on a spatial Poisson process
Random graphs degree distribution Poisson process stable matching stationary model
2009/4/29
Let $[mathcal{P}]$ be the points of a Poisson process on $RR^d$ and $F$ a probability distribution with support on the non-negative integers. Models are formulated for generating translation invariant...
Recurrent Graphs where Two Independent Random Walks Collide Finitely Often
Random walk Comb lattice collisions
2009/4/28
We present a class of graphs where simple random walk is recurrent, yet two independent walkers meet only finitely many times almost surely. In particular, the comb lattice, obtained from $Z^2$ by rem...
Stationary random graphs on Z with prescribed iid degrees and finite mean connections
Random graphs degree distribution stationary model
2009/4/23
Let F be a probability distribution with support on the non-negative integers. A model is proposed for generating stationary simple graphs on Z with degree distribution F and it is shown for this mode...