Spectral statistics of random geometric graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spectral Analysis of Virus Spreading in Random Geometric Graphs

In this paper, we study the dynamics of a viral spreading process in random geometric graphs (RGG). In an RGG, nodes are randomly distributed in a particular spatial region, and edges are located between those pairs of nodes that lie within a given distance r from each other. The spreading of the viral process we consider in this paper is closely related with the spectral radius of the adjacenc...

متن کامل

Infinite Random Geometric Graphs

We introduce a new class of countably infinite random geometric graphs, whose vertices V are points in a metric space, and vertices are adjacent independently with probability p ∈ (0, 1) if the metric distance between the vertices is below a given threshold. If V is a countable dense set in R equipped with the metric derived from the L∞-norm, then it is shown that with probability 1 such infini...

متن کامل

Dynamic Random Geometric Graphs

We provide the first analytical results for the connectivity of dynamic random geometric graphs-a model of mobile wireless networks in which vertices move in random (and periodically updated) directions, and an edge exists between two vertices if their Euclidean distance is below a given threshold. We provide precise asymptotic results for the expected length of the connectivity and disconnecti...

متن کامل

Random geometric graphs.

We analyze graphs in which each vertex is assigned random coordinates in a geometric space of arbitrary dimensionality and only edges between adjacent points are present. The critical connectivity is found numerically by examining the size of the largest cluster. We derive an analytical expression for the cluster coefficient, which shows that the graphs are distinctly different from standard ra...

متن کامل

Geometric Inhomogeneous Random Graphs

For the theoretical study of real-world networks, we propose a model of scale-free randomgraphs with underlying geometry that we call geometric inhomogeneous random graphs (GIRGs).GIRGs generalize hyperbolic random graphs, which are a popular model to test algorithms forsocial and technological networks. Our generalization overcomes some limitations of hyperbolicrandom graphs, w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: EPL (Europhysics Letters)

سال: 2017

ISSN: 0295-5075,1286-4854

DOI: 10.1209/0295-5075/118/18003