#### Filter Results:

- Full text PDF available (9)

#### Publication Year

2009

2014

- This year (0)
- Last five years (2)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Joseph K. Blitzstein, Persi Diaconis
- Internet Mathematics
- 2011

Random graphs with a given degree sequence are a useful model capturing several features absent in the classical Erd˝ os-Rényi model, such as dependent edges and non-binomial degrees. In this paper, we use a characterization due to Erd˝ os and Gallai to develop a sequential algorithm for generating a random labeled graph with a given degree sequence. The… (More)

- Andrew C. Thomas, Joseph K. Blitzstein
- ArXiv
- 2011

In order to conduct analyses of networked systems where connections between individuals take on a range of values – counts, continuous strengths or ordinal rankings – a common technique is to dichotomize the data according to their positions with respect to a threshold value. However, there are two issues to consider: how the results of the analysis depend… (More)

Scientific investigations on processes on networks (more generally, dyadic relational data) often assume that the initial data collection method on relations between individuals is perfect – that is, the representation given to the connection is without noise or random variation. Other investigations on a network presume that there is an underlying process… (More)

- Ravi Goyal, Victor De Gruttola, Joseph Blitzstein
- Network science
- 2014

Recent research indicates that knowledge about social networks can be leveraged to increase efficiency of interventions (Valente, 2012). However, in many settings, there exists considerable uncertainty regarding the structure of the network. This can render the estimation of potential effects of network-based interventions difficult, as providing… (More)

- Andrew C. Thomas, Joseph K. Blitzstein
- ArXiv
- 2011

Various methods have been proposed for creating a binary version of a complex network with valued ties. Rather than the default method of choosing a single threshold value about which to dichotomize, we consider a method of choosing the highest k outbound arcs from each person and assigning a binary tie, as this has the advantage of minimizing the isolation… (More)

We present a unified approach to modelling dyadic relational data, namely that seen in social, biological and technological networks, without restriction to the binary format. The approach involves three principles: considering the marginal specification of any edge as the fundamental unit, embedding as much dependence as possible in latent structural… (More)

An effectively designed examination process goes far beyond revealing students' knowledge or skills. It also serves as a great teaching and learning tool, incentivizing the students to think more deeply and to connect the dots at a higher level. This extends throughout the entire process: pre-exam preparation, the exam itself, and the post-exam period (the… (More)

- Johan Koskinen, Hugo Zanghi, +20 authors Nitai Mukhopadhyay
- 2009

14:00-14:45 " Network-based auto-probit modeling with application to protein function prediction " Eric D. Kolaczyk 09:35-10:10 " Quantifying and comparing complexity of cellular networks: structure beyond degree statistics " Alessia Annibale and Anthony Coolen 10:10-10:45 " Node and link roles in protein-protein interaction networks " " Using Distinct… (More)

- Judy Maro, Junlong Li, Brian Claggett, Eric Simoneau, Joseph Blitzstein, Grigory Sokolov
- 2014

- ‹
- 1
- ›