Fabien Tarissan

• Ph.D.
• Researcher at French National Centre for Scientific Research

The task of legal precedent retrieval is essential yet challenging for legal professionals, as it involves identifying relevant past cases that can inform current legal decisions. Building on previous work that integrates citation networks and text similarity analysis, we apply these techniques to a dataset comprising paragraphs from cases decided...

While the ever-increasing emergence of online services has led to a growing interest in the development of recommender systems, the algorithms underpinning such systems have begun to be criticized for their role in limiting the variety of content exposed to users. In this context, the notion of diversity has been proposed as a way of mitigating the...

Diversity is a concept relevant to numerous domains of research varying from ecology, to information theory, and to economics, to cite a few. It is a notion that is steadily gaining attention in the information retrieval, network analysis, and artificial neural networks communities. While the use of diversity measures in network-structured data cou...

The chapter argues that the network approach is a viable methodology in legal empirical research, which can be used to study the case law of the Court of Justice. To demonstrate this potential, the chapter: first, shows how to obtain detailed information about the law from the citation network; second, it illustrates how to assess the legal relevan...

This volume has its origins in the 2017 Academy of European Law summer course on the Law of the European Union which focused on new legal approaches to studying the Court of Justice. The chapters explore a number of innovative legal approaches to studying the Court. Each of these approaches differs from the classic, and still dominant, doctrinal wo...

Whether to deal with issues related to information ranking (e.g. search engines) or content recommendation (on social networks, for instance), algorithms are at the core of processes that select which information is made visible. Such algorithmic choices have a strong impact on users’ activity de facto, and therefore on their access to information....

Diversity is a concept relevant to numerous domains of research as diverse as ecology, information theory, and economics, to cite a few. It is a notion that is continuously gaining attention in the information retrieval, network analysis, and artificial neural networks communities. While the use of diversity measures in network-structured data find...

For a long time, researchers have worked on defining different metrics able to characterize the importance of nodes in static networks. Recently, researchers have introduced extensions that consider the dynamics of networks. These extensions study the time-evolution of the importance of nodes, which is an important question that has yet received li...

This study proposes ComSim, a new algorithm to detect communities in bipartite networks. This approach generates a partition of \(\top \) nodes by relying on similarity between the nodes in terms of links towards \(\bot \) nodes. In order to show the relevance of this approach, we implemented and tested the algorithm on 2 small datasets equipped wi...

The degree distribution of the internet, that is, the fraction of routers with k links for any k, is its most studied property. It has a crucial influence on network robustness, spreading phenomena and protocol design. In practice, however, this distribution is observed on partial, biased and erroneous maps. This raises serious concerns about the t...

After being the support of the data and voice convergence, the Internet has become one of the main video providers such as TV-stream. As an alternative to limited or expensive technologies, P2PTV has turned out to be a promising support for such applications. This infrastructure strongly relies on the overlay composed by the peers that consume and...

Document coherence describes how much sense text makes in terms of its logical organisation and discourse flow. Even though coherence is a relatively difficult notion to quantify precisely, it can be approximated automatically. This type of coherence modelling is not only interesting in itself, but also useful for a number of other text processing...

Document coherence describes how much sense text makes in terms of its logical organisation and discourse flow. Even though coherence is a relatively difficult notion to quantify precisely, it can be approximated automatically. This type of coherence modelling is not only interesting in itself, but also useful for a number of other text processing...

Do case citations reflect the " real " importance of individual judgments for the legal system concerned? This question has long been puzzling empirical legal scholars. Existing research typically studies case citation networks as a whole applying traditional network metrics stemming from graph theory. Those approaches are able to detect globally i...

Since the early 2000's, the Internet topology has been an attractive and important research topic, either for developing data collection mechanisms, and for analyzing and modeling the network. Beside traditional aspects of the Inter-net topology (i.e., IP interface, router, and AS levels), recent researches focused on intermediate promising visions...

This paper analyses the multi-level network composed of the legal decisions taken by the International Criminal Court (ICC) since its creation in 2002. As many real-world networks, legal networks lend themselves to the use of graphs in which nodes represent the decisions taken by the Court and links stand for citations between decisions. Although u...

