Fetching the paper…
Reading the bibliography…
We introduce a class of generative network models that insert edges by connecting the starting and terminal vertices of a random walk on the network graph.
Auxiliary particle filtering within adaptive Metropolis-Hastings sampling
Pitt, M., Silva, R., Giordani, P., and Kohn, R. (2010) · 1914
Earlier work this paper cites.
Turrialba: Social Systems and the Introduction of Change
Loomis, C. P., Morales, J. O., Clifford, R. A., and Leonard, O. E. (1953) · 1953
Earlier work this paper cites.
Sampling and Bayes’ inference in scientific modelling and robustness
Box, G. E. P. (1980) · 1980
Earlier work this paper cites.
Simulating probability distributions in the coalescent
Griffiths, R. and Tavaré, S. (1994) · 1994
Earlier work this paper cites.
Posterior predictive assessment of model fitness via realized discrepancies
Gelman, A., Meng, X., and Stern, H. (1996) · 1996
Earlier work this paper cites.
Spectral Graph Theory (CBMS Regional Conference Series in Mathematics, No. 92)
Chung, F. (1997) · 1997
Earlier work this paper cites.
Emergence of scaling in random networks
Barabási, A.-L. and Albert, R. (1999) · 1999
Earlier work this paper cites.
Discrete Green’s functions
Chung, F. and Yau, S.-T. (2000) · 2000
Earlier work this paper cites.
Random evolution in massive graphs
Aiello, W., Chung, F., and Lu, L. (2002) · 2002
Earlier work this paper cites.
Latent space approaches to social network analysis
Hoff, P. D., Raftery, A. E., and Handcock, M. S. (2002) · 2002
Earlier work this paper cites.
On‐line inference for hidden Markov models via particle filters
Fearnhead, P. and Clifford, P. (2003) · 2003
Earlier work this paper cites.
Kernels and regularization on graphs
Smola, A. J. and Kondor, I. (2003) · 2003
Earlier work this paper cites.
Monte Carlo Statistical Methods
Robert, C. P. and Casella, G. (2004) · 2004
Earlier work this paper cites.
Interaction network containing conserved and essential protein complexes in escherichia coli
Butland, G., Peregrin-Alvarez, J. M., Li, J., Yang, W., Yang, X., Canadien, V., Starostine, A., Richards, D., Beattie, B., Krogan, N., Davey, M., Parkinson, J., Greenblatt, J., and Emili, A. (2005) · 2005
Earlier work this paper cites.
Diffusion kernels on statistical manifolds
Lafferty, J. and Lebanon, G. (2005) · 2005
Earlier work this paper cites.
Interacting particle systems
Liggett, T. M. (2005) · 2005
Earlier work this paper cites.
The maximum degree of the Barabási–Albért random tree
Móri, T. F. (2005) · 2005
Earlier work this paper cites.
Pajek datasets
Batagelj, V. and Mrvar, A. (2006) · 2006
Earlier work this paper cites.
Complex Graphs and Networks
Chung, F. and Lu, L. (2006) · 2006
Earlier work this paper cites.
Random Graph Dynamics
Durrett, R. (2006) · 2006
Earlier work this paper cites.
Learning systems of concepts with an infinite relational model
Kemp, C., Tenenbaum, J., Griffiths, T., Yamada, T., and Ueda, N. (2006) · 2006
Cited alongside, same era.
Combinatorial Stochastic Processes
Pitman, J. (2006) · 2006
Cited alongside, same era.
Computing communities in large networks using random walks
Pons, P. and Latapy, M. (2006) · 2006
Cited alongside, same era.
A likelihood approach to analysis of network data
Wiuf, C., Brameier, M., Hagberg, O., and Stumpf, M. P. H. (2006) · 2006
Cited alongside, same era.
Euclidean Embedding of Co-occurrence Data
Globerson, A., Chechik, G., Pereira, F., and Tishby, N. (2007) · 2007
Cited alongside, same era.
Bayesian inference for dynamic social network data
Koskinen, J. H. and Snijders, T. A. (2007) · 2007
Cited alongside, same era.
An L p L^{p} theory of sparse graph convergence I: limits, sparse random graph models and power law distributions
Borgs, C., Chayes, J. T., Cohn, H., and Zhao, Y. (2014) · 2014
Later among the works it cites.
The role of endogenous and exogenous mechanisms in the formation of R&D networks
Tomasello, M. V., Perra, N., Tessone, C. J., Karsai, M., and Schweitzer, F. (2014) · 2014
Later among the works it cites.
Computational methods for a class of network models
Wang, J., Jasra, A., and De Iorio, M. (2014) · 2014
Later among the works it cites.
On the influence of the seed graph in the preferential attachment model
Bubeck, S., Mossel, E., and Racz, M. Z. (2015) · 2015
Later among the works it cites.
Sequential Monte Carlo with highly informative observations
Del Moral, P. and Murray, L. M. (2015) · 2015
Later among the works it cites.
Rate-optimal graphon estimation
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Convergent sequences of dense graphs. I
Borgs, C., Chayes, J. T., Lovász, L., Sós, V. T., and Vesztergombi, K. (2008) · 2008
Cited alongside, same era.
Modeling homophily and stochastic equivalence in symmetric relational data
Hoff, P. (2008) · 2008
Cited alongside, same era.
Goodness of fit of social network models
Hunter, D. R., Goodreau, S. M., and Handcock, M. S. (2008) · 2008
Cited alongside, same era.
Statistical Analysis of Network Data
Kolaczyk, E. D. (2009) · 2009
Cited alongside, same era.
Networks. An Introduction
Newman, M. (2009) · 2009
Cited alongside, same era.
Particle markov chain Monte Carlo methods
Andrieu, C., Doucet, A., and Holenstein, R. (2010) · 2010
Cited alongside, same era.
Gao, C., Lu, Y., and Zhou, H. H. (2015) · 2015
Later among the works it cites.
Generalized Mittag-Leffler distributions arising as limits in preferential attachment models
James, L. F. (2015) · 2015
Later among the works it cites.
Bayesian inference for duplication–mutation with complementarity network models
Jasra, A., Persing, A., Beskos, A., Heine, K., and De Iorio, M. (2015) · 2015
Later among the works it cites.
Bayesian models of graphs, arrays and other exchangeable random structures
Orbanz, P. and Roy, D. M. (2015) · 2015
Later among the works it cites.
Infinite edge partition models for overlapping community detection and link prediction
Zhou, M. (2015) · 2015
Later among the works it cites.
Edge-exchangeable graphs and sparsity
Cai, D., Campbell, T., and Broderick, T. (2016) · 2016
Closest in time.
A new approach to analyzing coevolving longitudinal networks in international relations
Minhas, S., Hoff, P. D., and Ward, M. D. (2016) · 2016
Closest in time.
Nonparametric network models for link prediction
Williamson, S. A. (2016) · 2016
Closest in time.
Preferential attachment and vertex arrival times
Bloem-Reddy, B. and Orbanz, P. (2017) · 2017
Closest in time.
Sparse graphs using exchangeable random measures
Caron, F. and Fox, E. B. (2017) · 2017
Closest in time.
Edge exchangeable models for interaction networks
Crane, H. and Dempsey, W. (2017) · 2017
Closest in time.
On edge exchangeable random graphs
Janson, S. (2017) · 2017
Closest in time.
Joint degree distributions of preferential attachment random graphs
Peköz, E. A., Röllin, A., and Ross, N. (2017) · 2017
Closest in time.
Sampling and inference for Beta Neutral-to-the-Left models of sparse networks
Bloem-Reddy, B., Foster, A., Mathieu, E., and Teh, Y. W. (2018) · 2018
Closest in time.
Network archaeology: phase transition in the recoverability of network history
Young, J.-G., Hébert-Dufresne, L., Laurence, E., Murphy, C., St-Onge, G., and Desrosiers, P. (2018) · 2018
Closest in time.