相关论文: Asymptotic behavior of the Kleinberg model
We study the Kleinberg problem of navigation in Small World networks when the underlying lattice is stretched along a preferred direction. Extensive simulations confirm that maximally efficient navigation is attained when the length $r$ of…
Navigation process is studied on a variant of the Watts-Strogatz small world network model embedded on a square lattice. With probability $p$, each vertex sends out a long range link, and the probability of the other end of this link…
We study the Kleinberg problem of navigation in Small World networks when the underlying lattice is a fractal consisting of N>>1 nodes. Our extensive numerical simulations confirm the prediction that most efficient navigation is attained…
We numerically estimate the leading asymptotic behavior of the length $L_{n}$ of the longest increasing subsequence of random walks with step increments following Student's $t$-distribution with parameter in the range $1/2 \leq \nu \leq 5$.…
The nearest-neighbor level spacing distribution is numerically investigated by directly diagonalizing disordered Anderson Hamiltonians for systems of sizes up to 100 x 100 x 100 lattice sites. The scaling behavior of the level statistics is…
In order to investigate the routing aspects of small-world networks, Kleinberg proposes a network model based on a $d$-dimensional lattice with long-range links chosen at random according to the $d$-harmonic distribution. Kleinberg shows…
The goal of the paper is to study asymptotic behavior of the number of lost messages. Long messages are assumed to be divided into a random number of packets which are transmitted independently of one another. An error in transmission of a…
We numerically study bootstrap percolation on Kleinberg's spatial networks, in which the probability density function of a node to have a long-range link at distance $r$ scales as $P(r)\sim r^{\alpha}$. Setting the ratio of the size of the…
A navigation on a set of points $S$ is a rule for choosing which point to move to from the present point in order to progress toward a specified target. We study some navigations in the plane where $S$ is a non uniform Poisson point process…
The set of visited sites and the number of visited sites are two basic properties of the random walk trajectory. We consider two independent random walks on a hyper-cubic lattice and study ordering probabilities associated with these…
We present results on tagged particle diffusion in a meso-scale lattice model for sheared amorphous material in athermal quasi-static conditions. We find a short time diffusive regime and a long time diffusive regime whose diffusion…
We study the asymptotic behavior of complex discrete evolution equations of Ginzburg- Landau type. Depending on the nonlinearity and the data of the problem, we find different dynamical behavior ranging from global existence of solutions…
In this paper, we study large time behavior of complex-valued solutions to nonlinear Klein-Gordon equation with a gauge invariant quadratic nonlinearity in two spatial dimensions. To find a possible asymptotic behavior, we consider the…
Recent empirical investigations suggest a universal scaling law for the spatial structure of social networks. It is found that the probability density distribution of an individual to have a friend at distance $d$ scales as $P(d)\propto…
In this paper we extend our recent work on two-dimensional (2D) diffusive search-and-capture processes with multiple small targets (narrow capture problems) by considering an asymptotic expansion of the Laplace transformed probability flux…
In this paper, we study the asymptotic behavior, as the time $t$ goes to zero, of the trace of the semigroup of a killed relativistic $\alpha$-stable process in bounded $C^{1,1}$ open sets and bounded Lipschitz open sets. More precisely, we…
A dynamical model of small-world network, with directed links which describe various correlations in social and natural phenomena, is presented. Random responses of every site to the imput message are introduced to simulate real systems.…
In recent work, Jon Kleinberg considered a small-world network model consisting of a d-dimensional lattice augmented with shortcuts. The probability of a shortcut being present between two points decays as a power of the distance between…
We study a discrete-time random walk on the non-negative integers, such that when 0 is reached a jump occurs to an arbitrary location, with given probabilities. We obtain an asymptotic formula for the expected position at large times, in…
Hierarchical statistical models are widely employed in information science and data engineering. The models consist of two types of variables: observable variables that represent the given data and latent variables for the unobservable…