30 citations · 59 across the 11 of their papers we have counts for
13 papers
Social Learning of Ranking: Getting the Top Right despite Local Herding
Shahrzad Haddadan, Jie Gao
In sequential learning, a group of agents sequentially receives a noisy private signal and observes the predictions of prior agents to estimate a hidden ground truth. While extensi…
Generalized Top-k Mallows Model for Ranked Choices
Shahrzad Haddadan, Sara Ahmadian
The classic Mallows model is a foundational tool for modeling user preferences. However, it has limitations in capturing real-world scenarios, where users often focus only on a lim…
Optimally Improving Cooperative Learning in a Social Setting
Shahrzad Haddadan, Cheng Xin, Jie Gao
We consider a cooperative learning scenario where a collection of networked agents with individually owned classifiers dynamically update their predictions, for the same classifica…
DeMEtRIS: Counting (near)-Cliques by Crawling
Suman K. Bera, Jayesh Choudhari, Shahrzad Haddadan +1
We study the problem of approximately counting cliques and near cliques in a graph, where the access to the graph is only available through crawling its vertices; thus typically se…
The Drift of #MyBodyMyChoice Discourse on Twitter
Cristina Menghini, Justin Uhr, Shahrzad Haddadan +3
#MyBodyMyChoice is a well-known hashtag originally created to advocate for women's rights, often used in discourse about abortion and bodily autonomy. The Covid-19 outbreak prompte…
Fast Doubly-Adaptive MCMC to Estimate the Gibbs Partition Function with Weak Mixing Time Bounds
Shahrzad Haddadan, Yue Zhuang, Cyrus Cousins +1
We present a novel method for reducing the computational complexity of rigorously estimating the partition functions (normalizing constants) of Gibbs (Boltzmann) distributions, whi…
RePBubLik: Reducing the Polarized Bubble Radius with Link Insertions
Shahrzad Haddadan, Cristina Menghini, Matteo Riondato +1
The topology of the hyperlink graph among pages expressing different opinions may influence the exposure of readers to diverse content. Structural bias may trap a reader in a polar…
The Wedge Picking Model: A dynamic graph model based on triadic closure
Sara Ahmadian, Shahrzad Haddadan
Social networks have become an inseparable part of human life and processing them in an efficient manner is a top priority in the study of networks. These networks are highly dynam…
Making mean-estimation more efficient using an MCMC trace variance approach: DynaMITE
Cyrus Cousins, Shahrzad Haddadan, Eli Upfal
We introduce a novel statistical measure for MCMC-mean estimation, the inter-trace variance , which depends on a Markov chain and a fu…
On the Complexity of Sampling Nodes Uniformly from a Graph
Flavio Chierichetti, Shahrzad Haddadan
We study a number of graph exploration problems in the following natural scenario: an algorithm starts exploring an undirected graph from some seed node; the algorithm, for an arbi…
Mixing Time for Some Adjacent Transposition Markov Chains
Shahrzad Haddadan, Peter Winkler
We prove rapid mixing for certain Markov chains on the set of permutations on in which adjacent transpositions are made with probabilities that depend on the it…
The expected jaggedness of order ideals
Melody Chan, Shahrzad Haddadan, Sam Hopkins +1
The jaggedness of an order ideal I in a poset P is the number of maximal elements in I plus the number of minimal elements of P not in I. A probability distribution on the set of o…
Some Instances of Homomesy Among Ideals of Posets
Shahrzad Haddadan
Given a permutation defined on a set of combinatorial objects , together with some statistic , we say that the triple exh…