Matthieu Latapy
Biographic Data
| ID | 635634 |
|---|---|
| NAME | Matthieu Latapy |
| GIVEN NAMES | Matthieu |
| FAMILY NAME | Latapy |
| SIGNATURE | LATAPY M |
| AFFILIATIONS | Centre National de la Recherche Scientifique |
| ORCID | 0000-0002-0975-6109 |
| VERIFIED | Yes |
| TOTAL WORKS | 11 |
| TOTAL CITATIONS | 12 |
| WORKS AS AUTHOR | 10 |
| WORKS AS EDITOR | 1 |
| FIRST PUBLICATION YEAR | 2005 |
| LATEST PUBLICATION YEAR | 2022 |
| H-INDEX | 1 |
A local updating algorithm for personalized PageRank via Chebyshev polynomials
Stream graphs and link streams for the modeling of interactions over time
Trends in Social Network Analysis
Finding remarkably dense sequences of contacts in link streams
Comparing Pedophile Activity in Different P2P Systems
Peer-to-peer (P2P) systems are widely used to exchange content over the Internet. Knowledge of pedophile activity in such networks remains limited, despite having important social consequences. Moreover, though there are different P2P systems in use, previous academic works on this topic focused on one system at a time and their results are not directly comparable. We design a methodology for comparing KAD and eDonkey, two P2P systems among the m…
Internal links and pairs as a new tool for the analysis of bipartite complex networks
Inadequacy of SIR model to reproduce key properties of real-world spreading cascades
Les usages épistémiques des réseaux de communication électronique
L’objet de cet article est d’étendre la notion de cognition distribuée à l’analyse des réseaux de communication sur Internet pour obtenir une meilleure compréhension du rôle joué par la communication électronique dans l’acquisition et la construction de connaissances. Le cas retenu concerne une liste de diffusion destinée aux usagers du logiciel libre, Debian.user.french. Dans cet article, il est suggéré que les réseaux de communication, agencés …
Basic notions for the analysis of large two-mode networks
Computing Communities in Large Networks Using Random Walks
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expensive. We propose here a measure of similarities between vertices based on random walks which has several important advantages: it captures well the community structure in a network, it can be computed efficiently, it works at various scales, and it can be used in an agg…
Computing Communities in Large Networks Using Random Walks
Les usages épistémiques des réseaux de communication électronique
L’objet de cet article est d’étendre la notion de cognition distribuée à l’analyse des réseaux de communication sur Internet pour obtenir une meilleure compréhension du rôle joué par la communication électronique dans l’acquisition et la construction de connaissances. Le cas retenu concerne une liste de diffusion destinée aux usagers du logiciel libre, Debian.user.french. Dans cet article, il est suggéré que les réseaux de communication, agencés …
Stream graphs and link streams for the modeling of interactions over time
Comparing Pedophile Activity in Different P2P Systems
Peer-to-peer (P2P) systems are widely used to exchange content over the Internet. Knowledge of pedophile activity in such networks remains limited, despite having important social consequences. Moreover, though there are different P2P systems in use, previous academic works on this topic focused on one system at a time and their results are not directly comparable. We design a methodology for comparing KAD and eDonkey, two P2P systems among the m…
Internal links and pairs as a new tool for the analysis of bipartite complex networks
Inadequacy of SIR model to reproduce key properties of real-world spreading cascades
Computing Communities in Large Networks Using Random Walks
Computing Communities in Large Networks Using Random Walks
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expensive. We propose here a measure of similarities between vertices based on random walks which has several important advantages: it captures well the community structure in a network, it can be computed efficiently, it works at various scales, and it can be used in an agg…
Basic notions for the analysis of large two-mode networks
Les usages épistémiques des réseaux de communication électronique
L’objet de cet article est d’étendre la notion de cognition distribuée à l’analyse des réseaux de communication sur Internet pour obtenir une meilleure compréhension du rôle joué par la communication électronique dans l’acquisition et la construction de connaissances. Le cas retenu concerne une liste de diffusion destinée aux usagers du logiciel libre, Debian.user.french. Dans cet article, il est suggéré que les réseaux de communication, agencés …
Internal links and pairs as a new tool for the analysis of bipartite complex networks
Inadequacy of SIR model to reproduce key properties of real-world spreading cascades
Comparing Pedophile Activity in Different P2P Systems
Peer-to-peer (P2P) systems are widely used to exchange content over the Internet. Knowledge of pedophile activity in such networks remains limited, despite having important social consequences. Moreover, though there are different P2P systems in use, previous academic works on this topic focused on one system at a time and their results are not directly comparable. We design a methodology for comparing KAD and eDonkey, two P2P systems among the m…
Finding remarkably dense sequences of contacts in link streams
Trends in Social Network Analysis
Stream graphs and link streams for the modeling of interactions over time
A local updating algorithm for personalized PageRank via Chebyshev polynomials
Computer Science (11 works) · Complex Network Analysis Techniques (9 works) · Mathematics (6 works) · Theoretical Computer Science (6 works) · Graph (5 works) · Peer-to-Peer Network Technologies (5 works) · World Wide Web (5 works) · Complex network (3 works) · Artificial Intelligence (2 works) · Combinatorics (2 works)