Results 11 to 20 of about 35,277 (187)
Efficient computation of the Shapley value for game-theoretic network centrality [PDF]
, 2013 The Shapley value—probably the most important normative payoff division scheme in coalitional games—has recently been advocated as a useful measure of centrality in networks.
Aaditha, K. V. +4 more
core +3 more sources
Visualising the structure of document search results: A comparison of graph theoretic approaches [PDF]
, 2009 This is the post-print of the article - Copyright @ 2010 Sage PublicationsPrevious work has shown that distance-similarity visualisation or ‘spatialisation’ can provide a potentially useful context in which to browse the results of a query search ...
Busing F. +7 more
core +1 more source
On the relation between Differential Privacy and Quantitative Information Flow [PDF]
, 2011 Differential privacy is a notion that has emerged in the community of statistical databases, as a response to the problem of protecting the privacy of the database's participants when performing statistical queries.
A. Ghosh +13 more
core +7 more sources
Invariant measures concentrated on countable structures [PDF]
, 2016 Let L be a countable language. We say that a countable infinite L-structure M admits an invariant measure when there is a probability measure on the space of L-structures with the same underlying set as M that is invariant under permutations of that set,
Cameron +13 more
core +2 more sources
Structural Data Recognition with Graph Model Boosting [PDF]
, 2017 This paper presents a novel method for structural data recognition using a large number of graph models. In general, prevalent methods for structural data recognition have two shortcomings: 1) Only a single model is used to capture structural variation ...
Miyazaki, Tomo, Omachi, Shinichiro
core +3 more sources
Starling flock networks manage uncertainty in consensus at low cost [PDF]
, 2013 Flocks of starlings exhibit a remarkable ability to maintain cohesion as a group in highly uncertain environments and with limited, noisy information.
Cavagna, Andrea +4 more
core +4 more sources
Graph Theory and Networks in Biology [PDF]
, 2006 In this paper, we present a survey of the use of graph theoretical techniques in Biology. In particular, we discuss recent work on identifying and modelling the structure of bio-molecular networks, as well as the application of centrality measures to ...
Mason, Oliver, Verwoerd, Mark
core +3 more sources
Hardness and Algorithms for Rainbow Connectivity [PDF]
, 2009 An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted rc(G), is the smallest number of colors that are needed in order to make G
Chakraborty, Sourav +3 more
core +4 more sources
Streaming Graph Challenge: Stochastic Block Partition
, 2017 An important objective for analyzing real-world graphs is to achieve scalable performance on large, streaming graphs. A challenging and relevant example is the graph partition problem.
Gadepally, Vijay +11 more
core +1 more source
A semidefinite program for unbalanced multisection in the stochastic block model
, 2016 We propose a semidefinite programming (SDP) algorithm for community detection in the stochastic block model, a popular model for networks with latent community structure.
Perry, Amelia, Wein, Alexander S.
core +1 more source