Results 11 to 20 of about 1,859 (218)
Scaling limit for the random walk on the largest connected component of the critical random graph [PDF]
, 2012 In this article, a scaling limit for the simple random walk on the largest connected component of the Erdos-Rényi random graph G(n,p) in the critical window, p = n−1+λn−4/3, is deduced.
Croydon, David A.
core +1 more source
Inference and Mutual Information on Random Factor Graphs [PDF]
, 2021 Random factor graphs provide a powerful framework for the study of inference problems such as decoding problems or the stochastic block model. Information-theoretically the key quantity of interest is the mutual information between the observed factor ...
Pasch, Matija +5 more
core +1 more source
Quasi-randomness and algorithmic regularity for graphs with general degree distributions [PDF]
, 2010 We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to express how much a given graph “resembles” a random one.
Schacht, Mathias +5 more
core +1 more source
Topologies of Complex Networks: Functions and Structures [PDF]
, 2007 During the last decade, significant efforts have been made toward improving our understanding of the topological structures underlying complex networks and illuminating some of the intriguing large-scale properties exhibited by these systems.
Li, Lun
core +1 more source
Vertex and edge covers with clustering properties: complexity and algorithms [PDF]
, 2009 We consider the concepts of a t-total vertex cover and a t-total edge cover (t≥1), which generalise the notions of a vertex cover and an edge cover, respectively.
Fernau, Henning +3 more
core +1 more source
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 net-works.
Michalak, T +13 more
core +1 more source
An efficient sparse regularity concept [PDF]
, 2009 Let A be a 0/1 matrix of size m×n, and let p be the density of A (i.e., the number of ones divided by m · n). We show that A can be approximated in the cut norm within ε · mnp by a sum of cut matrices (of rank 1), where the number of summands is ...
Cooper, Colin +8 more
core +1 more source
Random planar structures and random graph processes [PDF]
, 2007 Diese Habilitationsschrift richtete auf zwei diskrete Strukturen aus: planare Strukturen und zufällige Graphen-Prozesse. Zunächst werden zufällige planare Strukturen untersucht, mit folgende Gesichtspunkte: - Wieviele planare Strukturen gibt es? -
Kang, Mihyun
core +1 more source
Wireless Networks: New Models and Results [PDF]
, 2007 Wireless communications have gained much currency in the last few decades. In this thesis we present results regarding several wireless communication systems, in particular, wireless networks.
Radhika Gowaikar, Gowaikar, Radhika
core +1 more source
FEBS Open Bio, EarlyView.This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source