Temporal evolution of social networks in Paltalk™

Mahdi, Khaled; Farahat, Hisham; Safar, Maytham

doi:10.1145/1497308.1497330

Cited by 12 publications

(19 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The robustness measures the strength of the network to resist failures and attacks. Robustness of a network is measured by finding its entropy [8]. Entropy of a network is calculated by the evaluation of the cycles degree distribution, which requires counting the number of cycles existing in the network.…”

Section: Co-published By Atlantis Press and Taylor And Francismentioning

confidence: 99%

“…Here, we propose an efficient approximation algorithm that is based on the work in [14]. It is based on the algorithm that has been introduced in [10].…”

Section: Regression-based Approximation Solutionmentioning

confidence: 99%

“…Refer to [5,14] for further details on the above equations. The procedure explained above is repeated starting from an initial value of u u 0 to u u max .…”

Section: Regression-based Approximation Solutionmentioning

confidence: 99%

“…In this experiment [8] a grid of 30 Mac Pro machines watch with two 2.66 dual core Intel processors, which gives a total of 319.2 GHZ processor power. One extra machine is used to control the grid and distribute the tasks to the machines (called clients).…”

Section: Exact Algorithmmentioning

confidence: 99%

See 3 more Smart Citations

Approximate cycles count in undirected graphs

Safar¹,

Mahdi²,

Farahat³

et al. 2014

IJCIS

Self Cite

View full text Add to dashboard Cite

In social networks, counting the number of different cycle sizes can be used to measure the entropy of the network that represents its robustness. The exact algorithms to compute cycles in a graph can generate exact results but they are not guaranteed to run in a polynomial time. We present an approximation algorithm for counting the number of cycles in an undirected graph. The algorithm is regression-based and guaranteed to run in a polynomial time. A set of experiments are conducted to compare the results of our approximate algorithm with the results of an exact algorithm based on the Donald-Johnson backtracking algorithm.

show abstract

Section: Co-published By Atlantis Press and Taylor And Francismentioning

confidence: 99%

“…Here, we propose an efficient approximation algorithm that is based on the work in [14]. It is based on the algorithm that has been introduced in [10].…”

Section: Regression-based Approximation Solutionmentioning

confidence: 99%

“…Refer to [5,14] for further details on the above equations. The procedure explained above is repeated starting from an initial value of u u 0 to u u max .…”

Section: Regression-based Approximation Solutionmentioning

confidence: 99%

Section: Exact Algorithmmentioning

confidence: 99%

See 2 more Smart Citations

Approximate cycles count in undirected graphs

Safar¹,

Mahdi²,

Farahat³

et al. 2014

IJCIS

Self Cite

View full text Add to dashboard Cite

show abstract

“…Robustness of a network is measured by finding its entropy [1]. Entropy can be measured by counting number of cycles in the graph, which is the focus of this paper.…”

Section: Introductionmentioning

confidence: 99%

Counting cycles in an undirected graph using DFS-XOR algorithm

Safar

Alenzi

Albehairy

2009

2009 First International Conference on Networked Digital Technologies

Self Cite

View full text Add to dashboard Cite

We present an algorithm for counting the number of cycles in an undirected graph. The given algorithm generates exact results but it is not guaranteed to run in a polynomial time. Afterwards, an approximated version from the algorithm guaranteed to run in a polynomial time will be introduced. The obtained results will be used to measure the entropy of graphs. Entropy represents robustness of the graph under analysis. An experiment is conducted to compare the results of our algorithm with the results of another algorithm based on the Donald Johnson backtracking algorithm.

show abstract

Influence of Social Networks on Recovering Large Scale Distributed Systems

Ren

Luo

et al. 2009

Principles of Practice in Multi-Agent Systems

View full text Add to dashboard Cite

Temporal evolution of social networks in Paltalk™

Cited by 12 publications

References 3 publications

Approximate cycles count in undirected graphs

Approximate cycles count in undirected graphs

Counting cycles in an undirected graph using DFS-XOR algorithm

Influence of Social Networks on Recovering Large Scale Distributed Systems

Contact Info

Product

Resources

About