Filters








2,278 Hits in 3.7 sec

Non-searchability of random scale-free graphs

Philippe Duchon, Nicole Eggemann, Nicolas Hanusse
2007 Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing - PODC '07  
In this paper, the underlying network is a random scale-free labeled graph whose node identities belong to the range [1, n].  ...  In this paper, we answer negatively to this question for some random scale-free graphs built using a † Roughly speaking, a labeled small-world graph is navigable if a greedy distributed algorithm, using  ...  Related works Scale-free models In the following we summarize two families of scale-free graphs models which are related to our work: pure random graphs and evolving graphs.  ... 
doi:10.1145/1281100.1281183 dblp:conf/podc/DuchonEH07 fatcat:o55solos2ng4vh3dyrekacz4im

Network synchronization: optimal and pessimal scale-free topologies

Luca Donetti, Pablo I Hurtado, Miguel A Muñoz
2008 Journal of Physics A: Mathematical and Theoretical  
By employing a recently introduced optimization algorithm we explicitely design optimally synchronizable (unweighted) networks for any given scale-free degree distribution.  ...  On the other hand, we study the nature of optimally un-synchronizable networks, that is, networks whose topology minimizes the range of stability of the synchronous state.  ...  optimal scale-free networks.  ... 
doi:10.1088/1751-8113/41/22/224008 fatcat:gkzybbilrrf6dbf3dsstdioacy

Toward Privacy-Assured Cloud Data Services with Flexible Search Functionalities

Ming Li, Shucheng Yu, Wenjing Lou, Y. Thomas Hou
2012 2012 32nd International Conference on Distributed Computing Systems Workshops  
Although these functionalities are already prevalent in information retrieval in the plaintext domain, realizing them in the encrypted domain requires non-trivial effort and is relatively new.  ...  User privacy has been a major concern against the widespread adoption of the cloud technology.  ...  Essentially, only the dot products between a query graph and the matching graphs will be preserved, while all of the others are randomized.  ... 
doi:10.1109/icdcsw.2012.41 dblp:conf/icdcsw/LiYLH12 fatcat:etuikjcsv5dgbgoiya7rkms5je

Modeling Traffic of Information Packets on Graphs with Complex Topology [chapter]

Bosiljka Tadić
2003 Lecture Notes in Computer Science  
We determine the statistics of transit times of packets from posting until their arrival to given destinations on the graph when creation rate is varied.  ...  We then implement the algorithm of simultaneous transport of information packets that are created with a given rate and navigated on that graph by local up-to-next-neighbour search algorithm.  ...  [11] for the case of scale-free tree graph.  ... 
doi:10.1007/3-540-44860-8_14 fatcat:ofpgk32w2fez5jkvigcz5bd2gq

Generalizing Kronecker graphs in order to model searchable networks

Elizabeth Bodine, Babak Hassibi, Adam Wierman
2009 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)  
can find very short paths of length O((log log n) 2 ) for graphs with n nodes.  ...  This paper describes an extension to stochastic Kronecker graphs that provides the special structure required for searchability, by defining a "distance"-dependent Kronecker operator.  ...  In [16] , the observed network topology is based upon a hidden metric space, assumed to be a non-Euclidean hyperbolic space, which leads to scale-free topologies, high clustering, and very efficient greedy  ... 
doi:10.1109/allerton.2009.5394816 fatcat:axjvz5fttvdb7dunek255dxley

Networks: Structure and Dynamics [chapter]

Erzsébet Ravasz Regan
2009 Encyclopedia of Complexity and Systems Science  
Thus, networks with diverging connectivity fluctuations (such as scale-free graphs with 2 < γ ≤ 3) have no non-zero epidemic threshold.  ...  They found that the congestion factor of Erdős-Rényi random graphs increases with the size of the network, asymptotically growing to 1, while for scale-free networks it quickly reaches a value of ∼ 0.7  ... 
doi:10.1007/978-0-387-30440-3_356 fatcat:f2zg2yyyavaonfz4m5mwjr6rcu

The "New" Science of Networks

Duncan J. Watts
2004 Annual Review of Sociology  
The steady-state fraction of infectives displays a distinct phase transition (i.e., an epidemic threshold) in the case of a Bernoulli random graph, but not for the scale-free network. forbidden, the network  ...  By fixing the average degree of the network at k = 1, Kretschmar Figure 4 Comparison of disease spreading on Bernoulli (uniform) and scale-free random networks.  ... 
doi:10.1146/annurev.soc.30.020404.104342 fatcat:hpp2borqcjcbhok7z26odmgfca

NAP: The Network Analysis Profiler, a web tool for easier topological analysis and comparison of medium-scale biological networks

Theodosios Theodosiou, Georgios Efstathiou, Nikolas Papanikolaou, Nikos C. Kyrpides, Pantelis G. Bagos, Ioannis Iliopoulos, Georgios A. Pavlopoulos
2017 BMC Research Notes  
It is written in R and Shiny, it is based on the igraph library and it is able to handle medium-scale weighted/unweighted, directed/undirected and bipartite graphs.  ...  It is designed to bridge the gap between network analysis, statistics, graph theory and partially visualization in a user-friendly way.  ...  Protein-protein interaction networks (PPIs) are captured as undirected connected graphs following a scale-free topology with hierarchical modularity [1, 2] .  ... 
doi:10.1186/s13104-017-2607-8 pmid:28705239 pmcid:PMC5513407 fatcat:rzpwo3unnfbfxjzm3tiur7bllm

