PHPaul Horn
Paul Horn
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Paul Horn has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Alexander Tsiatas1 shared publication
- Anthony Bonato
Toronto Metropolitan University
1 shared publication - Changping Wang
Department of Mathematics, Ryerson University, Toronto, Canada
1 shared publication Fan Chung
1 shared publication- Fan Chung
University of California, San Diego
1 shared publication - Linyuan Lu
University of South Carolina
1 shared publication
Latest Publications
- Open Access
Models of on-line social networks
We present a deterministic model for on-line social networks (OSNs) based on transitivity and local knowledge in social interactions. In the Iterated Local Transitivity (ILT) model, at each time-step and for every existing node $x$, a new node appears which joins to the closed neighbour set of $x.$ The ILT model provably satisfies a number of both local and global properties that were observed in OSNs and other real-world complex networks, such as a densification power law, decreasing average distance, and higher clustering than in random graphs with the same average degree. Experimental studies of social networks demonstrate poor expansion properties as a consequence of the existence of communities with low number of inter-community edges. Bounds on the spectral gap for both the adjacency and normalized Laplacian matrices are proved for graphs arising from the ILT model, indicating such bad expansion properties. The cop and domination number are shown to remain the same as the graph from the initial time-step $G_0$, and the automorphism group of $G_0$ is a subgroup of the automorphism group of graphs generated at all later time-steps. A randomized version of the ILT model is presented, which exhibits a tuneable densification power law exponent, and maintains several properties of the deterministic model.Open AccessModels of on-line social networks
We present a deterministic model for on-line social networks (OSNs) based on transitivity and local knowledge in social interactions. In the Iterated Local Transitivity (ILT) model, at each time-step and for every existing node $x$, a new node appears which joins to the closed neighbour set of $x.$ The ILT model provably satisfies a number of both local and global properties that were observed in OSNs and other real-world complex networks, such as a densification power law, decreasing average distance, and higher clustering than in random graphs with the same average degree. Experimental studies of social networks demonstrate poor expansion properties as a consequence of the existence of communities with low number of inter-community edges. Bounds on the spectral gap for both the adjacency and normalized Laplacian matrices are proved for graphs arising from the ILT model, indicating such bad expansion properties. The cop and domination number are shown to remain the same as the graph from the initial time-step $G_0$, and the automorphism group of $G_0$ is a subgroup of the automorphism group of graphs generated at all later time-steps. A randomized version of the ILT model is presented, which exhibits a tuneable densification power law exponent, and maintains several properties of the deterministic model. - 4 March 2011
- Published by Wiley in Journal of Graph Theory
- Vol. 69 (3) , 223-240
Diameter of random spanning trees in a given graph
- 4 March 2011
- Published by Wiley in Journal of Graph Theory
- Vol. 69 (3) , 223-240
Diameter of random spanning trees in a given graph
- 1 January 2009
- Published by Internet Mathematics in Internet Mathematics
- Vol. 6 (2) , 237-254
Distributing Antidote Using PageRank Vectors
- 1 January 2009
- Published by Internet Mathematics in Internet Mathematics
- Vol. 6 (2) , 237-254
Distributing Antidote Using PageRank Vectors