Zobrazeno 1 - 10
of 115
pro vyhledávání: '"Hagberg, Aric A."'
Autor:
Ushijima-Mwesigwa, Hayato, Hyman, Jeffrey D., Hagberg, Aric, Safro, Ilya, Karra, Satish, Gable, Carl W., Sweeney, Matthew R., Srinivasan, Gowri
We present a topology-based method for mesh-partitioning in three-dimensional discrete fracture network (DFN) simulations that take advantage of the intrinsic multi-level nature of a DFN. DFN models are used to simulate flow and transport through low
Externí odkaz:
http://arxiv.org/abs/1902.08029
We examine the design of the entrainment process for an uncountably infinite collection of coupled phase oscillators that are all subject to the same periodic driving signal. In the absence of coupling, an appropriately designed input can result in e
Externí odkaz:
http://arxiv.org/abs/1707.01599
Cyber-physical systems are critical infrastructures that are crucial both to the reliable delivery of resources such as energy, and to the stable functioning of automatic and control architectures. These systems are composed of interdependent physica
Externí odkaz:
http://arxiv.org/abs/1602.06604
We analyze the component evolution in inhomogeneous random intersection graphs when the average degree is close to 1. As the average degree increases, the size of the largest component in the random intersection graph goes through a phase transition.
Externí odkaz:
http://arxiv.org/abs/1301.7320
Spatial search problems abound in the real world, from locating hidden nuclear or chemical sources to finding skiers after an avalanche. We exemplify the formalism and solution for spatial searches involving two agents that may or may not choose to s
Externí odkaz:
http://arxiv.org/abs/1103.4888
Social computation, whether in the form of searches performed by swarms of agents or collective predictions of markets, often supplies remarkably good solutions to complex problems. In many examples, individuals trying to solve a problem locally can
Externí odkaz:
http://arxiv.org/abs/1103.4854
Shortest path network interdiction is a combinatorial optimization problem on an activity network arising in a number of important security-related applications. It is classically formulated as a bilevel maximin problem representing an "interdictor"
Externí odkaz:
http://arxiv.org/abs/1009.0556
Random intersection graphs (RIGs) are an important random structure with applications in social networks, epidemic networks, blog readership, and wireless sensor networks. RIGs can be interpreted as a model for large randomly formed non-metric data s
Externí odkaz:
http://arxiv.org/abs/1005.5475
Publikováno v:
CPAIOR 2009
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdiction, the task of the interdictor is to find a set of edges in a weig
Externí odkaz:
http://arxiv.org/abs/0903.0173
Publikováno v:
Bollen J, Van de Sompel H, Hagberg A, Chute R, 2009 A Principal Component Analysis of 39 Scientific Impact Measures. PLoS ONE 4(6): e6022. (http://www.plosone.org/article/info%3Adoi%2F10.1371%2Fjournal.pone.0006022)
The impact of scientific publications has traditionally been expressed in terms of citation counts. However, scientific activity has moved online over the past decade. To better capture scientific impact in the digital era, a variety of new impact me
Externí odkaz:
http://arxiv.org/abs/0902.2183