Spreading Phenomena

The Guild of Arcane Topology is investigating the unusual behavior of the spell known as Chaotic Lumen. The spell travels along the magical bonds that connect the mages, but its spread is strongly influenced by how uneven these connections are.

Most apprentices maintain only one or two weak links, while a handful of renowned archmages act as powerful hubs, channeling magic through dozens of pathways. Because of this imbalance, the guild’s network is far from uniform, and the strength of the spell’s propagation must account for this irregular structure.

After surveying the guild, the archivists report the following structural measures of the connection network:

  • Average number of magical links: <k> = 4
  • Second moment of the link distribution: <k²> = 40

Uncover the critical threshold and discern what it reveals about the fate of the Chaotic Lumen.

A) λc = 0.1. If the magic-transfer intensity exceeds this value, the spell can spread through the guild.
B) λc = 0.1. If the magic-transfer intensity exceeds this value, the spell dissipates and cannot spread.
C) λc = 10. Only extremely strong magic would allow the spell to spread.
D) λc = 0.01. The network is homogeneous and requires very high intensity for spreading.
E) None of the above.

Original idea by: Aline Azevedo

Comments

  1. Joao MeidanisNovember 22, 2025 at 10:11 AM

    Boa questão, mas de qual modelo estamos falando? SI, SIS, ou SIR?

    ReplyDelete

Post a Comment

Popular posts from this blog

Dogs, Friends, and Paths at Praça da Paz

Image
Six dogs are happily playing at Praça da Paz, Barão Geraldo . Each dog is a node , and each friendship (two dogs playing together) is an edge .   Considering the above  undirected network of dog friendships, which of the following statements is correct ? A)  The clustering coefficient of node Violeta is 0 B)  Ginger is very social and her clustering coefficient is 0.5, participating in more than one triangle C) The shortest path from Mindú to Violeta has length 4 D)  The average degree of the nodes ⟨k⟩  is 2.375, and the degree distribution shows that three nodes have degree 1 E)   None of the above   Original idea by: Aline Azevedo
Read more

Barabási–Albert Model

You are an analyst for a streaming platform called StreamWorld , which works like a social network: each movie is a node, and connections between movies represent users who watched both. StreamWorld grows following a pattern similar to the Barabási–Albert model : Each new movie connects to m = 3 existing movies. The probability of a movie receiving a new connection is proportional to the number of connections it already has (preferential attachment). At the start ( t = 0 ), there are m₀ = 5 fully connected movies. At time t = 12000 , the network has N = 12000 + m₀ movies, and three movies were released: - Movie A at t A = 100 - Movie B at t B = 1000 - Movie C at t C = 4000 Which of the following is the correct ranking of their expected degrees k i (t) from largest to smallest , what is the approximate ratio between the larges...
Read more

Random Graph - Erdős-Rényi

Consider a connected Erdős-Rényi random graph \( G(n, p) \) with \( n = 100 \) nodes and edge probability \( p = 0.1 \). The average degree is \( \langle k \rangle = 10 \). Which of the following statements is correct? The degree distribution is concentrated around the mean, the average distance scales linearly with \( n \), and the clustering coefficient is \( 0.05 \). The degree distribution is approximately Poisson, the average distance is 2, and the clustering coefficient is roughly equal to \( p \). The degree distribution is uniform, the average distance is independent of \( n \), and the clustering coefficient grows with \( n \). The degree distribution is Poisson, the average distance is 3, and the clustering coefficient is zero. None of the above Original idea by: Aline Azevedo
Read more