The following pages link to (Q4397004):
Displaying 50 items.
- Testing Linearity for Network Autoregressive Models (Q91246) (← links)
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (Q276864) (← links)
- The minimal \(k\)-core problem for modeling \(k\)-assemblies (Q282678) (← links)
- Structural similarity: spectral methods for relaxed blockmodeling (Q286617) (← links)
- Spatial science and network science: review and outcomes of a complex relationship (Q291647) (← links)
- Agents of change and the approximation of network outcomes: a simulation study (Q301076) (← links)
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
- An exact algorithm for the maximum probabilistic clique problem (Q405671) (← links)
- Community discovery using nonnegative matrix factorization (Q408633) (← links)
- Leveraging social media networks for classification (Q408668) (← links)
- Maximal and minimal entry in the principal eigenvector for the distance matrix of a graph (Q409384) (← links)
- Co-2-plex polynomials (Q411251) (← links)
- Detecting communities and their evolutions in dynamic social networks -- a Bayesian approach (Q413825) (← links)
- Combinatorial algorithms for the maximum \(k\)-plex problem (Q434188) (← links)
- Impugning randomness, convincingly (Q454396) (← links)
- Finding large \(k\)-clubs in undirected graphs (Q488393) (← links)
- Asymptotic structure and singularities in constrained directed graphs (Q491183) (← links)
- Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions (Q494805) (← links)
- Auxiliary parameter MCMC for exponential random graph models (Q523252) (← links)
- On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
- Large cliques in sparse random intersection graphs (Q528977) (← links)
- How attitude certainty tempers the effects of faultlines in demographically diverse teams (Q544813) (← links)
- Small world network models of the dynamics of HIV infection (Q601173) (← links)
- A mixed effects model for longitudinal relational and network data, with applications to international trade and conflict (Q641138) (← links)
- Spectral clustering and the high-dimensional stochastic blockmodel (Q651016) (← links)
- A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices (Q658141) (← links)
- Logit models and logistic regressions for social networks. I: An introduction to Markov graphs and \(p^*\) (Q676466) (← links)
- Finding similar users in social networks (Q693756) (← links)
- Critical points for random Boolean networks (Q701495) (← links)
- Network formation with endogenous link strength and decreasing returns to investment (Q725068) (← links)
- Social network discovery by mining spatio-temporal events (Q812009) (← links)
- Communication networks from the enron email corpus ``It's always about the people. Enron is no different'' (Q812024) (← links)
- A sharp upper bound on the maximal entry in the principal eigenvector of symmetric nonnegative matrix (Q837012) (← links)
- Unequal connections (Q850885) (← links)
- ILP approaches to the blockmodel problem (Q856277) (← links)
- Correlating temporal communication patterns of the eclipse open source community with performance and creativity (Q857726) (← links)
- A note on testing conditional independence for social network analysis (Q889804) (← links)
- Subsampling bootstrap of count features of networks (Q892240) (← links)
- The ``six-element'' analysis method for the research on the characteristics of terrorist activities (Q893041) (← links)
- Node sampling for protein complex estimation in bait-prey graphs (Q906241) (← links)
- Reconstructing Markov processes from independent and anonymous experiments (Q906437) (← links)
- The cohesiveness of subgroups in social networks: A view from game theory (Q926356) (← links)
- Position-specific information in social networks: Are you connected? (Q943592) (← links)
- Elucidating strategic network dynamics through computational modeling (Q943943) (← links)
- Modeling social networks from sampled data (Q977614) (← links)
- Modularity-maximizing graph communities via mathematical programming (Q977873) (← links)
- Role models for complex networks (Q978723) (← links)
- Maximum likelihood estimation for social network dynamics (Q993234) (← links)
- A motif-based approach to network epidemics (Q1034930) (← links)
- Fruit nutritive factor network (Q1044777) (← links)
