Greedy Routing and the Algorithmic Small-World Phenomenon

2021 ◽  
Author(s):  
Karl Bringmann ◽  
Ralph Keusch ◽  
Johannes Lengler ◽  
Yannic Maus ◽  
Anisur R. Molla
Keyword(s):  
Small World ◽  
Greedy Routing

scholarly journals Greedy routing in small-world networks with power-law degrees

2014 ◽  
Vol 27 (4) ◽  
pp. 231-253 ◽  
Author(s):  
Pierre Fraigniaud ◽  
George Giakkoupis
Keyword(s):  
Power Law ◽  
Small World ◽  
Greedy Routing ◽  
Small World Networks

Greedy Routing and the Algorithmic Small-World Phenomenon

2017 ◽  
Author(s):  
Karl Bringmann ◽  
Ralph Keusch ◽  
Johannes Lengler ◽  
Yannic Maus ◽  
Anisur Rahaman Molla
Keyword(s):  
Small World ◽  
Greedy Routing

scholarly journals Optimisation of the coalescent hyperbolic embedding of complex networks

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Bianka Kovács ◽  
Gergely Palla
Keyword(s):  
Small World ◽  
Hyperbolic Distance ◽  
Greedy Routing ◽  
Scale Free ◽  
Recent Approach ◽  
Strong Motivation ◽  
Angular Coordinates ◽  
Small World Property ◽  
Logarithmic Loss ◽  
Hyperbolic Embedding

AbstractSeveral observations indicate the existence of a latent hyperbolic space behind real networks that makes their structure very intuitive in the sense that the probability for a connection is decreasing with the hyperbolic distance between the nodes. A remarkable network model generating random graphs along this line is the popularity-similarity optimisation (PSO) model, offering a scale-free degree distribution, high clustering and the small-world property at the same time. These results provide a strong motivation for the development of hyperbolic embedding algorithms, that tackle the problem of finding the optimal hyperbolic coordinates of the nodes based on the network structure. A very promising recent approach for hyperbolic embedding is provided by the noncentered minimum curvilinear embedding (ncMCE) method, belonging to the family of coalescent embedding algorithms. This approach offers a high-quality embedding at a low running time. In the present work we propose a further optimisation of the angular coordinates in this framework that seems to reduce the logarithmic loss and increase the greedy routing score of the embedding compared to the original version, thereby adding an extra improvement to the quality of the inferred hyperbolic coordinates.

Small World

1999 ◽  
Vol 056 (02) ◽  
pp. 0065-0065
Author(s):  
Ch. Hürny ◽  
H. P. Ludin
Keyword(s):  
Small World

Scope of Inhibition: It's a Small World After All

1994 ◽  
Author(s):  
Christine Chiarello ◽  
Lisa Maxfield ◽  
Lorie Richards ◽  
Todd Kahan ◽  
Noel Swann
Keyword(s):  
Small World
Sign in / Sign up

Export Citation Format

Share Document