After being the support of the data and voice convergence, the Internet has become one of the main video providers such as TV-stream. As an alternative to limited or expensive technologies, P2PTV has turned out to be a promising support for such applications. This infrastructure strongly relies on the overlay composed by the peers that consume and...

After being the support of the data and voice convergence, the Internet has become one of the main video providers such as TV-stream. As an alternative to limited or expensive technologies, P2PTV has turned out to be a promising support for such applications. This infrastructure strongly relies on the overlay composed by the peers that consume and...

Many studies have proposed to apply artificial intelligence techniques to legal networks, whether it be for highlighting legal reasoning, resolving conflict or extracting information from legal databases. In this context, a new line of research has recently emerged which consists in considering legal decisions as elements of complex networks and co...

For a long time now, researchers have worked ondefining different metrics able to characterize the importanceof nodes in networks. Among them, centrality measures haveproved to be pertinent as they relate the position of a node in thestructure to its ability to diffuse an information efficiently. Thecase of dynamic networks, in which nodes and link...

Many real-world networks based on human activities exhibit a bipartite structure. Although bipartite graphs seem appropriate to analyse and model their properties, it has been shown that standard metrics fail to reproduce intricate patterns observed in real networks. In particular, the overlapping of the neighbourhood of communities is difficult to...

Peer-to-peer systems have driven a lot of attention in the past decade as they have become a major source of Internet traffic. The amount of data flowing through the peer-to-peer network is huge and hence challenging both to comprehend and to control. In this work, we take advantage of a new and rich dataset recording the peer-to-peer activity at a...

Many real-world networks lend themselves to the use of graphs for analysing and modelling their structure. But such a simple representation has proven to miss some important and non trivial properties hidden in the bipartite structure of the networks. Recent papers have shown that overlapping properties seem to be present in bipartite networks and...

The classical approach for Internet topology measurement consists in distributively collecting as much data as possible and merging it into one single piece of topology on which are conducted subsequent analysis. Although this approach may seem reasonable, in most cases network measurements performed in this way suffer from some or all of the follo...

Most current models of the internet rely on knowledge of the degree distribution of its core routers, which plays a key role for simulation purposes. In practice, this distribution is usually observed directly on maps known to be partial, biased and erroneous. This raises serious concerns on the true knowledge one may have of this key property. Her...

Many works have studied the Internet topology, but few have investigated the question of how it evolves over time. This paper focuses on the Internet routing IP-level topology and proposes a first step towards realistic modeling of its dynamics. We study periodic measurements of routing trees from a single monitor to a fixed destination set and ide...

The development of wireless devices led the scientific community to focus more and more on systems of interaction composed of moving entities. In this context, different models have been proposed in an attempt to capture properties of the observed dynamics. Among those models, the edge-Markovian evolving graph model is appealing since it enables to...

Many real-world networks lend themselves to the use of graphs for analysing and modeling their structure. This approach has proved to be very useful for a wide variety of networks stemming from very different fields. Yet, only few papers focused their attention on legal networks. This paper intends precisely to remedy this situation by analysing a...

Confronted to the increasing dynamic of Internet routing system and its underlying topology, we propose a reliability and availability analysis method based on the characterization of the dynamic properties (in particular, the stability properties) of routing paths and their corresponding forwarding paths. The key driver underlying this method is t...

Understanding the spread of information on complex networks is a key issue from a theoretical and applied perspective. Despite the effort in developing theoretical models for this phenomenon, gauging them with large-scale real-world data remains an important challenge due to the scarcity of open, extensive and detailed data. In this paper, we expla...

Analysis of real datasets to characterize the local stability properties of the Internet routing paths suggests that extending the route selection criteria to account for such property would not increase the routing path length. Nevertheless, even if selecting a more stable routing path could be considered as valuable from a routing perspective, it...

Understanding the spread of information on complex networks is a key issue from a theoretical and applied perspective. Despite the effort in developing theoretical models for this phenomenon, gauging them with large-scale real-world data remains an important challenge due to the scarcity of open, extensive and detailed data. In this paper, we expla...

