Huseyin Acan, Ph.D.

Affiliations: 
2013 Mathematics Ohio State University, Columbus, Columbus, OH 
Area:
Mathematics
Google:
"Huseyin Acan"

Parents

Sign in to add mentor
Boris G. Pittel grad student 2013 Ohio State
 (An enumerative-probabilistic study of chord diagrams.)
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Acan H, Pittel BG. (2020) On connectivity, conductance and bootstrap percolation for a random k‐out, age‐biased graph Random Structures and Algorithms. 56: 37-62
Acan H, Devlin P, Kahn J. (2019) Proof of an entropy conjecture of Leighton and Moitra Journal of Combinatorial Theory, Series A. 161: 299-308
Acan H, Kahn J. (2019) Disproof of a packing conjecture of Alon and Spencer Random Structures and Algorithms. 55: 531-544
Acan H, Collevecchio A, Mehrabian A, et al. (2017) On the Push&Pull Protocol for Rumor Spreading Siam Journal On Discrete Mathematics. 31: 647-668
Acan H, Pittel BG. (2017) Formation of a giant component in the intersection graph of a random chord diagram Journal of Combinatorial Theory, Series B. 125: 33-79
Acan H. (2017) On a uniformly random chord diagram and its intersection graph Discrete Mathematics. 340: 1967-1985
Acan H, Hitczenko P. (2016) On a memory game and preferential attachment graphs Advances in Applied Probability. 48: 585-609
Acan H, Hitczenko P. (2016) On random trees obtained from permutation graphs Discrete Mathematics. 339: 2871-2883
Acan H, Hitczenko P. (2015) On the covariances of outdegrees in random plane recursive trees Journal of Applied Probability. 52: 904-907
Acan H, Collevecchio A, Mehrabian A, et al. (2015) On the push & pull protocol for rumour spreading Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 2015: 405-412
See more...