Scispace (Formerly Typeset)
  1. Home
  2. Journals
  3. Random Structures and Algorithms
  4. 2013
  1. Home
  2. Journals
  3. Random Structures and Algorithms
  4. 2013
Showing papers in "Random Structures and Algorithms in 2013"
Journal Article•10.1002/RSA.20470•
The phase transition in random graphs: A simple proof

[...]

Michael Krivelevich1, Benny Sudakov2•
Tel Aviv University1, University of California, Los Angeles2
01 Sep 2013-Random Structures and Algorithms
TL;DR: In this article, it was shown that for any constant > 0, if p = 1−ǫn, then the random graph G(n,p) has whp 1 all connected components of size at most logarithmic in n, while for p = p = 0, with high probability there exists a connected component of size linear in n.
Abstract: The classical result of Erdo˝s and R´enyi shows that the random graph G(n,p) experiencessharp phase transition around p = 1n – for any ǫ > 0 and p = 1−ǫn , all connected componentsof G(n,p) are typically of size O ǫ (logn), while for p = 1+ǫn , with high probability there existsa connected component of size linear in n. We provide a very simple proof of this fundamentalresult; in fact, we prove that in the supercritical regime p = 1+ǫn , the random graph G(n,p)contains typically a path of linear length. We also discuss applications of our technique to otherrandom graph models and to positional games. 1 Introduction In their groundbreaking paper [5] from 1960, Paul Erd˝os and Alfr´ed R´enyi made the followingfundamental discovery: the random graph G(n,p) has a remarkable phase transition around theedge probability p(n) = 1n . For any constant ǫ > 0, if p = 1−ǫn , then the random graph G(n,p)has whp 1 all connected components of size at most logarithmic in n, while for p =

145 citations

Journal Article•10.4000/RSA.910•
Active and Successful Aging. Lifestyle as a Gerontological Idea

[...]

Stephen Katz
01 Jul 2013-Random Structures and Algorithms
TL;DR: In this article, the authors revisited the story of lifestyle in order to reinstate its importance to aging studies and the conclusion considers the example of falling for older people to illustrate how such a crucial issue is also an opportunity to think about lifestyle in critical and reflexive terms.
Abstract: Sociologists Georg Simmel and Max Weber conceived the idea of lifestyle to identify the social connections between individualism and consumerism that emerged with modernity. Pierre Bourdieu, Anthony Giddens and others have given lifestyle critical relevance in their work by including questions of agency and structure in post-traditional society. However, the idea of lifestyle has also become central to gerontological studies and the caring professions around aging and their models of “active” and “successful” aging. At the same time, such models have neglected the theoretical and critical value of lifestyle as a concept for understanding age inequalities and the social determinants of health in later life. This article revisits the story of lifestyle in order to reinstate its importance to aging studies. The conclusion considers the example of falling for older people to illustrate how such a crucial issue is also an opportunity to think about lifestyle in critical and reflexive terms.

112 citations

Journal Article•10.4000/RSA.932•
The Many Meanings of “Active Ageing”. Confronting Public Discourse with Older People’s Stories

[...]

Silke van Dyk, Stephan Lessenich, Tina Denninger, Anna Sarah Richter
01 Jul 2013-Random Structures and Algorithms
TL;DR: In this paper, the authors report on the findings of an empirical research project that asks for the specific images of "old age" and "retirement" becoming prominent in the context of last decade's push for "activation" in German politics.
Abstract: In recent years and throughout the European Union, “active ageing” has become a prominent conception of how to “age well”. In analyzing the governmentality of old age inherent to the “active ageing” paradigm, this paper tries to avoid the short-cut from program to praxis commonly being taken in governmentality studies. It reports on the findings of an empirical research project that asks for the specific images of “old age” and “retirement” becoming prominent in the context of last decade’s push for “activation” in German politics. The analysis combines the reconstruction of so-called “story lines” emerging in public discourse with the evaluation of qualitative interviews with “young” elderly people, conceptualizing older people’s narrations as being an integral part of the discourse itself. Moving from simple, ad-hoc illustrations of theoretical claims concerning a “neoliberal” government of old age to a systematic empirical reconstruction of what may be called the dispositif of “active ageing”, the paper claims to make an innovative contribution to an “empirical theory” of governmentality.

81 citations

Journal Article•10.1002/RSA.20404•
Tight Hamilton cycles in random uniform hypergraphs

[...]

Andrzej Dudek1, Alan Frieze2•
Western Michigan University1, Carnegie Mellon University2
01 May 2013-Random Structures and Algorithms
TL;DR: In this article, it was shown that 1 = n is the asymptotic threshold for the existence of tight Hamilton cycles in random k-uniform hypergraphs, for all k � 3.
Abstract: In this paper we show that 1=n is the asymptotic threshold for the existence of tight Hamilton cycles in random k-uniform hypergraphs, for all k � 3. We also determine thresholds for the existence of other types of Hamilton cycles.

66 citations

Journal Article•10.1002/RSA.20451•
Randomly coloring constant degree graphs

[...]

