Results 51 to 60 of about 38,382 (189)
Semi-hyper-connected edge transitive graphs
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Zhao, Meng, Jixiang
openaire +1 more source
Commerce, coalitions, and global value chains: Coordinated and collective lobbying on trade
American Journal of Political Science, EarlyView.Abstract Global value chains (GVCs) have connected firms in complex networks within and across national borders. However, political economy models often assume away production linkages and thus fail to explain pervasive and diverse trade coalitions cutting across industries and firms. I develop a GVC‐centered framework where production linkages through
Hao Zhang
wiley +1 more source
Three shades of self‐regulation with unique complex dynamics, drivers and targets for intervention
British Journal of Educational Technology, EarlyView.Abstract Self‐regulated learning (SRL) is an active process involving multiple interacting components that evolve over time, exhibiting characteristics of complex systems such as non‐linearity, emergent behaviour, self‐organization, and hierarchy. These interactions unfold at different temporal levels, each warranting a dedicated lens to capture their ...
Sonsoles López‐Pernas +2 more
wiley +1 more source
, 2011 We consider the problem of computing all-pairs shortest paths in a directed graph with real weights assigned to vertices. For an $n\times n$ 0-1 matrix $C,$ let $K_{C}$ be the complete weighted graph on the rows of $C$ where the weight of an edge ...
Lingas, Andrzej, Sledneu, Dzmitry
core +1 more source
A tutorial on Bayesian model averaging for exponential random graph models
British Journal of Mathematical and Statistical Psychology, EarlyView.Abstract The use of exponential random graph models (ERGMs) is becoming prevalent in psychology due to their ability to explain and predict the formation of edges between vertices in a network. Valid inference with ERGMs requires correctly specifying endogenous and exogenous effects as network statistics, guided by theory, to represent the network ...
Ihnwhi Heo +2 more
wiley +1 more source
A complete classification of which $(n,k)$-star graphs are Cayley graphs
, 2017 The $(n,k)$-star graphs are an important class of interconnection networks that generalize star graphs, which are superior to hypercubes. In this paper, we continue the work begun by Cheng et al.~(Graphs and Combinatorics 2017) and complete the ...
Cheng, Eddie +4 more
core +1 more source
An extension of the basic local independence model to multiple observed classifications
British Journal of Mathematical and Statistical Psychology, EarlyView.Abstract The basic local independence model (BLIM) is appropriate in situations where populations do not differ in the probabilities of the knowledge states and the probabilities of careless errors and lucky guesses of the items. In some situations, this is not the case. This work introduces the multiple observed classification local independence model
Pasquale Anselmi +8 more
wiley +1 more source
Recipes for Edge-Transitive Tetravalent Graphs
, 2016 This paper is to accompany the Census of Edge-Transitive Tetravalent Graphs, available at jan.ucc.nau.edu/~swilson/C4FullSite/index.html, which is a collection of all known edge-transitive graphs of valence 4 up to 512 vertices. The Census contains information for each graph. This information includes parameters such as group order, diameter, girth etc.
Wilson, Steve, Potočnik, Primož
openaire +2 more sources
Limit Orders and Knightian Uncertainty
International Economic Review, EarlyView.ABSTRACT A wide variety of financial instruments allows risk‐averse traders to reduce their exposure to risk. This raises the question of what financial instruments allow ambiguity‐averse traders to reduce their exposure to ambiguity. We show in this paper that price‐contingent orders, such as limit orders, are sufficient: In a two‐period trading model,
Michael Greinecker, Christoph Kuzmics
wiley +1 more source
Detecting Activations over Graphs using Spanning Tree Wavelet Bases [PDF]
, 2012 We consider the detection of activations over graphs under Gaussian noise, where signals are piece-wise constant over the graph. Despite the wide applicability of such a detection algorithm, there has been little success in the development of ...
Krishnamurthy, Akshay +2 more
core