Matthieu Latapy

Orcid: 0000-0002-0975-6109

Affiliations:
  • LIP6, Paris


According to our database1, Matthieu Latapy authored at least 108 papers between 2000 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Fast and Robust Flocking of Protesters on Street Networks.
CoRR, 2024

Mapping low-resolution edges to high-resolution paths: the case of traffic measurements in cities.
CoRR, 2024

2023
Computing Betweenness Centrality in Link Streams.
J. Graph Algorithms Appl., 2023

Temporal Betweenness Centrality on Shortest Paths Variants.
CoRR, 2023

Link Streams as a Generalization of Graphs and Time Series.
Proceedings of the 5th IEEE International Conference on Cognitive Machine Intelligence, 2023

2022
A local updating algorithm for personalized PageRank via Chebyshev polynomials.
Soc. Netw. Anal. Min., 2022

A Frequency-Structure Approach for Link Stream Analysis.
CoRR, 2022

2021
A logical approach for temporal and multiplex networks analysis.
CoRR, 2021

Generalized Tilings with Height Functions.
CoRR, 2021

Full Bitcoin blockchain data made easy.
Proceedings of the ASONAM '21: International Conference on Advances in Social Networks Analysis and Mining, Virtual Event, The Netherlands, November 8, 2021

2020
Closure coefficients in scale-free complex networks.
J. Complex Networks, 2020

Do you trade with your friends or become friends with your trading partners? A case study in the $\breve {G}1$ cryptocurrency.
Appl. Netw. Sci., 2020

Strongly Connected Components in Stream Graphs: Computation and Experimentations.
Proceedings of the Complex Networks & Their Applications IX, 2020

2019
Do you trade with your friends or become friends with your trading partners? A case study in the G1 cryptocurrency.
CoRR, 2019

Weighted, Bipartite, or Directed Stream Graphs for the Modeling of Temporal Networks.
CoRR, 2019

Degree-based Outlier Detection within IP Traffic Modelled as a Link Stream.
CoRR, 2019

A general graph-based framework for top-N recommendation using content, temporal and trust information.
CoRR, 2019

Link Stream Graph for Temporal Recommendations.
CoRR, 2019

Outlier detection in IP traffic modelled as a link stream using the stability of degree distributions over time.
Comput. Networks, 2019

Link streams: Methods and applications.
Comput. Networks, 2019

2018
Stream graphs and link streams for the modeling of interactions over time.
Soc. Netw. Anal. Min., 2018

Enumerating maximal cliques in link streams with durations.
Inf. Process. Lett., 2018

Pattern Matching in Link Streams: Timed-Automata with Finite Memory.
Sci. Ann. Comput. Sci., 2018

Propagation of content similarity through a collaborative network for live show recommendation.
CoRR, 2018

Predicting interactions between individuals with structural and dynamical information.
CoRR, 2018

Degree-Based Outliers Detection Within IP Traffic Modelled as a Link Stream.
Proceedings of the Network Traffic Measurement and Analysis Conference, 2018

Pattern Matching in Link Streams: A Token-Based Approach.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2018

2017
Tracking bitcoin users activity using community detection on a network of weak signals.
CoRR, 2017

Discovering Patterns of Interest in IP Traffic Using Cliques in Bipartite Link Streams.
CoRR, 2017

Rigorous Measurement of the Internet Degree Distribution.
Complex Syst., 2017

Temporal Recommendation, Long- and Short-term Preferences, Session-based Temporal Graph, Time Weight Content-based Graph, Time-averaged Hit Ratio, PageRank, Injected Preference Fusion..
Proceedings of the 13th International Conference on Web Information Systems and Technologies, 2017

Impact of Temporal Features of Cattle Exchanges on the Size and Speed of Epidemic Outbreaks.
Proceedings of the Computational Science and Its Applications - ICCSA 2017, 2017

Tracking Bitcoin Users Activity Using Community Detection on a Network of Weak Signals.
Proceedings of the Complex Networks & Their Applications VI, 2017