This paper focuses on the Internet IP-level routing topology and proposes relevant explanations to its apparent dynamics. We first represent this topology as a power-law random graph. Then, we incorporate to the graph two well known factors responsible for the observed dynamics, which are load balancing and route evolution. Finally, we simulate on...

Many works have studied the Internet topology, but few have investigated the question of how it evolves over time. This paper focuses on the Internet routing IP-level topology and proposes a first step towards realistic modeling of its dynamics. We study periodic measurements of routing trees from a single monitor to a fixed destination set and ide...

Many contributions rely on the degree distribution of the Internet topology. However, current knowledge of this property is based on biased and erroneous measurements and is subject to much debate. Recently, in [1], a new approach, referred to as the Neighborhood Flooding method, was proposed to avoid issues raised by classical measurements. It aim...

We propose a method employing mathematical programming and global optimization techniques for solving inverse problems arising in biological regulatory network (BRN) reconstruction. This problem consists in estimating unknown parameters of a model that describe the structure and dynamics of a biological system from a set of experimental observation...

This second issue of the French Complex Systems Roadmap is the outcome of the Entretiens de Cargese 2008, an interdisciplinary brainstorming session organized over one week in 2008, jointly by RNSC, ISC-PIF and IXXI. It capitalizes on the first roadmap and gathers contributions of more than 70 scientists from major French institutions. The aim of t...

Complex networks are at the core of an intense research activity. However, in most cases, intricate and costly measurement procedures are needed to explore their structure. In some cases, these measurements rely on link queries: given two nodes, it is possible to test the existence of a link between them. These tests may be costly, and thus minimiz...

Mathematical programming is a language for describing optimization problems; it is based on parameters, decision variables, objective function(s) subject to various types of constraints. The present treatment is concerned with the case when objective(s) and constraints are algebraic mathematical expressions of the parameters and decision variables,...

A “complex system” is in general any system comprised of a great number of heterogeneous entities, among which local interactions create multiple levels of collective structure and organization. Examples include natural systems ranging from bio-molecules and living cells to human social systems and the ecosphere, as well as sophisticated artificial...

The use of process calculi to represent biological systems has led to the design of different formalisms such as brane calculi and κ-calculus. Both have proved to be useful to model different types of biological systems. As an attempt to unify the formalisms, we introduce the -calculus, a simple calculus for describing proteins and cells, in which...

A self-assembly algorithm for synchronising agents and have them arrange according to a particular graph is given. This algorithm, expressed using an ad hoc rule-based process algebra, extends Klavins’ original proposal (Klavin, 2002: Automatic synthesis of controllers for assembly and formation forming. In: Proceedings of the International Confere...

This paper employs mathematical programming and mixed integer linear programming techniques for solving a problem arising in the study of genetic regulatory networks. More precisely, we solve the inverse problem consisting in the determination of the arc weights in the digraph representing the network in such a way that the number of fixed points i...

In this thesis, we propose a formal language, the gk-calcul, stemming from the family of process algebra. This language contrasts in particular with the usual concurrent languages by the lack of dissymmetry traditionally considered between senders and receivers. This point of view entitles to see interactions between elements of the language as col...

RCCS is a variant of Milner's CCS where processes are allowed a controlled form of backtracking. It turns out that the RCCS reinterpretation of a CCS process is equivalent, in the sense of weak bisimilarity, to its causal transition system in CCS. This can be used to develop an ecient method for designing distributed algorithms, which we illustrate...

The use of process calculi to represent biological systems has led to the design of different formalisms such as brane calculi and k-calculus. Both have proved to be useful to model different types of biological systems. As an attempt to unify the formalisms, we introduce the biok-calculus , a simple calculus for describing proteins and cells, in w...

A self-assembly algorithm for synchronising agents and have them arrange according to a particular graph is given. This algorithm, expressed using an ad hoc rule-based process algebra, extends Klavins’ original proposal[1], in that it relies only on point-to-point communication, and can deal with any assembly graph whereas Klavins’ method dealt onl...