Add to ORKGAbstract. We consider the domination number for on-line social networks, both in a stochastic network model, and for real-world, networked data. Asymptotic sublinear bounds are rigorously derived for the domination number of graphs generated by the memoryless Geometric Protean random graph model. We establish sublinear upper bounds for the dom-ination number of graphs in the Facebook 100 data set, and these bounds are well-correlated with those predicted by the stochastic model. In addition, we derive bounds for the domi-nation number in classical random geometric graphs. 1
On-line social networks such as Facebook or Myspace are of increasing interest to computer scientist...
This thesis explores three practically important problems related to social networks and proposes so...
Abstract. Vertex pursuit games, such as the game of Cops and Robber, are a simplified model for netw...
Abstract. We consider the domination number for on-line social networks, both in a stochastic net-wo...
Domination is a rapidly developing area of research in graph theory, and its various applications to...
We are looking into variants of a domination set problem in social networks. While randomised algori...
Our aim here is to address the problem of decomposing a whole network into a minimal number of ego–c...
Subgraphs such as cliques, loops and stars form crucial connections in the topologies of real-world ...
Abstract. In this note, we study the independent domination number in the random graph G(n, p). We s...
Abstract. We present a deterministic model for on-line social networks (OSNs) based on transitivity ...
In a communication network the resistance of network is the response to any disruption in some of st...
Abstract In this paper we devise a generative random network model with core–periphery properties wh...
Millions of people use online social networking sites such as Facebook, Twitter, WhatsApp, Instagram...
A number of recent studies have focused on the structure, function, and evolution of on-line social ...
We study the link structure of on-line social networks (OSNs), and introduce a new model for such ne...
On-line social networks such as Facebook or Myspace are of increasing interest to computer scientist...
This thesis explores three practically important problems related to social networks and proposes so...
Abstract. Vertex pursuit games, such as the game of Cops and Robber, are a simplified model for netw...
Abstract. We consider the domination number for on-line social networks, both in a stochastic net-wo...
Domination is a rapidly developing area of research in graph theory, and its various applications to...
We are looking into variants of a domination set problem in social networks. While randomised algori...
Our aim here is to address the problem of decomposing a whole network into a minimal number of ego–c...
Subgraphs such as cliques, loops and stars form crucial connections in the topologies of real-world ...
Abstract. In this note, we study the independent domination number in the random graph G(n, p). We s...
Abstract. We present a deterministic model for on-line social networks (OSNs) based on transitivity ...
In a communication network the resistance of network is the response to any disruption in some of st...
Abstract In this paper we devise a generative random network model with core–periphery properties wh...
Millions of people use online social networking sites such as Facebook, Twitter, WhatsApp, Instagram...
A number of recent studies have focused on the structure, function, and evolution of on-line social ...
We study the link structure of on-line social networks (OSNs), and introduce a new model for such ne...
On-line social networks such as Facebook or Myspace are of increasing interest to computer scientist...
This thesis explores three practically important problems related to social networks and proposes so...
Abstract. Vertex pursuit games, such as the game of Cops and Robber, are a simplified model for netw...