اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدRandom-Walk Statistics and the Spherical Harmonic Representation of CMB Maps
26
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We investigate the properties of the (complex) coefficients obtained in a spherical harmonic representation of temperature maps of the cosmic microwave background (CMB). We study the effect of the coefficient phase only, as well as the combined effects of phase and amplitude. The method used to check for anomalies is to construct a ``random walk trajectory in the complex plane where the step length and direction are given by the amplitude and phase (respectively) of the harmonic coefficient. If the fluctuations comprise a homogeneous and isotropic Gaussian random field on the sky, the path so obtained should be a classical ``Rayleigh flight with very well known statistical properties. We illustrate the use of this random-walk representation by using the net walk length as a test statistic, and apply the method to the coefficients obtained from a Wilkinson Microwave Anisotropy Probe (WMAP) preliminary sky temperature map.
قيم البحث
اقرأ أيضاً
We present a fast algorithm for generating full sky, high resolution ($sim 5$) simulations of the CMB anisotropy pattern. We also discuss the inverse problem, that of evaluating from such a map the full set of $a_{ell m}$s and the spectral coefficien
ts $C_ell$. We show that using an Equidistant Cylindrical Projection of the sky substantially speeds up the calculations. Thus, generating and/or inverting a full sky, high resolution map can be easily achieved with present day computer technology.
We study the Doobs $h$-transform of the two-dimensional simple random walk with respect to its potential kernel, which can be thought of as the two-dimensional simple random walk conditioned on never hitting the origin. We derive an explicit formula
for the Greens function of this random walk, and also prove a quantitative result on the speed of convergence of the (conditional) entrance measure to the harmonic measure (for the conditioned walk) on a finite set.
This paper is concerned with the limit laws of the extreme order statistics derived from a symmetric Laplace walk. We provide two different descriptions of the point process of the limiting extreme order statistics: a branching representation and a s
quared Bessel representation. These complementary descriptions expose various hidden symmetries in branching processes and Brownian motion which lie behind some striking formulas found by Schehr and Majumdar (Phys. Rev. Lett., 108:040601). In particular, the Bessel process of dimension $4 = 2+2$ appears in the descriptions as a path decomposition of Brownian motion at a local minimum and the Ray-Knight description of Brownian local times near the minimum.
Graphs are often used to organize data because of their simple topological structure, and therefore play a key role in machine learning. And it turns out that the low-dimensional embedded representation obtained by graph representation learning are e
xtremely useful in various typical tasks, such as node classification, content recommendation and link prediction. However, the existing methods mostly start from the microstructure (i.e., the edges) in the graph, ignoring the mesoscopic structure (high-order local structure). Here, we propose wGCN -- a novel framework that utilizes random walk to obtain the node-specific mesoscopic structures of the graph, and utilizes these mesoscopic structures to reconstruct the graph And organize the characteristic information of the nodes. Our method can effectively generate node embeddings for previously unseen data, which has been proven in a series of experiments conducted on citation networks and social networks (our method has advantages over baseline methods). We believe that combining high-order local structural information can more efficiently explore the potential of the network, which will greatly improve the learning efficiency of graph neural network and promote the establishment of new learning models.
In this paper we consider a particular version of the random walk with restarts: random reset events which bring suddenly the system to the starting value. We analyze its relevant statistical properties like the transition probability and show how an
equilibrium state appears. Formulas for the first-passage time, high-water marks and other extreme statistics are also derived: we consider counting problems associated naturally to the system. Finally we indicate feasible generalizations useful for interpreting different physical effects.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
