In this paper, we investigate the problem of (k, r)-core which intends to find cohesive
subgraphs on social networks considering both user engagement and similarity …

We consider a model of user engagement in social networks, where each player incurs a
cost to remain engaged but derives a benefit proportional to the number of engaged …

In social networks, the leave of critical users may significantly break network engagement,
ie, lead a large number of other users to drop out. A popular model to measure social …

In this paper, we study the problem of the anchored k-core. Given a graph G, an integer k
and a budget b, we aim to identify b vertices in G so that we can determine the largest …

A popular model to measure the stability of a network is k-core-the maximal induced
subgraph in which every vertex has at least k neighbors. Many studies maximize the number …

The stability of a social network has been widely studied as an important indicator for both
the network holders and the participants. Existing works on reinforcing networks focus on a …

User engagement and tie strength are fundamental and important components in social
networks. The model of k-truss not only captures actively engaged users, but also ensures …

Community search is a problem that seeks cohesive and connected subgraphs in a graph
that satisfy certain topology constraints, eg, degree constraints. The majority of existing …

In social networks, the departure of some users can lead to the dropout of others from the
community in cascade. Therefore, the engagement of critical users can significantly …

User engagement has recently received significant attention in understanding the decay and
expansion of communities in many online social networking platforms. When a user chooses …