18 results with keyword: 'bound diameter random hyperbolic graphs'
This last result pinpoints a region of hyperbolic space (a constant width band around the origin of sufficiently large radius) where it is likely to find a path of length Θ(log n
N/A
Degree requirements in Arts & Sciences include the demonstration of ability to use another language by completion of the second year of a foreign language or sign language and
N/A
Degree requirements in Arts & Sciences include the demonstration of ability to use another language by completion of the second year of a foreign language or sign language and
N/A
Hence the research paper is an effort to study the Growth rate in Punjab National Bank of India and HDFC Bank limited as both the banks are giant banks in public and private
N/A
Hyperbolic random graphs share many common properties with complex real-world networks; e.g., small diameter and average distance, large clustering coefficient, and a power-law
N/A
The model creates random geometric graphs on the hyperbolic plane, where vertices are connected if they are within a certain threshold distance.. We study typical properties of
N/A
Methodology : AFVU was evaluated for antidepressant effect on the force-swimming test (FST), tail suspension test (TST) and locomotor activity (LC) in the open field test
N/A
Consequently, our results for the continuous energy variations of the predicted total reaction cross section within the energy range (1-100) MeV, and with calculation step of
N/A
Let A(z, u) be the generating function of 2-connected planar graphs with a marked oriented R-brick, where z marks the number of edges, u marks the size of the marked R-brick, and
N/A
Most random graph generators aim at modelling global properties of the graphs, such as degree distribution, clustering coefficient, or effective diameter. 2005 ) do not
N/A
We have argued that our approach cannot only identify all possible aspects from the analysis and design phases but can also provide a means to represent aspects at the key points
N/A
A network is a connected simple planar graph with two marked vertices called the poles, such that adding an edge between the poles, called the root-edge, makes the graph
N/A
For each algorithm, we report several statistics on the obtained results, such as branch and overall coverage, standard deviation ( σ ), mutation score, number of generated test
N/A
Perfect matchings, Hamilton cycles, degree distribution and local clustering in Hyperbolic Random Graphs..
N/A
For distant cell pairs and a fixed pair of weight buckets, the distance between the cells yields an upper bound on the connection probability of included vertices; see Equation
N/A
If the structure of the database your application will be running on contains user defined fields in B1 tables you will need to regenerate the wsdl files in order to have access to
N/A
The first issue is whether Petitioner Dodd owes to USDA Rural Development a balance of $62,218.01 (as of December 17, 2012, see RX 10) in repayment of a United States Department
N/A