Question about Spreading Phenomena

A research team is investigating the spread of a pathogen in a large contact network using an SIR model. During simulations, they obtained the following three observations:

  • Observation A: When β is increased while μ is kept fixed, the distribution of outbreak sizes shows a sudden transition from mostly small outbreaks to frequent large outbreaks.
  • Observation B: In networks with highly irregular degree distributions, a small fraction of nodes is responsible for the vast majority of early transmissions.
  • Observation C: After the outbreak peaks, the number of infectious nodes always decreases to zero, even when β ≫ μ. 

The team proposes the following four hypotheses to explain the observations:

  1. A corresponds to the existence of an epidemic threshold related to the transmissibility T = β/(β + μ).
  2. B indicates that heterogeneity in the degree distribution affects both the threshold condition and the probability of large outbreaks.
  3. C implies that the SIR model can exhibit a sustained endemic steady state when β is sufficiently large.
  4. A and B together suggest that the critical point for epidemic spreading depends on the ratio ⟨k²⟩ / ⟨k⟩.

Which set of hypotheses is consistent with all three observations?

A) Only 1 and 2.
B) Only 1, 2, and 3.
C) Only 1, 2, and 4.
D) Only 2, 3, and 4.
E) None of the above.


Original idea by: Mateus de Padua Vicente

Comentários

  1. Joao Meidanis29 de novembro de 2025 às 08:35

    Questão interessante, mas muito complexa. Em particular, a observação B parece fora da realidade, pois se os pesquisadores estão observando uma situação específica, como podem observar coisas a respeito de redes com distribuições irregulares em geral?

    ResponderExcluir

Postar um comentário

Postagens mais visitadas deste blog

Question about DFS and BFS

Consider a graph G = ( V , E ) G = (V, E) , and the Depth-First Search (DFS) and Breadth-First Search (BFS) algorithms. Analyze the following statements: I. In a DFS execution on a directed graph, the classification of edges as tree, forward, backward, and cross edges depends on the order in which vertices are explored. II. In a BFS executed from a source vertex s s  in an unweighted graph, the order in which vertices are discovered at the same level may vary depending on the order of edges in the adjacency list of the graph, but the minimum distance from each vertex to s s  remains unchanged. III. In directed graphs, a back edge detected during DFS indicates the presence of at least one cycle that includes the origin vertex of the edge. IV. In undirected graphs, BFS can detect all cycles of length 3 (triangles), but it does not guarantee detection of larger cycles. V. DFS guarantees that in a connected undirected graph, the tree generated contains exactly ∣ V ∣ − 1 |V| -...
Leia mais

Question about Traveling Salesperson Problem

Consider the symmetric  Traveling Salesperson Problem (TSP)  on a complete and weighted graph that  satisfies the  triangle inequality .  A student has applied different approaches to find near-optimal tours and has given the following statements: I. The  Closest Neighbor  heuristic always produces a tour whose cost is at most twice the optimum, provided that the graph satisfies the triangle inequality. II. The  Cheapest Insertion  heuristic typically improves over the Closest Neighbor method but does not guarantee any fixed approximation ratio in the general case. III. The  Rosenkrantz–Stearns–Lewis algorithm , based on doubling the minimum spanning tree and shortcutting, guarantees a solution within a factor of 2 of the optimum. IV. The  Christofides algorithm  improves on the MST-doubling approach by adding a minimum-weight perfect matching among the odd-degree vertices of the MST, achieving a 1.5 approximation bound. Which ...
Leia mais

Question about Communities

A group of network scientists is analyzing a large social network to uncover community structures. They are evaluating several theoretical principles and algorithmic strategies to decide which framework better explains the observed patterns. After reviewing the literature, they make the following statements: I. A community structure should balance internal density and external sparsity; however, a subgraph that maximizes internal density alone may fail to capture community boundaries consistent with the overall network topology. II. In hierarchical clustering of networks, bottom-up strategies tend to merge nodes with high topological similarity or shared neighbors, while top-down strategies progressively dismantle inter-community links that maintain global connectivity. III. The distinction between strong and weak communities reflects whether the internal–external link condition must hold for each vertex individually or only on average for the entire subgraph. IV.  Finding all...
Leia mais