Combining structural and dynamic information to predict activity in link streams.
Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017, Sydney, Australia, July 31, 2017

2016
Computing maximal cliques in link streams.
Theor. Comput. Sci., 2016

Finding remarkably dense sequences of contacts in link streams.
Soc. Netw. Anal. Min., 2016

Efficient and simple generation of random simple connected graphs with prescribed degree sequence.
J. Complex Networks, 2016

Analysis of the Temporal and Structural Features of Threads in a Mailing-List.
Proceedings of the Complex Networks VII, 2016

2015
On the termination of some biclique operators on multipartite graphs.
Discret. Appl. Math., 2015

Expected Nodes: A Quality Function for the Detection of Link Communities.
Proceedings of the Complex Networks VI, 2015

Social Network Analysis of Developers' and Users' Mailing Lists of Some Free Open Source Software.
Proceedings of the 2015 IEEE International Congress on Big Data, New York City, NY, USA, June 27, 2015

Revealing contact patterns among high-school students using maximal cliques in link streams.
Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2015

2014
Identifying roles in an IP network with temporal and structural density.
CoRR, 2014

Detecting events in the dynamics of ego-centred measurements of the Internet topology‡.
J. Complex Networks, 2014

Measuring the degree distribution of routers in the core internet.
Proceedings of the 2014 IFIP Networking Conference, Trondheim, 2014

UDP Ping: A Dedicated Tool for Improving Measurements of the Internet Topology.
Proceedings of the IEEE 22nd International Symposium on Modelling, 2014

Identifying roles in an IP network with temporal and structural density.
Proceedings of the 2014 Proceedings IEEE INFOCOM Workshops, Toronto, ON, Canada, April 27, 2014

Measuring routing tables in the internet.
Proceedings of the 2014 Proceedings IEEE INFOCOM Workshops, Toronto, ON, Canada, April 27, 2014

Complex Networks and Link Streams for the Empirical Analysis of Large Software.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2014

2013
Inadequacy of SIR model to reproduce key properties of real-world spreading cascades: experiments on a large-scale P2P system.
Soc. Netw. Anal. Min., 2013

Internal links and pairs as a new tool for the analysis of bipartite complex networks.
Soc. Netw. Anal. Min., 2013

Quantifying paedophile activity in a large P2P system.
Inf. Process. Manag., 2013

Internal link prediction: A new approach for predicting links in bipartite graphs.
Intell. Data Anal., 2013

Towards a bipartite graph modeling of the internet topology.
Comput. Networks, 2013

2012
Visualisation de grands réseaux dynamiques. Application à la détection d'anomalies de routage dans l'Internet.
Rev. d'Intelligence Artif., 2012

Diffusion Cascades: Spreading Phenomena in Blog Network Communities.
Parallel Process. Lett., 2012

Comparing paedophile activity in different P2P systems
CoRR, 2012

Outskewer: Using Skewness to Spot Outliers in Samples and Time Series.
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2012

Relevance of SIR Model for Real-world Spreading Phenomena: Experiments on a Large-scale P2P System.
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2012

2011
Introduction.
Tech. Sci. Informatiques, 2011

Post-processing hierarchical community structures: Quality improvements and multi-scale view.
Theor. Comput. Sci., 2011

Citations among blogs in a hierarchy of communities: Method and case study.
J. Comput. Sci., 2011

Impact of random failures and attacks on Poisson and power-law random networks.
ACM Comput. Surv., 2011

A Radar for the Internet.
Complex Syst., 2011

A Real-World Spreading Experiment in the Blogosphere.
Complex Syst., 2011

Complex networks.
Comput. Commun., 2011

Quantifying paedophile queries in a large P2P system.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

2010
Detecting events in the dynamics of ego-centered measurements of the internet topology.
Proceedings of the 8th International Symposium on Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks (WiOpt 2010), May 31, 2010

