Miklós Z. Rácz

Orcid: 0000-0002-8948-2426

According to our database1, Miklós Z. Rácz authored at least 34 papers between 2012 and 2023.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Tree trace reconstruction using subtraces.
J. Appl. Probab., June, 2023

Towards Consensus: Reducing Polarization by Perturbing Social Networks.
IEEE Trans. Netw. Sci. Eng., 2023

Matching Correlated Inhomogeneous Random Graphs using the k-core Estimator.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
An Adversarial Model of Network Disruption: Maximizing Disagreement and Polarization in Social Networks.
IEEE Trans. Netw. Sci. Eng., 2022

Batch Optimization for DNA Synthesis.
IEEE Trans. Inf. Theory, 2022

Local canonical labeling of Erdős-Rényi random graphs.
CoRR, 2022

Exact Community Recovery in Correlated Stochastic Block Models.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021
Rumor Source Detection With Multiple Observations Under Adaptive Diffusions.
IEEE Trans. Netw. Sci. Eng., 2021

A probabilistic view of latent space graphs and phase transitions.
CoRR, 2021

Phase transition in noisy high-dimensional random geometric graphs.
CoRR, 2021

Correlated Stochastic Block Models: Exact Graph Matching with Applications to Recovering Communities.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Approximate Trace Reconstruction: Algorithms.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Finding cliques using few probes.
Random Struct. Algorithms, 2020

Approximate Trace Reconstruction.
CoRR, 2020

Correlated randomly growing graphs.
CoRR, 2020

Network disruption: maximizing disagreement and polarization in social networks.
CoRR, 2020

2019
Finding a planted clique by adaptive probing.
CoRR, 2019

Reconstructing Trees from Traces.
Proceedings of the Conference on Learning Theory, 2019

2018
Optimal Control for Diffusions on Graphs.
SIAM J. Discret. Math., 2018

2017
Braess's paradox for the spectral gap in random graphs and delocalization of eigenvectors.
Random Struct. Algorithms, 2017

How fragile are information cascades?
CoRR, 2017

Clustering Billions of Reads for DNA Data Storage.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Geographic and Temporal Trends in Fake News Consumption During the 2016 US Presidential Election.
Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, 2017

2016
Testing for high-dimensional geometry in random graphs.
Random Struct. Algorithms, 2016

Coexistence in Preferential Attachment Networks.
Comb. Probab. Comput., 2016

Basic models and questions in statistical network analysis.
CoRR, 2016

Sequence assembly from corrupted shotgun reads.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Rate-limited control of systems with uncertain gain.
Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2015
On the Influence of the Seed Graph in the Preferential Attachment Model.
IEEE Trans. Netw. Sci. Eng., 2015

A quantitative Gibbard-Satterthwaite theorem without neutrality.
Comb., 2015

Dynamic Budget-Constrained Pricing in the Cloud.
Proceedings of the Advances in Artificial Intelligence, 2015

2014
From trees to seeds: on the inference of the seed from large trees in the uniform attachment model.
CoRR, 2014

2013
A Smooth Transition from Powerlessness to Absolute Power.
J. Artif. Intell. Res., 2013

2012
Election manipulation: the average case.
SIGecom Exch., 2012


  Loading...