Martin Dyer1, Alan Frieze2, Thomas P. Hayes3, Eric Vigoda4•
University of Leeds1, Carnegie Mellon University2, University of New Mexico3, Georgia Institute of Technology4
01 Sep 2013-Random Structures and Algorithms
TL;DR: It is proved that the Glauber dynamics converges to a random coloring after O(n log n) steps assuming k /spl ges/ k/ sub 0/ for some absolute constant k/sub 0/,.
Abstract: We study a simple Markov chain, known as the Glauber dynamics, for generating a random k -coloring of an n -vertex graph with maximum degree Δ. We prove that, for every e > 0, the dynamics converges to a random coloring within O(nlog n) steps assuming k ≥ k0(e) and either: (i) k/Δ > α* + e where α*≈ 1.763 and the girth g ≥ 5, or (ii) k/Δ >β * + e where β*≈ 1.489 and the girth g ≥ 7. Our work improves upon, and builds on, previous results which have similar restrictions on k/Δ and the minimum girth but also required Δ = Ω (log n). The best known result for general graphs is O(nlog n) mixing time when k/Δ > 2 and O(n2) mixing time when k/Δ > 11/6. Related results of Goldberg et al apply when k/Δ > α* for all Δ ≥ 3 on triangle-free “neighborhood-amenable” graphs.© 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2013

66 citations

Journal Article•10.1002/RSA.20431•
Comparison of Swendsen‐Wang and heat‐bath dynamics

[...]

Mario Ullrich1•
University of Jena1
01 Jul 2013-Random Structures and Algorithms
TL;DR: In this article, it was shown that the spectral gap of the Swendsen-Wang process for the Potts model on graphs with bounded degree is bounded from below by some constant times the spectral gaps of any single-spin dynamics.
Abstract: We prove that the spectral gap of the Swendsen-Wang process for the Potts model on graphs with bounded degree is bounded from below by some constant times the spectral gap of any single-spin dynamics. This implies rapid mixing for the two-dimensional Potts model at all temperatures above the critical one, as well as rapid mixing at the critical temperature for the Ising model. After this we introduce a modified version of the Swendsen-Wang algorithm for planar graphs and prove rapid mixing for the two-dimensional Potts models at all non-critical temperatures. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 42, 520–535, 2013

38 citations

Journal Article•10.1002/RSA.20412•
Fast simulation of large-scale growth models

[...]

Tobias Friedrich1, Lionel Levine2•
Max Planck Society1, Massachusetts Institute of Technology2
01 Mar 2013-Random Structures and Algorithms
TL;DR: An algorithm that computes the final state of certain growth models without computing all intermediate states is given, based on a “least action principle” which characterizes the odometer function of the growth process.
Abstract: We give an algorithm that computes the final state of certain growth models without computing all intermediate states. Our technique is based on a "least action principle" which characterizes the odometer function of the growth process. Starting from an approximation for the odometer, we successively correct under- and overestimates and provably arrive at the correct final state. Internal diffusion-limited aggregation IDLA is one of the models amenable to our technique. The boundary fluctuations in IDLA were recently proved to be at most logarithmic in the size of the growth cluster, but the constant in front of the logarithm is still not known. As an application of our method, we calculate the size of fluctuations over two orders of magnitude beyond previous simulations, and use the results to estimate this constant. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2012

29 citations

Journal Article•10.1002/RSA.20410•
Percolation and limit theory for the poisson lilypond model

[...]

Mathew D. Penrose1•
University of Bath1
01 Mar 2013-Random Structures and Algorithms
TL;DR: In this article, central limit theorems for the total volume and the number of components of the lilypond model on a sequence of Poisson or binomial point processes on expanding windows were established.
Abstract: The lilypond model on a point process in d -space is a growth-maximal system of non-overlapping balls centred at the points. We establish central limit theorems for the total volume and the number of components of the lilypond model on a sequence of Poisson or binomial point processes on expanding windows. For the lilypond model over a homogeneous Poisson process, we give subexponentially decaying tail bounds for the size of the cluster at the origin. Finally, we consider the enhanced Poisson lilypond model where all the balls are enlarged by a fixed amount the enhancement parameter, and show that for d > 1 the critical value of this parameter, above which the enhanced model percolates, is strictly positive. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2012

25 citations

Journal Article•10.1002/RSA.20425•
Critical window for the vacant set left by random walk on random regular graphs

[...]

Jiří Černý1, Augusto Teixeira2•
ETH Zurich1, École Normale Supérieure2
01 Oct 2013-Random Structures and Algorithms
TL;DR: This paper shows the existence of a critical window of size n-1/3 around u⋆ around the set of vertices not visited by the walk until time, where u > 0 is a fixed positive parameter.
Abstract: We consider the simple random walk on a random d -regular graph with n vertices, and investigate percolative properties of the set of vertices not visited by the walk until time , where u > 0 is a fixed positive parameter. It was shown in Cerný et al., (Ann Inst Henri Poincare Probab Stat 47 (2011) 929–968) that this so-called vacant set exhibits a phase transition at u = u⋆: there is a giant component if u u⋆. In this paper we show the existence of a critical window of size n-1/3 around u⋆. In this window the size of the largest cluster is of order n2/3. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2013

21 citations

Journal Article•10.4000/RSA.1048•
Male Dancing Body, Stigma and Normalising Processes. Playing with (Bodily) Signifieds/ers of Masculinity

[...]

Chiara Bassetti
01 Dec 2013-Random Structures and Algorithms
TL;DR: Based on a multi-sited ethnography on Western theatrical dance, this article focused on the "problem of the male dancer" and discussed the historical genealogy of the stigma and its effect on men's participation in dance.
Abstract: Based on a multi-sited ethnography on Western theatrical dance, the article focuses on the “problem of the male dancer”. Once discussed the historical genealogy of the stigma and its effect on men’s participation in dance, I consider three stigma “antidotes”. Two of them – artistic-professional excellence, manifest in structural inequalities, professional practice and social discourse ; and athleticism, involving discursive and representational strategies – consist of emphasising the masculinising aspects of dancing-as-art/profession (virtuosity, creativity), and dancing-as-leisure/body-activity (prowess, self-control). Neither of them presents as legitimate alternative masculinities ; they are normalising strategies. The third antidote leverages on the choice of the dance style/s, and the use of the markers of embodied identity that styles as bodily, kin­(aesth)etic sub-cultures provide. The increasing variety of styles not only chan­ged Dance’s representation in the West and thus affected men’s presence, but also provides semiotic resources for expressing gender and, more generally, for forms of identity construction and self-presentation that may be alternative to dominant models.

21 citations

Journal Article•10.1002/RSA.20417•
Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non-adaptiveness

[...]