Deciding on the Type of a Graph from a BFS.
Proceedings of the Complex Networks - Second International Workshop, 2010

Termination of Multipartite Graph Series Arising from Complex Network Modelling.
Proceedings of the Combinatorial Optimization and Applications, 2010

2009
The lattice of integer partitions and its infinite extension.
Discret. Math., 2009

Efficient Measurement of Complex Networks Using Link Queries
CoRR, 2009

Fast dynamics in Internet topology: preliminary observations and explanations
CoRR, 2009

Measurement of eDonkey activity with distributed honeypots.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

Ten weeks in the life of an eDonkey server.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

2008
Main-memory triangle computations for very large (sparse (power-law)) graphs.
Theor. Comput. Sci., 2008

Basic notions for the analysis of large two-mode networks.
Soc. Networks, 2008

Fast computation of empirically tight bounds for the diameter of massive graphs.
ACM J. Exp. Algorithmics, 2008

Detection, understanding, and prevention of traceroute measurement artifacts.
Comput. Networks, 2008

Complex computer and communication networks.
Comput. Networks, 2008

Complex Network Measurements: Estimating the Relevance of Observed Properties.
Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

Analyse des grands graphes de terrain.
Proceedings of the COnférence en Recherche d'Infomations et Applications, 2008

2007
Describing and simulating internet routes.
Comput. Networks, 2007

Multi-level analysis of an interaction network between individuals in a mailing-list.
Ann. des Télécommunications, 2007

2006
Preface.
Theor. Comput. Sci., 2006

Computing Communities in Large Networks Using Random Walks.
J. Graph Algorithms Appl., 2006

Theory and Practice of Triangle Problems in Very Large (Sparse (Power-Law)) Graphs
CoRR, 2006

Measuring Fundamental Properties of Real-World Complex Networks
CoRR, 2006

Relevance of massively distributed explorations of the Internet topology: Qualitative results.
Comput. Networks, 2006

Avoiding traceroute anomalies with Paris traceroute.
Proceedings of the 6th ACM SIGCOMM Internet Measurement Conference, 2006

2005
Graph encoding of 2<i>D</i>-gon tilings.
Theor. Comput. Sci., 2005

Fast generation of random connected graphs with prescribed degrees
CoRR, 2005

Complex Network Metrology.
Complex Syst., 2005

Clustering in P2P Exchanges and Consequences on Performances.
Proceedings of the Peer-to-Peer Systems IV, 4th International Workshop, 2005

Relevance of massively distributed explorations of the Internet topology: simulation results.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

Combining the Use of Clustering and Scale-Free Nature of User Exchanges into a Simple and Efficient P2P System.
Proceedings of the Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, Lisbon, Portugal, August 30, 2005

2004
Sandpile models and lattices: a comprehensive survey.
Theor. Comput. Sci., 2004

Bipartite structure of all complex networks.
Inf. Process. Lett., 2004

Comparison of Failures and Attacks on Random and Scale-Free Networks.
Proceedings of the Principles of Distributed Systems, 8th International Conference, 2004

Statistical Analysis of a P2P Query Graph Based on Degrees and Their Time-Evolution.
Proceedings of the Distributed Computing, 2004

Bipartite Graphs as Models of Complex Networks.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 2004

2002
Integer Partitions, Tilings of <i>2D</i>-gons and Lattices.
RAIRO Theor. Informatics Appl., 2002

Coding distributive lattices with Edge Firing Games.
Inf. Process. Lett., 2002

Le treillis des chemins de Delannoy.
Discret. Math., 2002

Efficient and Simple Encodings for the Web Graph.
Proceedings of the Advances in Web-Age Information Management, 2002

2001
Structure of some sand piles model.
Theor. Comput. Sci., 2001

Partitions of an Integer into Powers.
Proceedings of the Discrete Models: Combinatorics, Computation, and Geometry, 2001

2000
Structure of some sand pile model
CoRR, 2000


  Loading...