The following pages link to (Q4262220):
Displayed 40 items.
- An analytical approach to network motif detection in samples of networks with pairwise different vertex labels (Q428318) (← links)
- A sequential algorithm for generating random graphs (Q603928) (← links)
- On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries (Q652625) (← links)
- A \((0,1)\)-matrix existence theorem and equivalent tiling problems with dimers and monomers (Q745216) (← links)
- The interchange graphs of tournaments with minimum score vectors are exactly hypercubes (Q1043788) (← links)
- The polytope of win vectors (Q1293440) (← links)
- The switch Markov chain for sampling irregular graphs and digraphs (Q1704570) (← links)
- Sampling contingency tables (Q1713620) (← links)
- The flip Markov chain for connected regular graphs (Q1720312) (← links)
- Rejection sampling of bipartite graphs with given degree sequence (Q1737401) (← links)
- Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree (Q1799575) (← links)
- Sampling hypergraphs with given degrees (Q1981695) (← links)
- A review of two network curvature measures (Q1982207) (← links)
- A random walk approach to linear statistics in random tournament ensembles (Q1990209) (← links)
- A triangle process on regular graphs (Q2115867) (← links)
- A fast MCMC algorithm for the uniform sampling of binary matrices with fixed margins (Q2180075) (← links)
- Switch-based Markov chains for sampling Hamiltonian cycles in dense graphs (Q2213805) (← links)
- The number of tournaments with the minimum number of upsets (Q2303437) (← links)
- Sampling \(k\)-partite graphs with a given degree sequence (Q2326166) (← links)
- Efficient importance sampling for binary contingency tables (Q2389598) (← links)
- Construction of all tournament matrices with prescribed row sum vector (Q2449117) (← links)
- Mixing time of the switch Markov chain and stable degree sequences (Q2659068) (← links)
- Are We There Yet? When to Stop a Markov Chain while Generating Random Graphs (Q2900593) (← links)
- A survey of discrete methods in (algebraic) statistics for networks (Q2979659) (← links)
- Uniform Sampling of Digraphs with a Fixed Degree Sequence (Q3057627) (← links)
- Sampling Edge Covers in 3-Regular Graphs (Q3182920) (← links)
- New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling (Q4643313) (← links)
- Uniform sampling of<i>k</i>-hypertournaments (Q4908164) (← links)
- Uniform Generation of Random Regular Graphs (Q4978195) (← links)
- (Q5009531) (← links)
- Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices (Q5020837) (← links)
- Generating Maximally Disassortative Graphs with Given Degree Distribution (Q5113876) (← links)
- Constructing and sampling directed graphs with given degree sequences (Q5137614) (← links)
- Exact sampling of graphs with prescribed degree correlations (Q5151598) (← links)
- A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix (Q5251622) (← links)
- On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries (Q5323079) (← links)
- Fast uniform generation of random graphs with given degree sequences (Q6074660) (← links)
- Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs (Q6085090) (← links)
- Cutoff for rewiring dynamics on perfect matchings (Q6103979) (← links)
- Approximate sampling of graphs with near-\(P\)-stable degree intervals (Q6192073) (← links)