Pages that link to "Item:Q3301689"

The following pages link to Optimizing spread dynamics on graphs by message passing (Q3301689):

Displaying 13 items.

• Statistical mechanics of the minimum dominating set problem (Q888266) (← links)
• Structure-oriented prediction in complex networks (Q1632515) (← links)
• Minimal contagious sets in random regular graphs (Q2350108) (← links)
• Spreading dynamics in complex networks (Q3301465) (← links)
• The patient-zero problem with noisy observations (Q3301746) (← links)
• Rewiring the network. What helps an innovation to diffuse? (Q3301893) (← links)
• A Max-Sum algorithm for training discrete neural networks (Q3302364) (← links)
• The large deviations of the whitening process in random constraint satisfaction problems (Q3302666) (← links)
• A spin glass approach to the directed feedback vertex set problem (Q3302766) (← links)
• Uncovering the non-equilibrium stationary properties in sparse Boolean networks (Q5078684) (← links)
• A closure for the master equation starting from the dynamic cavity method (Q5888038) (← links)
• An exact method for influence maximization based on deterministic linear threshold model (Q6100686) (← links)
• Hierarchical cycle-tree packing model for optimal \(K\)-core attack (Q6140935) (← links)