Consider a network where all nodes are distributed on a unit square following a Poisson distribution with known density ρand a pair of nodes separated by an Euclidean distance x are directly connected with probability g(x/rρ ), where g : [0,∞ρ+b/cp) [0,1] satisfies three conditions: rotational invariance, qnon-increasing monotonicity and integral boundedness, √ρ+b/Cp = ∫R2g(∥x∥)dx and bis a constant, independent of the event that another pair of nodes are directly connected. In this paper, we analyze the asymptotic distribution of the number of isolated nodes in the above network using the Chen-Stein technique and the impact of the boundary effect on the number of isolated nodes as ρ. On that basis we derive a necessary condition for the ab...
We consider a model for complex networks that was introduced by Krioukov et al. (Phys Rev E 82 (2010...
Let α ∈R, ε=(α+o(1)))/n and p=1/2(1+ε). Denote by {Mathematical expression} a random subgraph of the...
Dizemos que um grafo e conectado se existe um caminho de arestas entre quaisquer par de vértices. O ...
Consider a network where all nodes are distributed on a unit square following a Poisson distribution...
This paper studies networks where all nodes are distributed on a unit square Aδ= [-1\2, 1\2]2 follow...
Consider the random graph G(Pn,r) whose vertex set Pn is a Poisson point process of intensity n on (...
Consider a sequence of independent Poisson point processes X<SUB>1</SUB>,X<SUB>2</SUB>,… with densit...
Let P be a Poisson process intensity one a square Sn of area n. We construct a random geometric grap...
Let P be a Poisson process of intensity one in a square Sn of area n. We construct a random geometri...
Let P be a Poisson process of intensity 1 in a square Sn of area n. We construct a random geometric ...
AbstractLet P be a Poisson process of intensity 1 in a square Sn of area n. We construct a random ge...
Let P be a Poisson process of intensity 1 in a square Sn of area n. We construct a random geometric ...
We study the number of isolated nodes in a soft random geometric graph whose vertices constitute a P...
In this manuscript we discuss connectivity and distance properties for several models of random grap...
This work is a study of a family of random geometric graphs on the hyperbolic plane. In this setting...
We consider a model for complex networks that was introduced by Krioukov et al. (Phys Rev E 82 (2010...
Let α ∈R, ε=(α+o(1)))/n and p=1/2(1+ε). Denote by {Mathematical expression} a random subgraph of the...
Dizemos que um grafo e conectado se existe um caminho de arestas entre quaisquer par de vértices. O ...
Consider a network where all nodes are distributed on a unit square following a Poisson distribution...
This paper studies networks where all nodes are distributed on a unit square Aδ= [-1\2, 1\2]2 follow...
Consider the random graph G(Pn,r) whose vertex set Pn is a Poisson point process of intensity n on (...
Consider a sequence of independent Poisson point processes X<SUB>1</SUB>,X<SUB>2</SUB>,… with densit...
Let P be a Poisson process intensity one a square Sn of area n. We construct a random geometric grap...
Let P be a Poisson process of intensity one in a square Sn of area n. We construct a random geometri...
Let P be a Poisson process of intensity 1 in a square Sn of area n. We construct a random geometric ...
AbstractLet P be a Poisson process of intensity 1 in a square Sn of area n. We construct a random ge...
Let P be a Poisson process of intensity 1 in a square Sn of area n. We construct a random geometric ...
We study the number of isolated nodes in a soft random geometric graph whose vertices constitute a P...
In this manuscript we discuss connectivity and distance properties for several models of random grap...
This work is a study of a family of random geometric graphs on the hyperbolic plane. In this setting...
We consider a model for complex networks that was introduced by Krioukov et al. (Phys Rev E 82 (2010...
Let α ∈R, ε=(α+o(1)))/n and p=1/2(1+ε). Denote by {Mathematical expression} a random subgraph of the...
Dizemos que um grafo e conectado se existe um caminho de arestas entre quaisquer par de vértices. O ...