scientific article; zbMATH DE number 1168330

Publication date: 23 June 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

balance theory triads block models centrality in graphs

Social networks; opinion dynamics (91D30) Applications of graph theory (05C90) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to game theory, economics, and finance (91-01)

Related Items (only showing first 100 items - show all)

Overlapping community detection in networks via sparse spectral decomposition ⋮ Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs ⋮ Brazilian network of PhDs working with probability and statistics ⋮ The minimal \(k\)-core problem for modeling \(k\)-assemblies ⋮ Structural similarity: spectral methods for relaxed blockmodeling ⋮ Spatial science and network science: review and outcomes of a complex relationship ⋮ Normalized discrete Ricci flow used in community detection ⋮ A sharp upper bound on the maximal entry in the principal eigenvector of symmetric nonnegative matrix ⋮ Finding disjoint paths on edge-colored graphs: more tractability results ⋮ Agents of change and the approximation of network outcomes: a simulation study ⋮ Discovering small target sets in social networks: a fast and effective algorithm ⋮ Network-based naive Bayes model for social network ⋮ Sublinear-time distributed algorithms for detecting small cliques and even cycles ⋮ Unequal connections ⋮ ILP approaches to the blockmodel problem ⋮ Correlating temporal communication patterns of the eclipse open source community with performance and creativity ⋮ Asymptotic dependence of in- and out-degrees in a preferential attachment model with reciprocity ⋮ Community detection with the label propagation algorithm: a survey ⋮ Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations ⋮ Small world network models of the dynamics of HIV infection ⋮ Investigating peer and sorting effects within an adaptive multiplex network model ⋮ On imposing connectivity constraints in integer programs ⋮ A note on testing conditional independence for social network analysis ⋮ Subsampling bootstrap of count features of networks ⋮ The ``six-element analysis method for the research on the characteristics of terrorist activities ⋮ An exact algorithm for the maximum probabilistic clique problem ⋮ Community discovery using nonnegative matrix factorization ⋮ Leveraging social media networks for classification ⋮ Maximal and minimal entry in the principal eigenvector for the distance matrix of a graph ⋮ Co-2-plex polynomials ⋮ Detecting communities and their evolutions in dynamic social networks -- a Bayesian approach ⋮ Eccentricity of networks with structural constraints ⋮ Consistency of community detection in networks under degree-corrected stochastic block models ⋮ Credit risk transfer in SME loan guarantee networks ⋮ Node sampling for protein complex estimation in bait-prey graphs ⋮ Reconstructing Markov processes from independent and anonymous experiments ⋮ Combinatorial algorithms for the maximum \(k\)-plex problem ⋮ Detecting local network motifs ⋮ Classification and estimation in the stochastic blockmodel based on the empirical degrees ⋮ The social climbing game ⋮ Searchability of central nodes in networks ⋮ A mixed effects model for longitudinal relational and network data, with applications to international trade and conflict ⋮ Grouping optimization based on social relationships ⋮ Consistency and asymptotic normality of stochastic block models estimators from sampled data ⋮ A hybrid network model to extract key criteria and its application for brand equity evaluation ⋮ Impugning randomness, convincingly ⋮ Spectral clustering and the high-dimensional stochastic blockmodel ⋮ The cohesiveness of subgroups in social networks: A view from game theory ⋮ A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices ⋮ Balanced centrality of networks ⋮ Exponential-family models of random graphs: inference in finite, super and infinite population scenarios ⋮ Improved model-based clustering performance using Bayesian initialization averaging ⋮ Finding large \(k\)-clubs in undirected graphs ⋮ Maximum disjoint paths on edge-colored graphs: approximability and tractability ⋮ Asymptotic structure and singularities in constrained directed graphs ⋮ Multivariate algorithmics for finding cohesive subnetworks ⋮ Heuristics for finding \(k\)-clubs in an undirected graph ⋮ On maximal entries in the principal eigenvector of graphs ⋮ Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions ⋮ Position-specific information in social networks: Are you connected? ⋮ Elucidating strategic network dynamics through computational modeling ⋮ Active exploration for large graphs ⋮ Logit models and logistic regressions for social networks. I: An introduction to Markov graphs and \(p^*\) ⋮ Phase transitions in edge-weighted exponential random graphs: near-degeneracy and universality ⋮ Auxiliary parameter MCMC for exponential random graph models ⋮ Logit models and logistic regressions for social networks. III: Valued relations ⋮ Bounds on maximal and minimal entries of the \(p\)-normalized principal eigenvector of the distance and distance signless Laplacian matrices of graphs ⋮ On making a distinguished vertex of minimum degree by vertex deletion ⋮ Large cliques in sparse random intersection graphs ⋮ Finding similar users in social networks ⋮ Mathematical model and cluster synchronization for a complex dynamical network with two types of chaotic oscillators ⋮ How attitude certainty tempers the effects of faultlines in demographically diverse teams ⋮ Critical points for random Boolean networks ⋮ Effects of network characteristics on reaching the payoff-dominant equilibrium in coordination games: a simulation study ⋮ Modeling social networks from sampled data ⋮ Modularity-maximizing graph communities via mathematical programming ⋮ Role models for complex networks ⋮ Testing Linearity for Network Autoregressive Models ⋮ Experimental designs for multiple-level responses, with application to a large-scale educational intervention ⋮ Maximum likelihood estimation for social network dynamics ⋮ Network formation with endogenous link strength and decreasing returns to investment ⋮ Approximating stationary distributions of fast mixing Glauber dynamics, with applications to exponential random graphs ⋮ Sparse randomized shortest paths routing with Tsallis divergence regularization ⋮ Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing ⋮ Additive and multiplicative effects network models ⋮ Identifying overlapping terrorist cells from the Noordin Top actor-event network ⋮ Degeneracy in sparse ERGMs with functions of degrees as sufficient statistics ⋮ Consistent structure estimation of exponential-family random graph models with block structure ⋮ Detecting structural changes in longitudinal network data ⋮ Competition and fitness in one-mode collaboration network ⋮ Brand diagnostics: Mapping branding effects using consumer associative networks ⋮ Structure properties of one-mode collaboration network model based on rate equation approach ⋮ Blockmodels with maximum concentration. ⋮ Testing spatial dependence in spatial models with endogenous weights matrices ⋮ Multiplexity analysis of networks using multigraph representations ⋮ A motif-based approach to network epidemics ⋮ Phylogenetically informed Bayesian truncated copula graphical models for microbial association networks ⋮ Fruit nutritive factor network ⋮ Social network discovery by mining spatio-temporal events ⋮ Communication networks from the enron email corpus ``It's always about the people. Enron is no different

This page was built for publication: