To see the other types of publications on this topic, follow the link: Scale-free.

Journal articles on the topic 'Scale-free'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Scale-free.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Zhang, Linjun, Michael Small, and Kevin Judd. "Exactly scale-free scale-free networks." Physica A: Statistical Mechanics and its Applications 433 (September 2015): 182–97. http://dx.doi.org/10.1016/j.physa.2015.03.074.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Barabási, Albert-László, and Eric Bonabeau. "Scale-Free Networks." Scientific American 288, no. 5 (2003): 60–69. http://dx.doi.org/10.1038/scientificamerican0503-60.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

R., Cesar, and Albert-Laszlo Barabasi. "Scale-free networks." Scholarpedia 3, no. 1 (2008): 1716. http://dx.doi.org/10.4249/scholarpedia.1716.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Deijfen, Maria, Remco van der Hofstad, and Gerard Hooghiemstra. "Scale-free percolation." Annales de l'Institut Henri Poincaré, Probabilités et Statistiques 49, no. 3 (2013): 817–38. http://dx.doi.org/10.1214/12-aihp480.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hein, Oliver, Michael Schwind, and Wolfgang König. "Scale-free networks." WIRTSCHAFTSINFORMATIK 48, no. 4 (2006): 267–75. http://dx.doi.org/10.1007/s11576-006-0058-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Liu, Dong, Viktoria Fodor, and Lars Kildehoj Rasmussen. "Will Scale-Free Popularity Develop Scale-Free Geo-Social Networks?" IEEE Transactions on Network Science and Engineering 6, no. 3 (2019): 587–98. http://dx.doi.org/10.1109/tnse.2018.2841942.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lehnert, R., P. Novák, F. Macieira, M. Kuřec, J. a. Teixeira, and T. Branyik. "Optimisation of lab-scale continuous alcohol-free beer production." Czech Journal of Food Sciences 27, No. 4 (2009): 267–75. http://dx.doi.org/10.17221/128/2009-cjfs.

Full text
Abstract:
In order to study the formation and conversion of the most important flavour compounds, the real wort used in alcohol-free beer fermentation was mimicked by a complex model medium containing glucose, yeast extract, and selected aldehydes. The fermentation experiments were carried out in a continuously operating gas-lift reactor with brewing yeast immobilised on spent grains (brewing by-product). During the continuous experiment, parameters such as oxygen supply, residence time (Rt), and temperature (T) were varied to find the optimal conditions for the alcohol-free beer production. The formati
APA, Harvard, Vancouver, ISO, and other styles
8

Graña, Matías, and Juan Pablo Pinasco. "Discrete scale invariance in scale free graphs." Physica A: Statistical Mechanics and its Applications 380 (July 2007): 601–10. http://dx.doi.org/10.1016/j.physa.2007.02.047.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Navascués, María A., Cristina Pacurar, and Vasileios Drakopoulos. "Scale-Free Fractal Interpolation." Fractal and Fractional 6, no. 10 (2022): 602. http://dx.doi.org/10.3390/fractalfract6100602.

Full text
Abstract:
An iterated function system that defines a fractal interpolation function, where ordinate scaling is replaced by a nonlinear contraction, is investigated here. In such a manner, fractal interpolation functions associated with Matkowski contractions for finite as well as infinite (countable) sets of data are obtained. Furthermore, we construct an extension of the concept of α-fractal interpolation functions, herein called R-fractal interpolation functions, related to a finite as well as to a countable iterated function system and provide approximation properties of the R-fractal functions. More
APA, Harvard, Vancouver, ISO, and other styles
10

Copelli, M., and P. R. A. Campos. "Excitable scale free networks." European Physical Journal B 56, no. 3 (2007): 273–78. http://dx.doi.org/10.1140/epjb/e2007-00114-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Pasetto, Stefano, Cesare Chiosi, Mark Cropper, and Eva K. Grebel. "Scale-free convection theory." Proceedings of the International Astronomical Union 11, A29B (2015): 747. http://dx.doi.org/10.1017/s1743921316006700.

Full text
Abstract:
AbstractConvection is one of the fundamental mechanisms to transport energy, e.g., in planetology, oceanography, as well as in astrophysics where stellar structure is customarily described by the mixing-length theory, which makes use of the mixing-length scale parameter to express the convective flux, velocity, and temperature gradients of the convective elements and stellar medium. The mixing-length scale is taken to be proportional to the local pressure scale height of the star, and the proportionality factor (the mixing-length parameter) must be determined by comparing the stellar models to
APA, Harvard, Vancouver, ISO, and other styles
12

Barabási, Albert-László, Erzsébet Ravasz, and Tamás Vicsek. "Deterministic scale-free networks." Physica A: Statistical Mechanics and its Applications 299, no. 3-4 (2001): 559–64. http://dx.doi.org/10.1016/s0378-4371(01)00369-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

Jeong, Hawoong. "Complex scale-free networks." Physica A: Statistical Mechanics and its Applications 321, no. 1-2 (2003): 226–37. http://dx.doi.org/10.1016/s0378-4371(02)01774-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

Scholz, Jan, Mathäus Dejori, Martin Stetter, and Martin Greiner. "Noisy scale-free networks." Physica A: Statistical Mechanics and its Applications 350, no. 2-4 (2005): 622–42. http://dx.doi.org/10.1016/j.physa.2004.11.012.

Full text
APA, Harvard, Vancouver, ISO, and other styles
15

Orabona, Francesco, and Dávid Pál. "Scale-free online learning." Theoretical Computer Science 716 (March 2018): 50–69. http://dx.doi.org/10.1016/j.tcs.2017.11.021.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

Miyoshi, Naoto, Takeya Shigezumi, Ryuhei Uehara, and Osamu Watanabe. "Scale free interval graphs." Theoretical Computer Science 410, no. 45 (2009): 4588–600. http://dx.doi.org/10.1016/j.tcs.2009.08.012.

Full text
APA, Harvard, Vancouver, ISO, and other styles
17

Freeman, Walter. "Scale-free neocortical dynamics." Scholarpedia 2, no. 2 (2007): 1357. http://dx.doi.org/10.4249/scholarpedia.1357.

Full text
APA, Harvard, Vancouver, ISO, and other styles
18

Fox Keller, Evelyn. "Revisiting “scale-free” networks." BioEssays 27, no. 10 (2005): 1060–68. http://dx.doi.org/10.1002/bies.20294.

Full text
APA, Harvard, Vancouver, ISO, and other styles
19

Small, Michael, Kevin Judd, and Thomas Stemler. "A surrogate for networks—How scale-free is my scale-free network?" IEICE Proceeding Series 2 (March 17, 2014): 236–39. http://dx.doi.org/10.15248/proc.2.236.

Full text
APA, Harvard, Vancouver, ISO, and other styles
20

WOERLEE, GEERT FEYE. "Water-Free Dyeing of Textiles from Lab to Industrial Scale." Sen'i Gakkaishi 69, no. 10 (2013): P_341—P_342. http://dx.doi.org/10.2115/fiber.69.p_341.

Full text
APA, Harvard, Vancouver, ISO, and other styles
21

Stumpf, M. P. H., C. Wiuf, and R. M. May. "Subnets of scale-free networks are not scale-free: Sampling properties of networks." Proceedings of the National Academy of Sciences 102, no. 12 (2005): 4221–24. http://dx.doi.org/10.1073/pnas.0501179102.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Martin, Nicolas, Paolo Frasca, and Carlos Canudas-de-Wit. "Large-Scale Network Reduction Towards Scale-Free Structure." IEEE Transactions on Network Science and Engineering 6, no. 4 (2019): 711–23. http://dx.doi.org/10.1109/tnse.2018.2871348.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Ansótegui , Carlos, Maria Luisa Bonet, and Jordi Levy. "Scale-Free Random SAT Instances." Algorithms 15, no. 6 (2022): 219. http://dx.doi.org/10.3390/a15060219.

Full text
Abstract:
We focus on the random generation of SAT instances that have properties similar to real-world instances. It is known that many industrial instances, even with a great number of variables, can be solved by a clever solver in a reasonable amount of time. This is not possible, in general, with classical randomly generated instances. We provide a different generation model of SAT instances, called scale-free random SAT instances. This is based on the use of a non-uniform probability distribution P(i)∼i−β to select variable i, where β is a parameter of the model. This results in formulas where the
APA, Harvard, Vancouver, ISO, and other styles
24

Rajula, Hema Sekhar Reddy, Matteo Mauri, and Vassilios Fanos. "Scale-free networks in metabolomics." Bioinformation 14, no. 03 (2018): 140–44. http://dx.doi.org/10.6026/97320630014140.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

Tao, Zhou, and Wang Bing-Hong. "Catastrophes in Scale-Free Networks." Chinese Physics Letters 22, no. 5 (2005): 1072–75. http://dx.doi.org/10.1088/0256-307x/22/5/012.

Full text
APA, Harvard, Vancouver, ISO, and other styles
26

Dos Santos, A. M., M. L. De Almeida, G. A. Mendes, and L. R. Da Silva. "Generalized scale-free homophilic network." International Journal of Modern Physics C 26, no. 09 (2015): 1550097. http://dx.doi.org/10.1142/s0129183115500977.

Full text
Abstract:
We propose a simple network growth process where the preferential attachment contains two essential parameters: homophily, namely, the tendency of sites to link with similar ones, and the number of attaching neighbors. It jointly generalizes the Barabási–Albert model and the scale-free homophilic model with a control parameter which tunes the importance of the homophily on preferential attachment process. Our results support a detailed discussion about different kinds of correlation, in special a fitness correlation introduced in this paper, and comparisons between BA model, scale-free homophi
APA, Harvard, Vancouver, ISO, and other styles
27

Krishnamurthy, Deepak, Hongquan Li, François Benoit du Rey, et al. "Scale-free vertical tracking microscopy." Nature Methods 17, no. 10 (2020): 1040–51. http://dx.doi.org/10.1038/s41592-020-0924-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
28

Petermann, T., and P. De Los Rios. "Exploration of scale-free networks." European Physical Journal B - Condensed Matter and Complex Systems 38, no. 2 (2004): 201–4. http://dx.doi.org/10.1140/epjb/e2004-00021-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

Alam, Maksudul, Maleq Khan, Kalyan S. Perumalla, and Madhav Marathe. "Generating Massive Scale-free Networks." ACM Transactions on Parallel Computing 7, no. 2 (2020): 1–35. http://dx.doi.org/10.1145/3391446.

Full text
APA, Harvard, Vancouver, ISO, and other styles
30

ZHAO, YULI, FRANCIS C. M. LAU, ZHILIANG ZHU, and HAI YU. "SCALE-FREE LUBY TRANSFORM CODES." International Journal of Bifurcation and Chaos 22, no. 04 (2012): 1250094. http://dx.doi.org/10.1142/s0218127412500940.

Full text
Abstract:
This paper reports the characteristics and performance of a new type of Luby Transform codes, namely scale-free Luby Transform (SF-LT) codes. In the SF-LT codes, the degree of the encoded symbol follows a modified power-law distribution. Moreover, the complexity and decoding performance of SF-LT codes are compared with LT codes based on robust soliton degree distribution and LT codes based on suboptimal degree distribution. The results show that SF-LT codes outperform other LT codes in terms of the probability of successful decoding over an ideal channel and a binary erasure channel. Moreover,
APA, Harvard, Vancouver, ISO, and other styles
31

Elahi, Pascal J., Robert J. Thacker, Lawrence M. Widrow, and Evan Scannapieco. "Subhaloes in scale-free cosmologies." Monthly Notices of the Royal Astronomical Society 395, no. 4 (2009): 1950–62. http://dx.doi.org/10.1111/j.1365-2966.2009.14707.x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Goh, K. I., E. Oh, H. Jeong, B. Kahng, and D. Kim. "Classification of scale-free networks." Proceedings of the National Academy of Sciences 99, no. 20 (2002): 12583–88. http://dx.doi.org/10.1073/pnas.202301299.

Full text
APA, Harvard, Vancouver, ISO, and other styles
33

Campos, Paulo R. A., and Viviane M. de Oliveira. "Scale-free networks in evolution." Physica A: Statistical Mechanics and its Applications 325, no. 3-4 (2003): 570–76. http://dx.doi.org/10.1016/s0378-4371(03)00245-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Corso, G., J. E. Freitas, and L. S. Lucena. "A multifractal scale-free lattice." Physica A: Statistical Mechanics and its Applications 342, no. 1-2 (2004): 214–20. http://dx.doi.org/10.1016/j.physa.2004.04.081.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

Shen, Yue, and Yu-Qing Lou. "Gravitationally coupled scale-free discs." Monthly Notices of the Royal Astronomical Society 353, no. 1 (2004): 249–69. http://dx.doi.org/10.1111/j.1365-2966.2004.08065.x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
36

WU, Jun, Yue-Jin TAN, Hong-Zhong DENG, and Da-Zhi ZHU. "Heterogeneity of Scale-free Networks." Systems Engineering - Theory & Practice 27, no. 5 (2007): 101–5. http://dx.doi.org/10.1016/s1874-8651(08)60036-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
37

Xie, Yan-Bo, Tao Zhou, and Bing-Hong Wang. "Scale-free networks without growth." Physica A: Statistical Mechanics and its Applications 387, no. 7 (2008): 1683–88. http://dx.doi.org/10.1016/j.physa.2007.11.005.

Full text
APA, Harvard, Vancouver, ISO, and other styles
38

