1.2k citations · 1.3k across the 7 of their papers we have counts for
7 papers
Kleinberg Navigation in Fractal Small World Networks
Mickey R. Roberson, Daniel ben-Avraham
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…
What is Special about Diffusion on Scale-Free Nets?
Erik M. Bollt, Daniel ben-Avraham
We study diffusion (random walks) on recursive scale-free graphs, and contrast the results to similar studies in other analytically soluble media. This allows us to identify ways i…
One-dimensional continuous-time quantum walks
D. ben-Avraham, E. Bollt, C. Tamon
We survey the equations of continuous-time quantum walks on simple one-dimensional lattices, which include the finite and infinite lines and the finite cycle, and compare them with…
Self-Similarity in Random Collision Processes
Daniel ben-Avraham, Eli Ben-Naim, Katja Lindenberg +1
Kinetics of collision processes with linear mixing rules are investigated analytically. The velocity distribution becomes self-similar in the long time limit and the similarity fun…
A Generalization of both the Method of Images and of the Classical Integral Transforms
Athanassios S. Fokas, Daniel ben-Avraham
A new method for the solution of initial-boundary value problems for evolution PDEs recently introduced by Fokas is generalised to multidimensions. Also the relation of this method…
Geographical Embedding of Scale-Free Networks
Daniel ben-Avraham, Alejandro F. Rozenfeld, Reuven Cohen +1
A method for embedding graphs in Euclidean space is suggested. The method connects nodes to their geographically closest neighbors and economizes on the total physical length of li…