27 citations · 89 across the 18 of their papers we have counts for
29 papers
Towards Consensus: Reducing Polarization by Perturbing Social Networks
Miklos Z. Racz, Daniel E. Rigobon
This paper studies how a centralized planner can modify the structure of a social or information network to reduce polarization. First, polarization is found to be highly dependent…
Exact Community Recovery in Correlated Stochastic Block Models
Julia Gaudio, Miklos Z. Racz, Anirudh Sridhar
We consider the problem of learning latent community structure from multiple correlated networks. We study edge-correlated stochastic block models with two balanced communities, fo…
A probabilistic view of latent space graphs and phase transitions
Suqi Liu, Miklos Z. Racz
We study random graphs with latent geometric structure, where the probability of each edge depends on the underlying random positions corresponding to the two endpoints. We focus o…
Correlated Stochastic Block Models: Exact Graph Matching with Applications to Recovering Communities
Miklos Z. Racz, Anirudh Sridhar
We consider the task of learning latent community structure from multiple correlated networks. First, we study the problem of learning the latent vertex correspondence between two…
Phase transition in noisy high-dimensional random geometric graphs
Suqi Liu, Miklos Z. Racz
We study the problem of detecting latent geometric structure in random graphs. To this end, we consider the soft high-dimensional random geometric graph , whe…
Approximate Trace Reconstruction
Sami Davies, Miklos Z. Racz, Cyrus Rashtchian +1
In the usual trace reconstruction problem, the goal is to exactly reconstruct an unknown string of length after it passes through a deletion channel many times independently, p…
Batch Optimization for DNA Synthesis
Konstantin Makarychev, Miklos Z. Racz, Cyrus Rashtchian +1
Large pools of synthetic DNA molecules have been recently used to reliably store significant volumes of digital data. While DNA as a storage medium has enormous potential because o…
Rumor source detection with multiple observations under adaptive diffusions
Miklos Z. Racz, Jacob Richey
Recent work, motivated by anonymous messaging platforms, has introduced adaptive diffusion protocols which can obfuscate the source of a rumor: a "snapshot adversary" with access t…
Correlated randomly growing graphs
Miklos Z. Racz, Anirudh Sridhar
We introduce a new model of correlated randomly growing graphs and study the fundamental questions of detecting correlation and estimating aspects of the correlated structure. The…
Network disruption: maximizing disagreement and polarization in social networks
Mayee F. Chen, Miklos Z. Racz
Recent years have seen a marked increase in the spread of misinformation, a phenomenon which has been accelerated and amplified by social media such as Facebook and Twitter. While…
Finding a planted clique by adaptive probing
Miklós Z. Rácz, Benjamin Schiffer
We consider a variant of the planted clique problem where we are allowed unbounded computational time but can only investigate a small part of the graph by adaptive edge queries. W…
Reconstructing Trees from Traces
Sami Davies, Miklos Z. Racz, Cyrus Rashtchian
We study the problem of learning a node-labeled tree given independent traces from an appropriately defined deletion channel. This problem, tree trace reconstruction, generalizes s…
Finding cliques using few probes
Uriel Feige, David Gamarnik, Joe Neeman +2
Consider algorithms with unbounded computation time that probe the entries of the adjacency matrix of an vertex graph, and need to output a clique. We show that if the input gr…
How fragile are information cascades?
Yuval Peres, Miklos Z. Racz, Allan Sly +1
It is well known that sequential decision making may lead to information cascades. That is, when agents make decisions based on their private information, as well as observing the…
Optimal control for diffusions on graphs
Laura Florescu, Yuval Peres, Miklos Z. Racz
Starting from a unit mass on a vertex of a graph, we investigate the minimum number of "\emph{controlled diffusion}" steps needed to transport a constant mass outside of the ba…
A smooth transition from Wishart to GOE
Miklos Z. Racz, Jacob Richey
It is well known that an Wishart matrix with degrees of freedom is close to the appropriately centered and scaled Gaussian Orthogonal Ensemble (GOE) if is larg…
Basic models and questions in statistical network analysis
Miklos Z. Racz, Sébastien Bubeck
Extracting information from large graphs has become an important statistical problem since network data is now common in various fields. In this minicourse we will investigate the…
Sequence assembly from corrupted shotgun reads
Shirshendu Ganguly, Elchanan Mossel, Miklos Z. Racz
The prevalent technique for DNA sequencing consists of two main steps: shotgun sequencing, where many randomly located fragments, called reads, are extracted from the overall seque…
Beta-gamma tail asymptotics
Jim Pitman, Miklos Z. Racz
We compute the tail asymptotics of the product of a beta random variable and a generalized gamma random variable which are independent and have general parameters. A special case o…
Braess's paradox for the spectral gap in random graphs and delocalization of eigenvectors
Ronen Eldan, Miklós Rácz, Tselil Schramm
We study how the spectral gap of the normalized Laplacian of a random graph changes when an edge is added to or removed from the graph. There are known examples of graphs where, pe…
Testing for high-dimensional geometry in random graphs
Sébastien Bubeck, Jian Ding, Ronen Eldan +1
We study the problem of detecting the presence of an underlying high-dimensional geometric structure in a random graph. Under the null hypothesis, the observed graph is a realizati…
From trees to seeds: on the inference of the seed from large trees in the uniform attachment model
Sébastien Bubeck, Ronen Eldan, Elchanan Mossel +1
We study the influence of the seed in random trees grown according to the uniform attachment model, also known as uniform random recursive trees. We show that different seeds lead…
Can one hear the shape of a population history?
Junhyong Kim, Elchanan Mossel, Miklós Z. Rácz +1
Reconstructing past population size from present day genetic data is a major goal of population genetics. Recent empirical studies infer population size history using coalescent-ba…
On the influence of the seed graph in the preferential attachment model
Sébastien Bubeck, Elchanan Mossel, Miklós Z. Rácz
We study the influence of the seed graph in the preferential attachment model, focusing on the case of trees. We first show that the seed has no effect from a weak local limit poin…