Cargando…

Efficient and Exact Sampling of Simple Graphs with Given Arbitrary Degree Sequence

Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications ranging from epidemics, through social networks to Internet modeling. Existing graph sampling methods are either link-swap bas...

Descripción completa

Detalles Bibliográficos
Autores principales:	Del Genio, Charo I., Kim, Hyunju, Toroczkai, Zoltán, Bassler, Kevin E.
Formato:	Texto
Lenguaje:	English
Publicado:	Public Library of Science 2010
Materias:	Research Article
Acceso en línea:	https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2851615/ https://www.ncbi.nlm.nih.gov/pubmed/20386694 http://dx.doi.org/10.1371/journal.pone.0010012

Ejemplares similares

Degree Correlations in Directed Scale-Free Networks
por: Williams, Oliver, et al.
Publicado: (2014)

Near-critical SIR epidemic on a random graph with given degrees
por: Janson, Svante, et al.
Publicado: (2016)

Efficiently sampling the realizations of bounded, irregular degree sequences of bipartite and directed graphs
por: Erdős, Péter L., et al.
Publicado: (2018)

Arbitrariness in the choice of action and quantization of the given classical equations of motion
por: Dodonov, V V, et al.
Publicado: (1978)

Efficient enumeration of monocyclic chemical graphs with given path frequencies
por: Suzuki, Masaki, et al.
Publicado: (2014)

Exact order of extreme [Formula: see text] discrepancy of infinite sequences in arbitrary dimension
por: Kritzinger, Ralph, et al.
Publicado: (2022)

An Exact Relation for N=1 Orientifold Field Theories with Arbitrary Superpotential
por: Armoni, Adi, et al.
Publicado: (2004)

Computational Contact Mechanics: Geometrically Exact Theory for Arbitrary Shaped Bodies
por: Konyukhov, Alexander, et al.
Publicado: (2013)

The exact solution of the s-d exchange model with arbitrary impurity spin s: Kondo problem
por: Fateev, V A, et al.
Publicado: (1980)

Learning on Arbitrary Graph Topologies via Predictive Coding
por: Salvatori, Tommaso, et al.
Publicado: (2022)

Martingales and the fixation time of evolutionary graphs with arbitrary dimensionality
por: Monk, Travis, et al.
Publicado: (2022)

Modularity and anti-modularity in networks with arbitrary degree distribution
por: Hintze, Arend, et al.
Publicado: (2010)

deBGR: an efficient and near-exact representation of the weighted de Bruijn graph
por: Pandey, Prashant, et al.
Publicado: (2017)

Exact solutions of the restricted Hartree-Fock equations for arbitrary filling factors p/q
por: Cabo-Montes de Oca, Alejandro
Publicado: (1992)

Exact epidemic models on graphs using graph-automorphism driven lumping
por: Simon, Péter L., et al.
Publicado: (2010)

Analysis of the communities of an urban mobile phone network
por: Botta, Federico, et al.
Publicado: (2017)

Fast calculation of the quartet distance between trees of arbitrary degrees
por: Christiansen, Chris, et al.
Publicado: (2006)

Exact Equations for SIR Epidemics on Tree Graphs
por: Sharkey, K. J., et al.
Publicado: (2013)

Exact transcript quantification over splice graphs
por: Ma, Cong, et al.
Publicado: (2021)

Atom interferometry with arbitrary laser configurations: exact phase shift for potentials including inertia and gravitation
por: Audretsch, J, et al.
Publicado: (1994)

Worst Singularities of Plane Curves of Given Degree
por: Cheltsov, Ivan
Publicado: (2017)

Space-efficient and exact de Bruijn graph representation based on a Bloom filter
por: Chikhi, Rayan, et al.
Publicado: (2013)

An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops
por: Azam, Naveed Ahmed, et al.
Publicado: (2020)

Classification of minimal graphs with given Abelian automorphism group
por: Arlinghaus, William C
Publicado: (1985)

Data Mining a Medieval Medical Text Reveals Patterns in Ingredient Choice That Reflect Biological Activity against Infectious Agents
por: Connelly, Erin, et al.
Publicado: (2020)

Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs
por: Fröhlich, Georg E. A., et al.
Publicado: (2020)

A cell‐centered finite volume formulation of geometrically exact Simo–Reissner beams with arbitrary initial curvatures
por: Bali, Seevani, et al.
Publicado: (2022)

Fundamental monopoles and multimonopole solutions for arbitrary simple gauge groups
por: Weinberg, Erick J
Publicado: (1979)

Elementary exact calculations of degree growth and entropy for discrete equations
por: Halburd, R. G.
Publicado: (2017)

The Smallest Spectral Radius of Graphs with a Given Clique Number
por: Zhang, Jing-Ming, et al.
Publicado: (2014)

A simple example for an exact lattice action
por: Bender, I, et al.
Publicado: (1994)

On the Treewidths of Graphs of Bounded Degree
por: Song, Yinglei, et al.
Publicado: (2015)

On reciprocal degree distance of graphs
por: An, Mingqiang, et al.
Publicado: (2023)

An exact solution for the free-vibration analysis of functionally graded carbon-nanotube-reinforced composite beams with arbitrary boundary conditions
por: Shi, Zeyu, et al.
Publicado: (2017)

Scalable robust graph and feature extraction for arbitrary vessel networks in large volumetric datasets
por: Drees, Dominik, et al.
Publicado: (2021)

Fast methods for generating Lie Algebraic Maps of arbitrary degree for combined thick multipoles
por: Iselin, F Christoph
Publicado: (2000)

Efficient exact motif discovery
por: Marschall, Tobias, et al.
Publicado: (2009)

Generalization of the Ewens sampling formula to arbitrary fitness landscapes
por: Khromov, Pavel, et al.
Publicado: (2018)

On the characterization of claw-free graphs with given total restrained domination number
por: Pi, Xiaoming
Publicado: (2016)

Theory of simple glasses: exact solutions in infinite dimensions
por: Parisi, Giorgio, et al.
Publicado: (2019)

Cannot write session to /tmp/vufind_sessions/sess_460u6ftqmhfhek17p6v2jgovno