Martin Sterchi

Martin Sterchi

Auto-generated profile, based on publicly available information

Martin Sterchi

Department of Informatics, University of Zürich, Zürich, Switzerland

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
31 May 2019 in PLOS ONE
Verified
Journal Article
Open access
PDF file
MSMartin Sterchi
Martin Sterchi
CFCéline Faverjon
Céline Faverjon
CSCristina Sarasua
Cristina Sarasua
MVMaria Elena Vargas
Maria Elena Vargas
JBJohn Berezowski
John Berezowski
HNHeiko Nathues
Heiko Nathues
The topology of animal transport networks contributes substantially to how fast and to what extent a disease can transmit between animal holdings. Therefore, public authorities in many countries mandate livestock holdings to report all movements of animals. However, the reported data often does not contain information about the exact sequence of transports, making it impossible to assess the effect of truck sharing and truck contamination on disease transmission. The aim of this study was to analyze the topology of the Swiss pig transport network by means of social network analysis and to assess the implications for disease transmission between animal holdings. In particular, we studied how additional information about transport sequences changes the topology of the contact network. The study is based on the official animal movement database in Switzerland and a sample of transport data from one transport company. The results show that the Swiss pig transport network is highly fragmented, which mitigates the risk of a large-scale disease outbreak. By considering the time sequence of transports, we found that even in the worst case, only 0.34% of all farm-pairs were connected within one month. However, both network connectivity and individual connectedness of farms increased if truck sharing and especially truck contamination were considered. Therefore, the extent to which a disease may be transmitted between animal holdings may be underestimated if we only consider data from the official animal movement database. Our results highlight the need for a comprehensive analysis of contacts between farms that includes indirect contacts due to truck sharing and contamination. As the nature of animal transport networks is inherently temporal, we strongly suggest the use of temporal network measures in order to evaluate individual and overall risk of disease transmission through animal transportation.

13 February 2017
Verified
Book Chapter
Closed access
PDF file
MSMartin Sterchi
Martin Sterchi
MWMichael Wolf
Michael Wolf

13 July 2023 in Scientific Reports
Verified
Journal Article
Open access
PDF file
MSMartin Sterchi
Martin Sterchi
LHLorenz Hilfiker
Lorenz Hilfiker
RGRolf Grütter
Rolf Grütter
ABAbraham Bernstein
Abraham Bernstein
The problem of identifying the source of an epidemic (also called patient zero) given a network of contacts and a set of infected individuals has attracted interest from a broad range of research communities. The successful and timely identification of the source can prevent a lot of harm as the number of possible infection routes can be narrowed down and potentially infected individuals can be isolated. Previous research on this topic often assumes that it is possible to observe the state of a substantial fraction of individuals in the network before attempting to identify the source. We, on the contrary, assume that observing the state of individuals in the network is costly or difficult and, hence, only the state of one or few individuals is initially observed. Moreover, we presume that not only the source is unknown, but also the duration for which the epidemic has evolved. From this more general problem setting a need to query the state of other (so far unobserved) individuals arises. In analogy with active learning, this leads us to formulate the active querying problem. In the active querying problem, we alternate between a source inference step and a querying step. For the source inference step, we rely on existing work but take a Bayesian perspective by putting a prior on the duration of the epidemic. In the querying step, we aim to query the states of individuals that provide the most information about the source of the epidemic, and to this end, we propose strategies inspired by the active learning literature. Our results are strongly in favor of a querying strategy that selects individuals for whom the disagreement between individual predictions, made by all possible sources separately, and a consensus prediction is maximal. Our approach is flexible and, in particular, can be applied to static as well as temporal networks. To demonstrate our approach’s practical importance, we experiment with three empirical (temporal) contact networks: a network of pig movements, a network of sexual contacts, and a network of face-to-face contacts between residents of a village in Malawi. The results show that active querying strategies can lead to substantially improved source inference results as compared to baseline heuristics. In fact, querying only a small fraction of nodes in a network is often enough to achieve a source inference performance comparable to a situation where the infection states of all nodes are known.

19 February 2021 in Applied Network Science
Verified
Journal Article
Open access
PDF file
MSMartin Sterchi
Martin Sterchi
CSCristina Sarasua
Cristina Sarasua
RGRolf Grütter
Rolf Grütter
ABAbraham Bernstein
Abraham Bernstein
Epidemic spreading is a widely studied process due to its importance and possibly grave consequences for society. While the classical context of epidemic spreading refers to pathogens transmitted among humans or animals, it is straightforward to apply similar ideas to the spread of information (e.g., a rumor) or the spread of computer viruses. This paper addresses the question of how to optimally select nodes for monitoring in a network of timestamped contact events between individuals. We consider three optimization objectives: the detection likelihood, the time until detection, and the population that is affected by an outbreak. The optimization approach we use is based on a simple greedy approach and has been proposed in a seminal paper focusing on information spreading and water contamination. We extend this work to the setting of disease spreading and present its application with two example networks: a timestamped network of sexual contacts and a network of animal transports between farms. We apply the optimization procedure to a large set of outbreak scenarios that we generate with a susceptible-infectious-recovered model. We find that simple heuristic methods that select nodes with high degree or many contacts compare well in terms of outbreak detection performance with the (greedily) optimal set of nodes. Furthermore, we observe that nodes optimized on past periods may not be optimal for outbreak detection in future periods. However, seasonal effects may help in determining which past period generalizes well to some future period. Finally, we demonstrate that the detection performance depends on the simulation settings. In general, if we force the simulator to generate larger outbreaks, the detection performance will improve, as larger outbreaks tend to occur in the more connected part of the network where the top monitoring nodes are typically located. A natural progression of this work is to analyze how a representative set of outbreak scenarios can be generated, possibly taking into account more realistic propagation models.

25 November 2019
Verified
Book Chapter
Closed access
PDF file
MSMartin Sterchi
Martin Sterchi
CSCristina Sarasua
Cristina Sarasua
RGRolf Grütter
Rolf Grütter
ABAbraham Bernstein
Abraham Bernstein

16 November 2025 in Data in Brief
Verified
Journal Article
Open access
MSMartin Sterchi
Martin Sterchi
EREmily Raubach
Emily Raubach
LHLorenz Hilfiker
Lorenz Hilfiker
Public transport networks are frequently studied in the field of network science, including applications in epidemic modeling, infrastructure optimization, and machine learning. This paper introduces four representations of a Swiss railway network. The dataset is derived from open data sources of Swiss public transport companies and is the result of several data processing steps as well as a manual validation. In all four representations, nodes represent train stations, embedded in geographic space, making the network an example of a spatial network influenced by physical constraints such as mountains and lakes. The edge definitions vary, however. Edges connect (1) any pair of nodes with a train connection for which no train change is required, (2) any pair of nodes with a non-stop train connection, and (3) any pair of nodes that correspond to physically adjacent stations. The fourth representation corresponds to a temporal network in which each edge is attributed with the start and duration of a train connection.