Follow
Pawel Pralat
Pawel Pralat
Toronto Metropolitan University
Verified email at ryerson.ca - Homepage
Title
Cited by
Cited by
Year
Emergence of segregation in evolving social networks
AD Henry, P Prałat, CQ Zhang
Proceedings of the National Academy of Sciences 108 (21), 8605-8610, 2011
1662011
A spatial web graph model with local influence regions
W Aiello, A Bonato, C Cooper, J Janssen, P Prałat
Internet Mathematics 5 (1-2), 175-196, 2008
1082008
Clustering via hypergraph modularity
B Kamiński, V Poulin, P Prałat, P Szufel, F Théberge
PloS one 14 (11), e0224307, 2019
892019
Chasing robbers on random graphs: zigzag theorem
T Łuczak, P Prałat
Random Structures & Algorithms 37 (4), 516-524, 2010
772010
Cops and robbers from a distance
A Bonato, E Chiniforooshan, P Prałat
Theoretical Computer Science 411 (43), 3834-3844, 2010
732010
On some multicolor Ramsey properties of random graphs
A Dudek, P Prałat
SIAM Journal on Discrete Mathematics 31 (3), 2079-2092, 2017
612017
An alternative proof of the linearity of the size-Ramsey number of paths
A Dudek, P Prałat
Combinatorics, Probability and Computing 24 (3), 551-555, 2015
602015
Models of online social networks
A Bonato, N Hadi, P Horn, P Prałat, C Wang
Internet Mathematics 6 (3), 285-313, 2009
592009
Cops and invisible robbers: The cost of drunkenness
A Kehagias, D Mitsche, P Prałat
Theoretical Computer Science 481, 100-120, 2013
572013
Cleaning a network with brushes
ME Messinger, RJ Nowakowski, P Prałat
Theoretical Computer Science 399 (3), 191-205, 2008
572008
On-line Ramsey numbers for paths and stars
JA Grytczuk, HA Kierstead, P Prałat
Discrete Mathematics & Theoretical Computer Science 10 (Graph and Algorithms), 2008
562008
When does a random graph have constant cop number?
P Pralat
Australas. J Comb. 46, 285-296, 2010
542010
Dimensionality of social networks using motifs and eigenvalues
A Bonato, DF Gleich, M Kim, D Mitsche, P Prałat, Y Tian, SJ Young
PloS one 9 (9), e106052, 2014
472014
Cleaning regular graphs with brushes
N Alon, PŁ PraŁat, N Wormald
SIAM Journal on Discrete Mathematics 23 (1), 233-250, 2009
472009
Artificial benchmark for community detection (abcd)—fast random graph model with community structure
B Kamiński, P Prałat, F Théberge
Network Science 9 (2), 153-178, 2021
462021
Burning graphs: a probabilistic perspective
D Mitsche, P Prałat, E Roshanbin
Graphs and Combinatorics 33, 449-471, 2017
462017
Metric dimension for random graphs
B Bollobás, D Mitsche, P Pralat
arXiv preprint arXiv:1208.3801, 2012
462012
Some typical properties of the spatial preferred attachment model
C Cooper, A Frieze, P Prałat
Internet Mathematics 10 (1-2), 116-136, 2014
452014
Burning number of graph products
D Mitsche, P Prałat, E Roshanbin
Theoretical Computer Science 746, 124-135, 2018
442018
Modularity of Complex Networks Models.
LO Prokhorenkova, P Pralat, AM Raigorodskii
WAW, 115-126, 2016
422016
The system can't perform the operation now. Try again later.
Articles 1–20