scientific article; zbMATH DE number 1168330
This book is a survey of social networks and their mathematical analysis. The first two chapters are a historical introduction and a discussion of types of networks and what data about them are used. The remainder of the book is devoted to the mathematical analysis, beginning with the basics of graph theory and going on to concepts which are specially relevant to social networks: centrality and roles within social groups, balance theory, analysis of significant subgroups of a social group such as cliques, structural equivalence, block models, semigroups of binary relations, dyads, triads, and statistical versions of these models. The book is quite readable, starts with the basics, and gives a good survey of many techniques. I recommend it to anyone interested in the area.
- A motif-based approach to network epidemics
- Lotkaian informetrics and applications to social networks
- Fruit nutritive factor network
- Brazilian network of PhDs working with probability and statistics
- Discovering small target sets in social networks: a fast and effective algorithm
- Network-based naive Bayes model for social network
- On imposing connectivity constraints in integer programs
- Credit risk transfer in SME loan guarantee networks
- Balanced centrality of networks
- Improved model-based clustering performance using Bayesian initialization averaging
- Maximum disjoint paths on edge-colored graphs: approximability and tractability
- Multivariate algorithmics for finding cohesive subnetworks
- Active exploration for large graphs
- Phase transitions in edge-weighted exponential random graphs: near-degeneracy and universality
- Bounds on maximal and minimal entries of the \(p\)-normalized principal eigenvector of the distance and distance signless Laplacian matrices of graphs
- Mathematical model and cluster synchronization for a complex dynamical network with two types of chaotic oscillators
- Brand diagnostics: Mapping branding effects using consumer associative networks
- Blockmodels with maximum concentration.
- Consistency of community detection in networks under degree-corrected stochastic block models
- 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
- Grouping optimization based on social relationships
- A hybrid network model to extract key criteria and its application for brand equity evaluation
- Heuristics for finding \(k\)-clubs in an undirected graph
- On maximal entries in the principal eigenvector of graphs
- Effects of network characteristics on reaching the payoff-dominant equilibrium in coordination games: a simulation study
- 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
- Multiplexity analysis of networks using multigraph representations
- Phylogenetically informed Bayesian truncated copula graphical models for microbial association networks
- Overlapping community detection in networks via sparse spectral decomposition
- Normalized discrete Ricci flow used in community detection
- Sublinear-time distributed algorithms for detecting small cliques and even cycles
- Asymptotic dependence of in- and out-degrees in a preferential attachment model with reciprocity
- Community detection with the label propagation algorithm: a survey
- Investigating peer and sorting effects within an adaptive multiplex network model
- Eccentricity of networks with structural constraints
- Consistency and asymptotic normality of stochastic block models estimators from sampled data
- Exponential-family models of random graphs: inference in finite, super and infinite population scenarios
- Logit models and logistic regressions for social networks. III: Valued relations
- Experimental designs for multiple-level responses, with application to a large-scale educational intervention
- Approximating stationary distributions of fast mixing Glauber dynamics, with applications to exponential random graphs
- 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
- Structure properties of one-mode collaboration network model based on rate equation approach
- Testing spatial dependence in spatial models with endogenous weights matrices
- Nonparametric inference for continuous-time event counting and link-based dynamic network models
- The evolutionary advantage of cultural memory on heterogeneous contact networks
- Identifying influential spreaders in artificial complex networks
- Living in a network of scaling cities and finite resources
- An interactive graphical method for community detection in network data
- The triangle \(k\)-club problem
- A dynamic logistic regression for network link prediction
- Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction
- Diffusion dynamics in small-world networks with heterogeneous consumers
- Network analysis. Methodological foundations.
- Asymptotic structure of constrained exponential random graph models
- Parameterized algorithms for min-max 2-cluster editing
- Detecting direct associations in a network by information theoretic approaches
- Estimating and understanding exponential random graph models
- Critical phenomena in exponential random graphs
- Multiobjective blockmodeling for social network analysis
- Special issue on `network analysis' preface by the guest editors
- On the use of external information in social network analysis
- Fast algorithms for determining (generalized) core groups in social networks
- The graph matching problem
- Markov logic networks
- Network models for social influence processes
- Evaluating the quality of image matrices in blockmodeling
- Eigenvectors and eigenvalues of non-regular graphs
- Strategies for the diffusion of innovations on social networks
- Novel approaches for analyzing biological networks
- A note on the complexity of computing the number of reachable vertices in a digraph
- A tutorial on methods for the modeling and analysis of social network data
- Smart network based portfolios
- Mimetic trust and intra‐organizational network dynamics
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- OR forum: Tenure analytics: models for predicting research impact
- Signed graphs with small positive index of inertia
- Structural search and optimization in social networks
- Identifying influential nodes in dynamic social networks based on degree-corrected stochastic block model
- The minimal k-core problem for modeling k-assemblies
- The evolution of beliefs over signed social networks
- Graph models for social relations
- A category-theoretic approach to social network analysis
- Encyclopedia of social network analysis and mining. With 583 figures and 163 tables. In 3 volumes
- Social network data analytics
- Structural similarity: spectral methods for relaxed blockmodeling
- Introduction to mathematical sociology
- Spatial science and network science: review and outcomes of a complex relationship
- A user's guide to network analysis in R
- Multiagent systems with compasses
- Methods of social network analysis
- Agents of change and the approximation of network outcomes: a simulation study
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4397004)