Critical nodes in networks are extremely vulnerable to malicious attacks...
With the rapid evolution and diversification of Internet applications, t...
The wide adoption of social media platforms has brought about numerous
b...
Let G be a graph, which represents a social network, and suppose each no...
We study a rumor spreading model where individuals are connected via a
n...
Consider a graph G with n nodes and m edges, which represents a social
n...
Consider a graph G, representing a social network. Assume that initially...
We prove lower bounds for higher-order methods in smooth non-convex
fini...
We introduce and study a novel majority-based opinion diffusion model.
C...
Consider a graph G and an initial configuration where each node is black...
We show that the graph transformation problem of turning a simple graph ...
Consider a graph G and an initial coloring, where each node is blue or r...
The dynamics of fake news and rumor spreading is investigated using a mo...
Consider a community where initially, each individual is positive or neg...
Assume that you are given a graph G=(V,E) with an initial coloring, wher...
Consider the d-dimensional torus T_L^d and an initial random
configurati...
Assume for a graph G=(V,E) and an initial configuration, where each node...
Assume for a graph G=(V,E) and an initial configuration, where each node...
We study an extremal question for the (reversible) r-bootstrap percolati...
Consider a graph G=(V,E) and a random initial vertex-coloring, where eac...
Consider a graph G=(V,E) and an initial random coloring where each verte...