Structured Encryption and Controlled Disclosure [chapter]

Melissa Chase, Seny Kamara
2010 Lecture Notes in Computer Science  
For this purpose, we introduce the notion of structured encryption which generalizes previous work on symmetric searchable encryption (SSE) to the setting of arbitrarily-structured data.  ...  We consider the problem of encrypting structured data (e.g., a web graph or a social network) in such a way that it can be efficiently and privately queried.  ...  Acknowledgements We are grateful to Kristin Lauter for encouragement during the early stages of this work, to Sherman Chow and Satya Lokam for useful discussions regarding graph encryption and to Susan  ... 
doi:10.1007/978-3-642-17373-8_33 fatcat:fdeoherwqrcxtfyhqes3aew2sy

The navigability of strong ties: Small worlds, tie strength, and network topology

Douglas R. White, Michael Houseman
2002 Complexity  
Doug White is indebted to John Padgett for the invitation to join the Working Group on the Co-Evolution of States and Markets at SFI, and to the editors of the Encyclopaedia of Community, who permitted  ...  some of the literature review presented here to be reused.  ...  The modeling of scale-free power laws and preferential attachment begun by de Sola Price [15, 16] and Rapoport [40] and continued in the stochastic processes literature [6] , missing both in the Erdös-Renyi  ... 
doi:10.1002/cplx.10053 fatcat:2h2wn33am5dj5lo7eolegvyuni

Modeling Transitivity in Complex Networks [article]

Morteza Haghir Chehreghani, Mostafa Haghir Chehreghani
2015 arXiv   pre-print
In this paper, we propose a new model for complex networks which is based on adding transitivity to scale-free models.  ...  However, existing approaches for modeling transitivity suffer from at least one of the following problems: i) they produce graphs from a specific class like bipartite graphs, ii) they do not give an analytical  ...  Compared to the clustering coefficient of random graphs or graphs produced by existing scale-free models, the clustering coefficient of the η model is significantly higher.  ... 
arXiv:1411.0958v5 fatcat:fxpl6cfluzgr3o54v52priyrca

Synchronization in Network Structures: Entangled Topology as Optimal Architecture for Network Design [article]

Luca Donetti, Pablo I. Hurtado, Miguel A. Munoz
2006 arXiv   pre-print
Entangled networks exhibit an excellent (almost optimal) performance with respect to other flow or connectivity properties such as robustness, random walk minimal first-passage times, and good searchability  ...  In these notes we study synchronizability of dynamical processes defined on complex networks as well as its interplay with network topology. Building from a recent work by Barahona and Pecora [Phys.  ...  or scale-free networks, trying to identify key topological features affecting Q.  ... 
arXiv:cond-mat/0602351v1 fatcat:7tl6gvlyvzdv3arutrefq7jfiy

Synchronization in Network Structures: Entangled Topology as Optimal Architecture for Network Design [chapter]

Luca Donetti, Pablo I. Hurtado, Miguel A. Muñoz
2006 Lecture Notes in Computer Science  
Entangled networks exhibit an excellent (almost optimal) performance with respect to other flow or connectivity properties such as robustness, random walk minimal first-passage times, and good searchability  ...  In these notes we study synchronizability of dynamical processes defined on complex networks as well as its interplay with network topology. Building from a recent work by Barahona and Pecora [Phys.  ...  or scale-free networks, trying to identify key topological features affecting Q.  ... 
doi:10.1007/11758532_147 fatcat:se4o6k7ilvhypnk4xk5c47i6wi

Kinetic growth walks on complex networks

Carlos P Herrero
2005 Journal of Physics A: Mathematical and General  
The mean self-intersection length of non-reversal random walks, , scales as a power of the system size N: ∼ N^β, with an exponent β = 0.5 for short-tailed degree distributions and β < 0.5 for scale-free  ...  The efficiency of kinetic growth walks to explore networks is largely reduced by inhomogeneity in the degree distribution, as happens for scale-free networks.  ...  They found that a combination of both criteria yields non-equilibrium scale-free networks with an exponent γ = 3.  ... 
doi:10.1088/0305-4470/38/20/004 fatcat:ap4pkudmgvgzdb5x7t3die7onq

Searchable web sites recommendation

Yang Song, Nam Nguyen, Li-wei He, Scott Imig, Robert Rounthwaite
2011 Proceedings of the fourth ACM international conference on Web search and data mining - WSDM '11  
In our experiment, we discover 10.5 thousand searchable sites and use 5 million unique queries, extracted from one week of log data to build and demonstrate the effectiveness of our searchable web site  ...  We model the conditional probability of a searchable web site being relevant to a given query in term of three main components: the language model of the query, the language model of the content within  ...  Secondly, the initial set of categories is extended by applying random walk on the predefined Wikipedia link graph.  ... 
doi:10.1145/1935826.1935890 dblp:conf/wsdm/SongNHIR11 fatcat:247yxjfhenhr5lxmp7mcfzjyea
« Previous Showing results 1 — 15 out of 2,278 results