Gianluca De Marco1, Dariusz R. Kowalski2•
University of Salerno1, University of Liverpool2
01 Jan 2013-Random Structures and Algorithms
TL;DR: The problem, known as Counterfeit Coins problem, is to identify the set of defective coins by minimizing the number of weighings, also called queries, because Θ(klog k +1(n/k) queries are enough, even for non‐adaptive algorithms.
Abstract: We are given n coins of which k are heavy (defective), while the remaining n - k are light (good). We know both the weight of the good coins and the weight of the defective ones. Therefore, if we weigh a subset Q ⊆ S with a spring scale, then the outcome will tell us exactly the number of defectives contained in Q. The problem, known as Counterfeit Coins problem, is to identify the set of defective coins by minimizing the number of weighings, also called queries. It is well known that Θ(klog k +1(n/k)) queries are enough, even for non-adaptive algorithms, in case k ≤ cn for some constant 0 < c < 1. A natural interesting generalization arises when we are required to identify any subset of m ≤ k defectives. We show that while for randomized algorithms \documentclass{article}\usepackage{mathrsfs, amsmath, amssymb}\pagestyle{empty}\begin{document}\begin{align*}\tilde{\Theta}(m)\end{align*} \end{document} **image** queries are sufficient, the deterministic non-adaptive counterpart still requires Θ(klog k +1(n/k)) queries, in case k ≤ n/28; therefore, finding any subset of defectives is not easier than finding all of them by a non-adaptive deterministic algorithm. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2012 (A preliminary version of this work appeared in Proceedings of the 30th International Conference on Distributed Computing Systems (ICDCS), 2010.)
Journal Article•10.4000/RSA.904•
De la notion au référentiel international de politique publique. Le savant, l’expert et le politique dans la construction du vieillissement actif

[...]

Thibauld Moulaert, Jean-Philippe Viriot Durandal
01 Jul 2013-Random Structures and Algorithms
TL;DR: In this article, a socio-histoire de l'evolution d'un cadre normatif du vieillir is presented, which demontre non seulement l'intrication entre les productions scientifiques and les grandes organisations internationales (ONU, OCDE, Union europeenne), mais aussi la malleabilite de the notion oscillant entre une acceptation large and transversale des politiques publiques sur le parcours de vie and une interpretation plus etroite
Abstract: L’objectif de cet article est de montrer comment, de simple notion, le “vieillissement actif” s’est progressivement transforme en un referentiel international de politiques publiques en matiere de vieillissement. Base sur une methodologie ad hoc, la recherche presentee ici aborde le “vieillissement actif” par trois entrees : 15 textes de grandes organisations internationales, une revue de la litterature scientifique francophones et anglophones et 11 entretiens d’experts internationaux du “vieillissement actif”. L’article demontre non seulement l’intrication entre les productions scientifiques et les grandes organisations internationales (ONU, OCDE, Union europeenne), mais aussi la malleabilite de la notion oscillant entre une acceptation large et transversale des politiques publiques sur le parcours de vie et une interpretation plus etroite centree sur des politiques sectorielles comme l’emploi. Cette diversite d’interpretations traverse non seulement les grandes organisations, mais marque surtout de forts contrastes entre les litteratures anglophone et francophone. Au final, c’est un regard critique et reflexif qui propose, pour la premiere fois, une socio-histoire de l’evolution d’un cadre normatif du vieillir.
Journal Article•10.4000/RSA.925•
“Bien vieillir” et “faire bonne vieillesse”. Perspective anthropologique et paroles de centenaires

[...]

Frédéric Balard
01 Jul 2013-Random Structures and Algorithms
TL;DR: The authors interroge the concept of "bien vieillir" with the concepts of la vieillesse and du vieilissement, and show that the strategies for "faire bonne vieillese" are different.
Abstract: Cet article interroge le concept de “bien vieillir” en mettant en perspective les representations scientifiques dominantes du successful aging avec les representations de la vieillesse et du vieillissement exprimees par des nonagenaires et centenaires francais. L’approche anthropologique interculturelle permet une remise en question du modele scientifique porte par les societes postindustrielles pour lequel “bien vieillir” reviendrait a ne pas vieillir. A l’inverse, lorsque le vieillissement n’est pas pense via le prisme de la senescence, vieillir signifie un changement pouvant etre positif pour l’individu a condition que sa culture le permette. Les personnes tres âgees etablissent une distinction entre vieillir et la vieillesse ; en consequence, les strategies pour “bien vieillir” et “faire bonne vieillesse” sont differentes. Il s’agit d’abord de lutter puis de s’adapter en depassant ses pertes.
Journal Article•10.1002/RSA.20502•
Local uniformity properties for glauber dynamics on graph colorings

[...]

Thomas P. Hayes1•
University of New Mexico1
27 Jun 2013-Random Structures and Algorithms
TL;DR: This work investigates some local properties which hold with high probability for randomly selected colorings of a fixed graph with no short cycles, and concludes that this approach yields the most efficient known algorithms for sampling random colorings.
Abstract: We investigate some local properties which hold with high probability for randomly selected colorings of a fixed graph with no short cycles In a number of related works, establishing these particular properties has been a crucial step towards proving rapid convergence for the single-site Glauber dynamics, a Markov chain for sampling colorings uniformly at random For a large class of graphs, this approach yields the most efficient known algorithms for sampling random colorings © 2013 Wiley Periodicals, Inc Random Struct Alg, 2013
Journal Article•10.1002/RSA.20407•
Statistical properties of subgroups of free groups

[...]

Frédérique Bassino1, Armando Martino2, Cyril Nicaud1, Enric Ventura3, Pascal Weil4 •
University of Paris1, University of Southampton2, Polytechnic University of Catalonia3, L'Abri4
01 May 2013-Random Structures and Algorithms
TL;DR: In this paper, the authors investigated the statistical properties of the same objects, but with respect to the so-called graph-based distribution, recently introduced by Bassino, Nicaud and Weil.
Abstract: The usual way to investigate the statistical properties of finitely generated subgroups of free groups, and of finite presentations of groups, is based on the so-called word-based distribution: subgroups are generated (finite presentations are determined) by randomly chosen k-tuples of reduced words, whose maximal length is allowed to tend to infinity. In this paper we adopt a different, though equally natural point of view: we investigate the statistical properties of the same objects, but with respect to the so-called graph-based distribution, recently introduced by Bassino, Nicaud and Weil. Here, subgroups (and finite presentations) are determined by randomly chosen Stallings graphs whose number of vertices tends to infinity. Our results show that these two distributions behave quite differently from each other, shedding a new light on which properties of finitely generated subgroups can be considered frequent or rare. For example, we show that malnormal subgroups of a free group are negligible in the graph-based distribution, while they are exponentially generic in the word-based distribution. Quite surprisingly, a random finite presentation generically presents the trivial group in this new distribution, while in the classical one it is known to generically present an infinite hyperbolic group.
Journal Article•10.4000/RSA.918•
Successful Ageing and its Relationship to Contemporary Norms. A Critical Look at the Call to “Age Well”

[...]

Jessica Fagerström, Marja Aartsen
01 Jul 2013-Random Structures and Algorithms
TL;DR: In this paper, the authors investigate to what extend changes in various domains of functioning are related to changes in older adults' perception of well-being, and estimate to what extent changes in these domains are interrelated.
Abstract: Human ageing is inextricably bound to the loss of physical and cognitive functions, loss of social roles, and loss of social contacts, though losses in functioning and social roles not necessarily threatens the level of well-being according to older adults themselves. This paradoxical finding has fuelled the scientific and political arena for many years, and discussions about what is successful aging has not yet subsided. To investigate to what extend changes in various domains of functioning are related to changes in older adults’ perception of well being, we estimate fourteen year trajectories in both domains and estimate to what extend changes in these domains are interrelated. Based on data from the Longitudinal Aging Study Amsterdam (n= 1257), we observed that ageing is associated with losses in multiple domains but decline in many functions is quite small. General well-being, on the other hand, does not decrease. Most striking finding was that there is only weak correlation between decline in domains of functioning generally considered as crucial for successful and decline in general well-being. Thus, aging successfully can be achieved even without doing well.
Journal Article•10.1002/RSA.20465•
Delaying satisfiability for random 2SAT

[...]

Alistair Sinclair1, Dan Vilenchik2•
University of California, Berkeley1, University of California, Los Angeles2
01 Sep 2013-Random Structures and Algorithms
TL;DR: It is shown that there exists an on-line choice algorithm in the above process which results whp in a satisfiable 2CNF formula as long as m/n ≤ (1000/999)1/4, and the two-choice satisfiability threshold for k -SAT for any fixed k coincides with the standard satisfiable threshold for random 2k -S AT.
Abstract: Let (C1,C′(*)),(C2,C′(*)),…,(C m,C′(*)) be a sequence of ordered pairs of 2CNF clauses chosen uniformly at random (with replacement) from the set of all 4 clauses on n variables. Choosing exactly one clause from each pair defines a probability distribution over 2CNF formulas. The choice at each step must be made on-line, without backtracking, but may depend on the clauses chosen previously. We show that there exists an on-line choice algorithm in the above process which results whp in a satisfiable 2CNF formula as long as m/n ≤ (1000/999)1/4. This contrasts with the well-known fact that a random m -clause formula constructed without the choice of two clauses at each step is unsatisfiable whp whenever m/n > 1. Thus the choice algorithm is able to delay satisfiability of a random 2CNF formula beyond the classical satisfiability threshold. Choice processes of this kind in random structures are known as “Achlioptas processes.” This paper joins a series of previous results studying Achlioptas processes in different settings, such as delaying the appearance of a giant component or a Hamilton cycle in a random graph. In addition to the on-line setting above, we also consider an off-line version in which all m clause-pairs are presented in advance, and the algorithm chooses one clause from each pair with knowledge of all pairs. For the off-line setting, we show that the two-choice satisfiability threshold for k -SAT for any fixed k coincides with the standard satisfiability threshold for random 2k -SAT.© 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2013
Journal Article•10.1002/RSA.20398•
Sharp kernel clustering algorithms and their associated Grothendieck inequalities

[...]

Subhash Khot1, Assaf Naor1•
New York University1
01 May 2013-Random Structures and Algorithms
TL;DR: A polynomial time approximation algorithm is designed that achieves an approximation ratio of \documentclass{article}\usepackage{mathrsfs, amsmath, amssymb}\pagestyle{empty} of the quantity
Abstract: In the kernel clustering problem we are given a (large) n × n symmetric positive semidefinite matrix A = (aij) with and a (small) k × k symmetric positive semidefinite matrix B = (bij). The goal is to find a partition {S1,…,Sk} of {1,…n} which maximizes . We design a polynomial time approximation algorithm that achieves an approximation ratio of , where R(B) and C(B) are geometric parameters that depend only on the matrix B, defined as follows: if bij = 〈vi,vj〉 is the Gram matrix representation of B for some then R(B) is the minimum radius of a Euclidean ball containing the points {v1,…,vk}. The parameter C(B) is defined as the maximum over all measurable partitions {A1,…,Ak} of of the quantity , where for i∈{1,…,k} the vector is the Gaussian moment of Ai, i.e., . We also show that for every e > 0, achieving an approximation guarantee of is Unique Games hard. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2013
Journal Article•10.1002/RSA.20423•
Robust characterizations of k-wise independence over product spaces and related testing results†‡§

[...]

Ronitt Rubinfeld1, Ning Xie2•
Tel Aviv University1, Massachusetts Institute of Technology2
01 Oct 2013-Random Structures and Algorithms
TL;DR: An upper bound on the distance between a distribution D from k ‐wise independent distributions in terms of the sum of Fourier coefficients of D at vectors of weight at most k is shown.
Abstract: A discrete distribution D over Σ1 ×··· ×Σn is called (non-uniform) k -wise independent if for any subset of k indices {i1,…,ik} and for any z1∈Σ,…,zk∈Σ, PrX∼D[X···X = z1···zk] = PrX∼D[X = z1]···PrX∼D[X = zk]. We study the problem of testing (non-uniform) k -wise independent distributions over product spaces. For the uniform case we show an upper bound on the distance between a distribution D from k -wise independent distributions in terms of the sum of Fourier coefficients of D at vectors of weight at most k. Such a bound was previously known only when the underlying domain is {0,1}n. For the non-uniform case, we give a new characterization of distributions being k -wise independent and further show that such a characterization is robust based on our results for the uniform case. These results greatly generalize those of Alon et al. (STOC'07, pp. 496–505) on uniform k -wise independence over the Boolean cubes to non-uniform k -wise independence over product spaces. Our results yield natural testing algorithms for k -wise independence with time and sample complexity sublinear in terms of the support size of the distribution when k is a constant. The main technical tools employed include discrete Fourier transform and the theory of linear systems of congruences.© 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2013
Journal Article•10.1002/RSA.20437•
The Bohman-Frieze process near criticality

[...]

Mihyun Kang1, Will Perkins2, Joel Spencer3•
Graz University of Technology1, Georgia Institute of Technology2, Courant Institute of Mathematical Sciences3
01 Sep 2013-Random Structures and Algorithms
TL;DR: The Bohman-Frieze process has a qualitatively similar phase transition to the Erd˝os-Renyi process in terms of the size and structure of the components near the critical point as discussed by the authors.
Abstract: The Bohman-Frieze random graph process, a simple modification of the Erd˝os-Renyi random graph, begins with an empty graph on n vertices. At each step two random edges are presented and if the first edge would join two isolated vertices, it is added to a graph; other- wise the second edge is added. We present several new results on the phase transition of the Bohman-Frieze process, during which a giant component emerges. We show that the Bohman-Frieze process has a qualitatively similar phase transition to the Erd˝os-Renyi process in terms of the size and structure of the components near the critical point. We prove that all components at time tc i † (that is, when the number of edges are (tci†)n/2) are trees or unicyclic components and that the largest component is of size ›(† i2 logn). Further, at tc + †, all components apart from the giant component are trees or unicyclic and the size of the second-largest component is £(† i2 logn). Each of these results corresponds to an analogous well-known result for the Erd˝os-Renyi process. Our methods include combinatorial arguments and a combination of the dierential equation method for random pro- cesses with singularity analysis of generating functions which satisfy quasi-linear partial dierential equations.
Journal Article•10.1002/RSA.20418•
Distribution of the number of spanning regular subgraphs in random graphs

[...]

Pu Gao1•
Max Planck Society1
01 Oct 2013-Random Structures and Algorithms
TL;DR: This paper examines the moments of the number of d -factors in for all p and d satisfying d3 = o(p2n) and determines the limiting distribution of the numbers inside this range.
Abstract: In this paper, we examine the moments of the number of d -factors in for all p and d satisfying d3 = o(p2n). We also determine the limiting distribution of the number of d -factors inside this range with further restriction that as n ∞.© 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2013
Journal Article•10.5380/RSA.V14I2.40932•
Substratos e adubação nitrogenada na produção de mudas de maracujazeiro amarelo

[...]

Csaignon Mariano Caproni, Darlan José Ramos1, João Vieira Neto, Luiz Fernando de Oliveira da Silva, Juliana Carvalho Simões, Wilson Roberto Pereira •
Universidade Federal de Lavras1
31 Aug 2013-Random Structures and Algorithms
TL;DR: In this article, a multiplicacao rapida depende de alguns fatores preponderantes, ligados especificamente aos substratos e complementacoes com adubacoes.
Abstract: A producao de mudas de maracujazeiro amarelo de boa qualidade genetica e fitossanitaria, bem nutridas e precoces e de suma importância, tanto para pegamento como para sobrevivencia no campo. A multiplicacao rapida depende de alguns fatores preponderantes, ligados especificamente aos substratos e complementacoes com adubacoes. Para tentar minimizar esses problemas e oferecer alternativas na propagacao por sementes do maracujazeiro amarelo foi proposto o presente experimento visando a producao de mudas em dois diferentes substratos com adubacoes nitrogenadas, na forma de ureia, em cobertura. O trabalho foi conduzido no telado do viveiro de formacao de mudas da Universidade Federal de Lavras, MG. Foram testadas cinco doses de nitrogenio (0; 400; 800; 1600 e 3200 mg N dm-3 de substrato) e duas composicoes de substratos: A (Provaso® + areia + terra de subsolo, na proporcao de 1:1:3 em volume) e B (Plantmax® + areia + terra de subsolo, na proporcao de 1:1:3 em volume ). O delineamento experimental utilizado foi em blocos ao acaso, em esquema fatorial 5 x 2, com 4 repeticoes e cinco plantas por parcela. Decorridos 120 dias apos a semeadura foram avaliados o comprimento da parte aerea (cm); numero de folhas por planta, massa seca da parte aerea, da raiz e total (g planta-1). A utilizacao de adubacoes nitrogenadas em cobertura em doses de ate 2000 mg N dm-3 de substrato permitiram a formacao de mudas de maracujazeiro amarelo de melhor qualidade. As misturas A (Provaso® + areia + terra de subsolo) e B (Plantmax® + areia + solo) proporcionaram resultados semelhantes, entretanto a mistura B se destacou para algumas caracteristicas avaliadas, proporcionando melhor desenvolvimento as mudas do maracujazeiro amarelo.
Journal Article•10.5380/RSA.V14I1.40834•
Ocorrência e controle de tripes na floração em nectarina ‘bruna’ na lapa, pr

[...]

Lino Bittencourt Monteiro1, Márcio Fernando Swider de Souza1•
Federal University of Paraná1
28 Feb 2013-Random Structures and Algorithms
TL;DR: Results showed that formetanate hydrochloride was more efficient in controlling thrips on blossom, although residual control was lower than that of spinosad and Blue chromotropic traps were more effective for capturing thrips than yellow traps.
Abstract: Tripes tem causado danos em nectarina no municipio da Lapa (PR) e o controle nao tem sido satisfatorio. Os objetivos deste estudo foram determinar as especies de tripes em nectarina na floracao e a eficiencia dos inseticidas cloridrato de formetanato e spinosad no controle de tripes na floracao. Foram utilizados dois metodos de amostragem: armadilhas cromotropicas e batida de ramos. Foram identificados Frankliniella occidentalis (Pergande), F. schultzei (Trybom), F. rodeos Moulton, F. serrata Moulton, F. gardeniae Moulton e Thrips australis (Bagnall), pertencente a familia Thripidae, e Haplothrips gowdeyi (Franklin), da familia Phlaeothripidae. Frankliniella rodeos e F. serrata foram registrados pela primeira vez em nectarina no Brasil. Os resultados mostraram que o inseticida cloridrato de formetanato se mostrou mais eficiente no controle do tripes na floracao, entretanto possuindo um residual inferior ao spinosad; as armadilhas cromotropicas de coloracao azul sao mais efetivas na captura de tripes que as amarelas.
Journal Article•10.5380/RSA.V14I2.40935•
PROPAGAÇÃO VEGETATIVA DE JASMIM-AMARELO (Jasminum mesnyi Hance) VIA ESTAQUIA

[...]

Claudia Tatiana Araujo da Cruz-Silva, Fernanda Pereira Fanti, Katia Christina Zuffellato-Ribas1•
Federal University of Paraná1
31 Aug 2013-Random Structures and Algorithms
TL;DR: In this article, a melhor concentracao de acido indolbutirico (AIB) for enraizamento de estacas herbaceas de jasmim-amarelo (Jasminum mesnyi Hance) was evaluated.
Abstract: O jasmim-amarelo (Jasminum mesnyi Hance), pertencente a familia Oleaceae, e um arbusto semi-herbaceo, cujas flores, amarelas e bastante perfumadas, aparecem em abundância na primavera. Em razao do potencial ornamental da especie esse trabalho objetivou avaliar a melhor concentracao de acido indolbutirico (AIB) para a inducao do enraizamento de estacas herbaceas de jasmim-amarelo. As estacas foram confeccionadas com aproximadamente 5cm de comprimento e 2 folhas apicais, sendo desinfestadas numa solucao de hipoclorito de sodio (0,5%) por 15 minutos. Em seguida, nas bases das estacas foram aplicadas diferentes concentracoes de AIB na forma de talco, conforme os seguintes tratamentos 0, 1000 e 2000 mg Kg-1. As estacas foram plantadas em tubetes contendo vermiculita de granulometria media e acondicionadas em casa de vegetacao (24°C ± 2°C,, UR= 90%) do Setor de Ciencias Biologicas da UFPR, no verao. Apos 48 dias constatou-se que houve um elevado numero de estacas enraizadas de jasmim-amarelo (90 a 95,7%). Para variavel comprimento medio das raizes por estaca, os tratamentos com AIB estimularam o crescimento das raizes diferindo estatisticamente do tratamento controle. Com base nos resultados encontrados, conclui-se que o jasmim-amarelo e uma especie que apresenta uma elevada capacidade de enraizamento, com taxas acima de 90% no verao, podendo ser considerada de facil enraizamento.
Journal Article•10.1002/RSA.20434•
The property of having a k ‐regular subgraph has a sharp threshold

[...]

Shoham Letzter1•
Hebrew University of Jerusalem1
01 Jul 2013-Random Structures and Algorithms
TL;DR: It is proved that the property of containing a $k$-regular subgraph in the random graph model G(n,p) has a sharp threshold for $k\ge3$.
Abstract: In this paper it is proved that in the random graph model G(n,p), the property of containing a k -regular subgraph, has a sharp threshold for k ≥ 3. It is also shown how to use similar methods to prove, quite easily, the (known fact of) sharpness of having a non empty k -core for k ≥ 3. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 42, 509–519, 2013
Journal Article•10.4000/RSA.951•
«Vous êtes tous des gagnants». “Étoile des aînés” et le vieillissement réussi au Québec

[...]

Line Grenier, Fannie Valois-Nadeau
01 Jul 2013-Random Structures and Algorithms
TL;DR: The Toile des aines (Etoile des Aines) Concours de musique reserve as mentioned in this paper was founded by Chartwell et al. in the early 1970s.
Abstract: Cet article s’interesse a “Etoile des aines”, un concours de musique reserve aux citoyens canadiens de 65 ans. Organise et commandite par Chartwell, le plus gros reseau de residences pour personnes âgees au Canada, ce concours vise a « celebrer le talent des retraites ». Fruit d’un projet pilote realise sous le mode d’une ethnographie multi-sites, l’etude explore comment “Etoile des aines”, en tant qu’evenement sis a l’intersection de la musique, des medias et du marche en pleine expansion de l’habitation pour aines, met en evidence des articulations particulieres du “bien vieillir” au Quebec. Nous proposons qu’ “Etoile des aines” agit comme une mediation du “vieillissement reussi”, comme une forme distincte du “bien vieillir”, en insistant sur les enjeux que pose la mise a l’epreuve publique du vieillissement. Nous y examinons deux modalites qui conferent au vieillissement reussi un caractere collectif : l’experience publique et l’engagement partage. Ce concours-spectacle est un terrain privilegie pour comprendre les manieres dont le vieillissement actif se deploie hors des domaines de la sante et de la securite.
Journal Article•10.5380/RSA.V14I3.40908•
Modelagem do crescimento florestal considerando variáveis do ambiente: revisão

[...]

Romualdo Maestri, Carlos Roberto Sanquetta1, José Roberto Soares Scolforo, Sebastião do Amaral Machado1, Ana Paula Dalla Corte1 •
Federal University of Paraná1
31 Dec 2013-Random Structures and Algorithms
TL;DR: Este trabalho teve como objetivo realizar uma revisao do estado da arte sobre a modelagem do crescimento florestal, atraves da inclusao de variaveis do ambiente.
Abstract: Este trabalho teve como objetivo realizar uma revisao do estado da arte sobre a modelagem do crescimento florestal, atraves da inclusao de variaveis do ambiente. Os modelos visam expressar, de forma simplificada, algum aspecto da realidade. Na area florestal, os modelos de crescimento e producao sao muito utilizados visando prever o comportamento dos mesmos, frente as mais diversas situacoes, subsidiando com informacoes, o gestor florestal. Em geral, a modelagem florestal descritiva, e baseada em variaveis independentes como: idade, sitio e densidade populacional. Existe uma tendencia recente em incluir variaveis ambientais nos modelos de forma a proporcionar prognoses do crescimento e producao mais confiaveis.
Journal Article•10.4000/RSA.1054•
Les mutations professionnelles comme soutien de la présence des hommes dans la profession de sage-femme

[...]

Philippe Charrier
01 Dec 2013-Random Structures and Algorithms
TL;DR: The presence minoritaire d'hommes dans des espaces professionnels dits feminins is assez peu courante et peu etudiee as mentioned in this paper.
Abstract: La presence minoritaire d’hommes dans des espaces professionnels dits feminins est assez peu courante et peu etudiee. Le cas des hommes sages-femmes apparait comme un terrain fecond, d’une part parce que ces derniers ne representent pas plus de 2 % des effectifs, d’autre part en raison de l’assignation de cette activite au genre feminin : la denomination associe intimement l’activite a la femme et l’activite semble etre de tout temps exercee par des femmes. Ces hommes sont-ils susceptibles de remettre en cause les pratiques professionnel­les, notamment celles a destination des parturientes ? Font-ils evoluer le rapport a l’empathie ? Transgressent-ils les divisions internes de ce groupe professionnel, precisement la repartition entre les modes d’activite ? Ou encore font-ils evoluer le rapport des professionnels a l’independance et a l’autonomie dans l’exercice de l’activite ? En definitive, les transgressions realisees par les hom­mes semblent plutot limitees. Elles ne sont guere liees a leur presence, laquelle est admise par la majorite des sages-femmes. Les hommes accompagnent les transformations que connait la profession, notamment celles qui visent une meilleure reconnaissance professionnelle, tant materielle que symbolique. Ainsi les mutations professionnelles jouent comme un soutien a la permanence de leur presence dans cet espace professionnel.
Journal Article•10.5380/RSA.V14I2.40891•
Reguladores vegetais aplicados no sulco de plantio em cultivares de cana-de-açúcar

[...]

Marina Munhoz Rosato Ferreira1, Luiz Henrique Zuculo Ferreira, Antonio César Bolonhezi1•
Sao Paulo State University1
31 Aug 2013-Random Structures and Algorithms
TL;DR: The results showed that the use of plant regulators in the furrow applied in cultivars SP89-1115, SP83-2847 e SP81 -3250 promotes increase in number of tillers, increase in diameter of stalk and thus an increase on productivity of stalks.
Abstract: Novas tecnologias de producao tornam-se uma estrategia importante para o incremento da produtividade da cana-de-acucar. O presente trabalho teve como objetivo estudar os efeitos da aplicacao, no sulco de plantio, de reguladores vegetais (RVs - acido indol-butirico (analago de auxina) a 0,05 g dm-3, cinetina (analogo de citocinina) a 0,09 g dm-3 e acido giberelico (analago de giberelina) a 0,05 g dm-3) em oito cultivares de cana-de-acucar para obter informacoes daquelas que melhor se adaptam as condicoes edafoclimaticas da regiao de Pereira Barreto (SP). O experimento foi instalado na Fazenda Santa Terezinha, localizada no municipio de Pereira Barreto – SP, em delineamento experimental de blocos casualizados em esquema de parcelas subdivididas, contendo 8 cultivares e quatro repeticoes (8x2x4). As cultivares foram: SP89-1115, SP81-3250, SP83-2847, SP91-3011, RB72454, RB867515, RB835054 e SP91-3440 tratadas e nao tratadas com RVs. Os resultados permitem concluir que o uso de reguladores vegetais no sulco de plantio nas cultivares SP89-1115, SP83-2847 e SP81-3250 promove o aumento no numero de perfilhos, acrescimos no diâmetro de colmo e, portanto, um incremento na produtividade de colmos.
Journal Article•10.5380/RSA.V14I2.40931•
Influência do ácido indolbutírico no enraizamento de estacas de quaresmeira

[...]

Rodrigo Nicknich1, Arthur Hermann Weiser1, Katia Christina Zuffellato-Ribas1•
Federal University of Paraná1
31 Aug 2013-Random Structures and Algorithms
TL;DR: For instance, in this paper, a set of estacas semilenhosas of plantas matrizes localizadas nos jardins do Campus III da Universidade Federal do Parana, as quais foram confeccionadas com 8 cm de comprimento mantendo-se duas folhas cortadas ao meio na porcao apical.
Abstract: Tibouchina fothergillae (D. C.) Cogn., popularmente conhecida por quaresmeira, e uma especie nativa do Brasil, de grande valor paisagistico, que pode alcancar ate 1,5 metros de altura. Visando a elaboracao de um protocolo de enraizamento da especie, o objetivo deste trabalho foi verificar a influencia de diferentes concentracoes de acido indolbutirico (AIB) na inducao radicial em estacas caulinares de quaresmeira. Em 15/04/2011 foram coletadas estacas semilenhosas de plantas matrizes localizadas nos jardins do Campus III da Universidade Federal do Parana, as quais foram confeccionadas com 8 cm de comprimento mantendo-se duas folhas cortadas ao meio na porcao apical. As estacas foram submetidas aos seguintes tratamentos veiculados na forma de talco: 0 mg Kg-1, 1000 mg Kg-1 e 2000 mg Kg-1 de AIB, sendo plantadas em tubetes com vermiculita de granulometria media e casca de arroz carbonizada (1:1) como substrato e mantidas em casa de vegetacao com nebulizacao intermitente. Foi utilizado um delineamento inteiramente casualizado, com 5 repeticoes e 20 estacas por unidade experimental. Apos 60 dias, foram avaliadas as seguintes variaveis: porcentagem de estacas enraizadas; numero de raizes por estaca; comprimento medio das tres maiores raizes por estaca (cm); porcentagem de estacas com calos, vivas e mortas. Nao houve diferenca significativa entre os tratamentos, tendo como maior media de enraizamento 92%, para os tratamentos com 0 e 2000 mg Kg-1 de AIB, sendo possivel concluir que nao e necessaria a aplicacao de auxina exogena no enraizamento de estacas de Tibouchina fothergillae.

Tools

SciSpace AgentBiomedical AgentSciSpace RecruitSciSpace for EnterpriseAgent GalleryChat with PDFLiterature ReviewAI WriterFind TopicsParaphraserCitation GeneratorExtract DataAI DetectorCitation Booster

Learn

ResourcesLive Workshops

SciSpace

CareersSupportBrowse PapersPricingSciSpace Affiliate ProgramCancellation & Refund PolicyTermsPrivacyData Sources

Directories

PapersTopicsJournalsAuthorsConferencesInstitutionsCitation StylesWriting templates

Extension & Apps

SciSpace Chrome ExtensionSciSpace Mobile App

Contact

support@scispace.com
SciSpace

© 2026 | PubGenius Inc. | Suite # 217 691 S Milpitas Blvd Milpitas CA 95035, USA

soc2
Secured by Delve