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
Clustering and Community Detection in Directed Networks: A Survey [PDF]
, 2013 Networks (or graphs) appear as dominant structures in diverse domains, including sociology, biology, neuroscience and computer science. In most of the aforementioned cases graphs are directed - in the sense that there is directionality on the edges ...
Malliaros, Fragkiskos D. +1 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
Random Walks Along the Streets and Canals in Compact Cities: Spectral analysis, Dynamical Modularity, Information, and Statistical Mechanics [PDF]
, 2006 Different models of random walks on the dual graphs of compact urban structures are considered. Analysis of access times between streets helps to detect the city modularity.
B. Hillier +17 more
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
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
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
Antimatroids and Balanced Pairs [PDF]
, 2013 We generalize the 1/3-2/3 conjecture from partially ordered sets to antimatroids: we conjecture that any antimatroid has a pair of elements x,y such that x has probability between 1/3 and 2/3 of appearing earlier than y in a uniformly random basic word ...
Eppstein, David
core +1 more source
Two Optimal Strategies for Active Learning of Causal Models from Interventional Data
, 2013 From observational data alone, a causal DAG is only identifiable up to Markov equivalence. Interventional data generally improves identifiability; however, the gain of an intervention strongly depends on the intervention target, that is, the intervened ...
Alain Hauser +24 more
core +1 more source