搜索结果: 46-60 共查到“知识库 概率论”相关记录912条 . 查询时间(0.996 秒)
A Limit Shape Theorem for Periodic Stochastic Dispersion
Space is periodic random flow order and an infinite linear speed
2015/9/28
We consider the evolution of a connected set on the plane carried by a space periodic incompressible stochastic flow. While for almost every realization of the stochastic flow at time t mo...
Deterministic and stochastic perturbations of area preserving flows on a two-dimensional torus
Averaging Markov Process Hamiltonian Flow Gluing Conditions Diffusion on a Graph
2015/9/28
We study deterministic and stochastic perturbations of incompressible flows on a two-dimensional torus. Even in the case of purely deterministic perturbations, the long-time behavior of such ...
How Should Benefits and Costs Be Discounted in an Intergenerational Context?
earnings probability
2015/9/18
Should governments, in discounting the future benefits and costs of public projects, use a
discount rate that declines over time? The argument for a declining discount rate is a simple one: if the
d...
A Gaussian upper bound for the iterated kernels of Markov chains is obtained under some natural conditions. This result applies in particular to simple random walks on any locally compact unimodular g...
This is a survey on analysis on non-compact co-compact Riemannian
covers and how it relates to random walks on finitely generated groups. The
focus is on the long time behavior of the heat kernel an...
Probability on Groups: Random Walks and Invariant Diffusions
Invariant Diffusions Random Walks
2015/8/26
What do card shuffling, volume
growth, and Harnack inequalities
have to do with each other? They all
arise in the study of random walks
on groups. Probability on groups is
concerned with probabil...
Finite size scaling for the core of large random hypergraphs
Core random hyper-graph random graph low-density parity-check codes XOR-SAT fi nite size scaling
2015/8/21
The (two) core of an hyper-graph is the maximal collection of hyper-edges within which no vertex appears only once. It is of importance in tasks such as efficiently solving a large linear system over ...
Ising models on locally tree-like graphs
Ising model random sparse graphs cavity method Bethe measures belief propagation local weak convergence
2015/8/21
We consider Ising models on graphs that converge locally to trees. Examples include random regular graphs with bounded degree and uniformly random graphs with bounded average degree. We prove that the...
Matrix Completion from Noisy Entries
matrix completion low-rank matrices spectral methods manifold optimization
2015/8/21
Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of applications, from colla...
Majority dynamics on trees and the dynamic cavity method
Voters independent distribution random variables the initialization
2015/8/20
An elector sits on each vertex of an in nite tree of degree k, and has to decide between two alternatives.At each time step, each elector switches to the opinion of the majority of her neighbors. We a...
The weak limit of Ising models on locally tree-like graphs
Ising model the temperature the last beta sequence
2015/8/20
We consider the Ising model with inverse temperature β and without external field on sequences of graphs Gn which converge locally to the k-regular tree. We show that for such graphs the Ising m...
FACTOR MODELS ON LOCALLY TREE-LIKE GRAPHS
Factor models random graphs belief propagation Bethe measures Potts model independent set Gibbs measures free energy density local weak convergence
2015/8/20
We consider homogeneous factor models on uniformly sparse graph sequences converg-ing locally to a (unimodular) random tree T, and study the existence of the free energy density ,the limit of the log...
The Hausdorff distance between a compact convex set K CRd and random sets
K c lRd iS studied. Basic inequalities are derived for the case of K being a convex
subset of K. If applied to special seq...
Fastest mixing Markov chain on a path
Random walks symmetrical transition probability markov chain the uniform distribution the transfer matrix
2015/8/10
We consider a random walk on a path with n nodes, with symmetric transition probabilities, i.e., the probability of making a transition between node i and node i+1 is the same as making a transition f...
Distributed average consensus with least-mean-square deviation
Distributed average consensus Least-mean-square Convex optimization Edge-transitive graphs
2015/8/10
We consider a stochastic model for distributed average consensus, which arises in applications such as load balancing for parallel processors, distributed coordination of mobile autonomous agents, and...