Dondajewski, M., and J. Szymański. "Branches in scale-free trees." Journal of Mathematical Sciences 161, no. 6 (2009): 961–68. http://dx.doi.org/10.1007/s10958-009-9615-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
39

Gała̧zka, M., and J. Szymański. "Security of scale-free networks." Journal of Mathematical Sciences 182, no. 2 (2012): 200–209. http://dx.doi.org/10.1007/s10958-012-0740-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Clote, P. "Are RNA networks scale-free?" Journal of Mathematical Biology 80, no. 5 (2020): 1291–321. http://dx.doi.org/10.1007/s00285-019-01463-z.

Full text
APA, Harvard, Vancouver, ISO, and other styles
41

QIN, QIONG, ZHIPING WANG, FANG ZHANG, and PENGYUAN XU. "EVOLVING SCALE-FREE NETWORK MODEL." International Journal of Modern Physics B 22, no. 13 (2008): 2139–49. http://dx.doi.org/10.1142/s0217979208039307.

Full text
Abstract:
The Barabási–Albert (BA) model is extended here to include the concept of modifying the preferential attachment and combining the global preferential attachment with local preferential attachment. Our preferential attachment makes the nodes with higher degree increase less rapidly than the BA model after a long time. The maximum degree is introduced. We compare the time-evolution of the degree of the BA model and our model to illustrate that our model can control the degree of some nodes increasing dramatically with increasing time. Using the continuum theory and the rate equation method, we o
APA, Harvard, Vancouver, ISO, and other styles
42

Abe, S., and N. Suzuki. "Scale-free network of earthquakes." Europhysics Letters (EPL) 65, no. 4 (2004): 581–86. http://dx.doi.org/10.1209/epl/i2003-10108-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
43

Helbig, Thorsten, Jochen Riederer, Florian Kamp, and Matthias Oppe. "Free-form on every scale." Steel Construction 9, no. 3 (2016): 249–54. http://dx.doi.org/10.1002/stco.201620031.

Full text
APA, Harvard, Vancouver, ISO, and other styles
44

Hirose, Kei, Yukihiro Ogura, and Hidetoshi Shimodaira. "ESTIMATING SCALE-FREE NETWORKS VIA THE EXPONENTIATION OF MINIMAX CONCAVE PENALTY." Journal of the Japanese Society of Computational Statistics 28, no. 1 (2015): 139–54. http://dx.doi.org/10.5183/jjscs.1503001_215.

Full text
APA, Harvard, Vancouver, ISO, and other styles
45

Lee, Kang-won, Hee-kwan Uhm, and Hye-jin Choe. "Tunable Network Generation Model for Small-World and Scale-Free Network." Journal of Korean Institute of Communications and Information Sciences 42, no. 7 (2017): 1392–401. http://dx.doi.org/10.7840/kics.2017.42.7.1392.

Full text
APA, Harvard, Vancouver, ISO, and other styles
46

Finke, J., N. Quijano, and K. M. Passino. "Emergence of scale-free networks from ideal free distributions." EPL (Europhysics Letters) 82, no. 2 (2008): 28004. http://dx.doi.org/10.1209/0295-5075/82/28004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
47

Choi, WooSeok, Ashtosh Sharma, Shizhi Qian, Geunbae Lim, and Sang Woo Joo. "Is free surface free in micro-scale electrokinetic flows?" Journal of Colloid and Interface Science 347, no. 1 (2010): 153–55. http://dx.doi.org/10.1016/j.jcis.2010.03.049.

Full text
APA, Harvard, Vancouver, ISO, and other styles
48

Lee, Kang-won, Jae-hoon Lee, and Hye-zin Choe. "Generalized Network Generation Method for Small-World Network and Scale-Free Network." Journal of Korean Institute of Communications and Information Sciences 41, no. 7 (2016): 754–64. http://dx.doi.org/10.7840/kics.2016.41.7.754.

Full text
APA, Harvard, Vancouver, ISO, and other styles
49

MATSUNAGA, Tsutomu, Shuhei KUWATA, and Masaaki MURAMATSU. "Empirical analysis of scale-free patterns of connectivity in medical term occurrence." Journal of Japan Society for Fuzzy Theory and Intelligent Informatics 27, no. 2 (2015): 616–20. http://dx.doi.org/10.3156/jsoft.27.616.

Full text
APA, Harvard, Vancouver, ISO, and other styles
50

Urbanovská, Michaela, and Antonín Komenda. "Neural networks for model-free and scale-free automated planning." Knowledge and Information Systems 63, no. 12 (2021): 3103–38. http://dx.doi.org/10.1007/s10115-021-01619-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!