Search Results for author: Fragkiskos Papadopoulos

Found 6 papers, 6 papers with code

Latent geometry and dynamics of proximity networks

1 code implementation28 Jun 2019 Fragkiskos Papadopoulos, Marco Antonio Rodríguez Flores

Here, we show that many of the observed properties of proximity networks emerge naturally and simultaneously in a simple latent space network model, called dynamic-$\mathbb{S}^{1}$.

Physics and Society Statistical Mechanics Social and Information Networks

Similarity forces and recurrent components in human face-to-face interaction networks

1 code implementation2 Aug 2018 Marco Antonio Rodríguez Flores, Fragkiskos Papadopoulos

We show that the social dynamics responsible for the formation of connected components that appear recurrently in face-to-face interaction networks, find a natural explanation in the assumption that the agents of the temporal network reside in a hidden similarity space.

Physics and Society Statistical Mechanics Social and Information Networks

Link persistence and conditional distances in multiplex networks

1 code implementation3 Jul 2018 Fragkiskos Papadopoulos, Kaj-Kolja Kleineberg

We also find that link persistence is significant in all considered multiplexes and can explain their layers' high edge overlap, which cannot be explained by coordinate correlations alone.

Social and Information Networks Data Analysis, Statistics and Probability Physics and Society

Exploiting Path Diversity in Datacenters using MPTCP-aware SDN

1 code implementation30 Nov 2015 Savvas Zannettou, Michael Sirivianos, Fragkiskos Papadopoulos

Usually, MPTCP is combined with flow-based Equal-Cost Multi-Path Routing (ECMP), which uses random hashing to split the MPTCP subflows over different paths.

Networking and Internet Architecture C.2.1

Network Geometry Inference using Common Neighbors

1 code implementation19 Feb 2015 Fragkiskos Papadopoulos, Rodrigo Aldecoa, Dmitri Krioukov

We introduce and explore a new method for inferring hidden geometric coordinates of nodes in complex networks based on the number of common neighbors between the nodes.

Social and Information Networks Networking and Internet Architecture Physics and Society

Network Mapping by Replaying Hyperbolic Growth

1 code implementation20 May 2012 Fragkiskos Papadopoulos, Constantinos Psomas, Dmitri Krioukov

However these promises cannot be readily fulfilled and lead to important practical applications, without a simple, reliable, and fast network mapping method to infer the latent geometric coordinates of nodes in a real network.

Social and Information Networks Statistical Mechanics Networking and Internet Architecture Physics and Society

Cannot find the paper you are looking for? You can Submit a new open access paper.